Approximate range searching using binary space partitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3328, Issue , 2004, Pages 110-121

  De Berg, Mark ^a   Streppel, Micha ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING; SOFTWARE ENGINEERING;

BINARY SPACE PARTITION; DISJOINT SEGMENTS; EXTENDED RANGE; LOWER DENSITY; RANGE SEARCHING; SEARCHING EFFICIENCY; SPLITTINGS; BSP-TREES; K EPSILONS; LOW DENSITY;

BINARY TREES; FORESTRY;

EID: 35048843193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_10     Document Type: Article

References (26)

1. P.K. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar, H.J. Haverkort, Box-trees and R-trees with near-optimal query time, Discrete Comput. Geom. 28 (2002) 291-312.
2. P.K. Agarwal and J. Erickson. Geometric range searching and its relatives. In: B. Chazelle, J. Goodman, and R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Vol. 223 of Contemporary Mathematics, pages 1-56, American Mathematical Society, 1998.
3. P.K. Agarwal, E. Grove, T.M. Murali and J.S. Vitter. Binary space partitions for fat rectangles. SIAM J. Comput. 29:1422-1448, 2000.
4. P.K. Agarwal, T.M. Murali and J.S. Vitter. Practical techniques for constructing binary space partition for orthogonal rectangles. In Proc. 13th ACM Symp. of Comput. Geom., pages 382-384, 1997.
5. P.K. Agarwal and S. Suri. Surface Approximation and Geometric Partitions. SIAM J. Comput. 19: 1016-1035, 1998.
6. A. Arya, D. Mount, Approximate range searching, Comput. Geom. Theory Appl. 17 (2000) 135-152.
7. C. Ballieux. Motion planning using binary space partitions. Technical Report Inf/src/93-25, Utrecht University, 1993.
8. M. de Berg, H. David, M. J. Katz, M. Overmars, A. F. van der Stappen, and J. Vleugels. Guarding scenes against invasive hypercubes. Comput. Geom., 26:99-117, 2003.
9. M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica 28:353-366, 2000.
10. M. de Berg, M. de Groot, and M. Overmars. New results on binary space partitions in the plane. In Proc. 4th Scand. Workshop Algorithm Theory, volume 824 of Lecture Notes Comput. Sci., pages 61-72. Springer-Verlag, 1994.
11. M. de Berg, M.J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 294-303, 1997.
12. N. Chin and S. Feiner. Near real time shadow generation using bsp trees. In Proc. SIGGRAPH'89, pages 99-106, 1989.
13. C.A. Duncan, Balanced Aspect Ratio Trees, Ph.D. Thesis, John Hopkins University, 1999.
14. C.A. Duncan, M.T. Goodrich, S.G. Kobourov, Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees, In Proc. 10th Ann. ACM-SIAM Sympos. Discrete Algorithms, pages 300-309, 1999.
15. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3):124-133, 1980. Proc. SIGGRAPH '80.
16. D. Haussler, and E. Welzl Epsilon-nets and simplex range queries Discrete Comput. Geom., 2:127-151, 1987.
17. H.J. Haverkort, M. de Berg, and J. Gudmundsson. Box-Trees for Collision Checking in Industrial Installations. In Proc. 18th ACM Symp. on Computational Geometry, pages 53-62, 2002
18. B. Naylor, J. A. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph., 24(4):115-124, August 1990. Proc. SIGGRAPH '90.
19. M.H. Overmars, H. Schipper, and M. Sharir. Storing line segments in partition trees. BIT, 30:385-403, 1990
20. M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485-503, 1990.
21. M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99-113, 1992.
22. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
23. S. J. Teller and C. H. Sequin. Visibility preprocessing for interactive walkthroughs. Comput. Graph., 25(4):61-69, July 1991. Proc. SIGGRAPH '91.
24. C.D. Tóth. A Note on Binary Plane Partitions. Discrete Comput. Geom. 20:3-16, 2003.
25. C.D. Tóth. Binary Space Partitions for Line Segments with a Limited Number of Directions. SIAM J. Comput. 32:307-325, 2003.
26. W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. Comput. Graph., 21(4):153-162, 1987. Proc. SIGGRAPH '87.