Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

40 relations
Binary heapBinary space partitioningBinary treeCoding tree unit
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Accelerating t-SNE using tree-based algorithms
The paper investigates the acceleration of t-SNE--an embedding technique that is commonly used for the visualization of high… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Block Merging for Quadtree-Based Partitioning in HEVC
The joint development of the upcoming High Efficiency Video Coding (HEVC) standard by ITU-T Video Coding Experts Group and ISO… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Quad trees a data structure for retrieval on composite keys
SummaryThe quad tree is a data structure appropriate for storing information to be retrieved on composite keys. We discuss the… Expand
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A quadtree approach to domain decomposition for spatial interpolation in Grid computing environments
Spatial interpolation is widely used in geographical information systems to create continuous surfaces from discrete data points… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree… Expand
  • table 1
  • figure 2
  • table 4
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Simple and Efficient Traversal Methods for Quadtrees and Octrees
Abstract Quadtrees and octrees are used extensively throughout computer graphics and in many other diverse fields such as… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Optimal and efficient path planning for partially-known environments
  • A. Stentz
  • Proceedings of the IEEE International Conference…
  • 1994
    • Corpus ID: 229853
The task of planning trajectories for a mobile robot has received considerable attention in the research literature. Most of the… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Quadtree and Related Hierarchical Data Structures
Apercu sur les quadarbres et les structures de donnees hierarchiques. Elles sont basees sur le principe de decomposition… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A Modified Quadtree Approach To Finite Element Mesh Generation
By allowing the use of quadrants with cut corners, this modeling technique overcomes some of the drawbacks of standard quadtree… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
An effective way to represent quadtrees
A quadtree may be represented without pointers by encoding each black node with a quaternary integer whose digits reflect… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE