HOME ] UP ] CG in C ] Great Wall ] Polytope ] Graham ] Quickhull ] 3dCH ] CH ] Caliper ] Sweepline ] Width+Diameter ] Kernel ] Shortest ] Spiral ] Tripod ] AGP ] Simple ] Triangulation ] MWT ] VD&DT ] VD+DT ] Skeleton ] Gishur ] RealDT ] Closest ] Proximity ] Crust ] Alpha ] Beta ] Medial ] Beach Line ] Higher-Order VD ] Dual ] MRD ] 4D Cube ] 4D Polytope ] HyperStar ] MEC ] 3dCH+2dDT ] Location ] TrapMap ] BSP ] kd-Tree ] [ Range Tree ] PST ] Windowing ]


Range Tree


2D Range Tree@cs.umd.edu

(Courtesy of http://www.cs.umd.edu/~brabec/quadtree/RANGEtrees/range.html)

H. Samet, The Design and Analysis of Spatial Data Structures , Addison-Wesley, Reading, MA, 1990. ISBN 0-201-50255-0
H. Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS , Addison-Wesley, Reading, MA, 1990. ISBN 0-201-50300-0


TOP

HOME ] UP ] CG in C ] Great Wall ] Polytope ] Graham ] Quickhull ] 3dCH ] CH ] Caliper ] Sweepline ] Width+Diameter ] Kernel ] Shortest ] Spiral ] Tripod ] AGP ] Simple ] Triangulation ] MWT ] VD&DT ] VD+DT ] Skeleton ] Gishur ] RealDT ] Closest ] Proximity ] Crust ] Alpha ] Beta ] Medial ] Beach Line ] Higher-Order VD ] Dual ] MRD ] 4D Cube ] 4D Polytope ] HyperStar ] MEC ] 3dCH+2dDT ] Location ] TrapMap ] BSP ] kd-Tree ] [ Range Tree ] PST ] Windowing ]

Copyleft (c) 2003-3002, Junhui Deng
Last updated on 12.03.2013