Skip to search formSkip to main contentSkip to account menu

Quadtree

Known as: Quad tree, Quadtree decomposition, T-pyramid 
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are most often used to partition a two… 
Wikipedia (opens in a new tab)

Related topics

Related topics

40 relations
Binary heapBinary space partitioningBinary treeCoding tree unit

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Multi-dimensional data indexing and range query processing via Voronoi diagram for internet of things
2018
2018
Scalable Point Cloud Geometry Coding with Binary Tree Embedded Quadtree
Many applications of point cloud have recently been identified in automobile navigation system, visual communication, and so on… 
Highly Cited
2016
Highly Cited
2016
Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search
With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatio-textual… 
Highly Cited
2013
Highly Cited
2013
Parallel Computation of Skyline and Reverse Skyline Queries Using MapReduce
The skyline operator and its variants such as dynamic skyline and reverse skyline operators have attracted considerable attention… 
Highly Cited
2011
Highly Cited
2011
Protection of query privacy for continuous location based services
Location-based services (LBS) have become an immensely valuable source of real-time information and guidance. Nonetheless, the… 
Highly Cited
2000
Highly Cited
2000
Interactive Organ Segmentation Using Graph Cuts
An N-dimensional image is divided into “object” and “background” segments using a graph cut approach. A graph is formed by… 
Highly Cited
1995
Highly Cited
1995
Accelerating fractal image compression by multi-dimensional nearest neighbor search
  • D. Saupe
  • Proceedings DCC '95 Data Compression Conference
  • 1995
  • Corpus ID: 13129907
In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list… 
Highly Cited
1987
Highly Cited
1987
Variable block-size image coding
  • J. VaiseyA. Gersho
  • ICASSP '87. IEEE International Conference on…
  • 1987
  • Corpus ID: 117742543
Current algorithms for the efficient coding of images generally employ one of two techniques: Vector Quantization or Transform… 
Highly Cited
1985
Highly Cited
1985
A quad-tree approach to image segmentation which combines statistical and spatial information
Highly Cited
1977
Highly Cited
1977
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
SummaryGiven a file of N records each of which has k keys, the worst-case analysis for the region and partial region queries in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)