A survey of construction and manipulation of octrees
Computer Vision, Graphics, and Image Processing
Near real-time shadow generation using BSP trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
Computing depth orders for fat objects and related problems
Computational Geometry: Theory and Applications
Proceedings of the eleventh annual symposium on Computational geometry
Range searching and point location among fat objects
Journal of Algorithms
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Improving the Performance of Multi-Dimensional Access Structures Based on k-d-Trees
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Linear Size Binary Space Partitions for Fat Objects
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Binary space partitions for fat rectangles
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient perspective-accurate silhouette computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
The analysis of a simple k-means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry
Expected-case complexity of approximate nearest neighbor searching
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry
Linear-size approximate voronoi diagrams
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Empirical Study of a New Approach to Nearest Neighbor Searching
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Box-trees for collision checking in industrial installations
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting and computing depth orders for fat objects
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Robot path planning: complexity, flexibility and application scope
PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Improved bounds on the union complexity of fat objects
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Efficient and accurate rendering of complex light sources
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |