Approximate range searching using binary space partitions

Computational Geometry: Theory and Applications

Volumn 33, Issue 3, 2006, Pages 139-151

  De Berg, Mark ^a   Streppel, Micha ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximate range searching; Binary space partitions; Geometric data structures; Realistic input models

Indexed keywords

EID: 84867971575     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.08.003     Document Type: Article

References (26)

1. P.K. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar, and 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 B. Chazelle, J. Goodman, R. Pollack, Advances in Discrete and Computational Geometry Contemp. Math. vol. 223 1998 American Mathematical Society Providence, RI 1 56
3. P.K. Agarwal, E. Grove, T.M. Murali, and J.S. Vitter Binary space partitions for fat rectangles J. SIAM J. Comput. 29 2000 1422 1448
4. P.K. Agarwal, T.M. Murali, J.S. Vitter, Practical techniques for constructing binary space partition for orthogonal rectangles, in: Proc. 13th ACM Symp. Comput. Geom., 1997, pp. 382-384
5. P.K. Agarwal, and S. Suri Surface approximation and geometric partitions SIAM J. Comput. 19 1998 1016 1035
6. A. Arya, and D. Mount Approximate range searching Computational Geometry 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 Computational Geometry 26 2003 99 117
9. M. de Berg Linear size binary space partitions for uncluttered scenes Algorithmica 28 2000 353 366
10. M. de Berg, M. de Groot, and M. Overmars New results on binary space partitions in the plane Proc. 4th Scand. Workshop Algorithm Theory Lecture Notes Comput. Sci. vol. 824 1994 Springer-Verlag Berlin 61 72
11. M. de Berg, M.J. Katz, A. F. van der Stappen, J. Vleugels, Realistic input models for geometric algorithms, in: Proc. 13th Annu. ACM Symp. Comput. Geom., 1997, pp. 294-303
12. N. Chin, S. Feiner, Near real time shadow generation using bsp trees, in: Proc. SIGGRAPH'89, 1989, pp. 99-106
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 Symp. Discrete Algorithms, 1999, pp. 300-309
15. H. Fuchs, Z.M. Kedem, and B. Naylor On visible surface generation by a priori tree structures. Proc. SIGGRAPH '80 Comput. Graph. 14 3 1980 124 133
16. D. Haussler, and E. Welzl Epsilon-nets and simplex range queries Discrete Comput. Geom. 2 1987 127 151
17. H.J. Haverkort, M. de Berg, J. Gudmundsson, Box-trees for collision checking in industrial installations, in: Proc. 18th ACM Symp. Comput. Geom., 2002, pp. 53-62
18. B. Naylor, J.A. Amanatides, and W. Thibault Merging BSP trees yields polyhedral set operations Proc. SIGGRAPH '90 Comput. Graph. 24 4 1990 115 124
19. M.H. Overmars, H. Schipper, and M. Sharir Storing line segments in partition trees BIT 30 1990 385 403
20. M.S. Paterson, and F.F. Yao Efficient binary space partitions for hidden-surface removal Discrete Comput. Geom. 5 1990 485 503
21. M.S. Paterson, and F.F. Yao Optimal binary space partitions for orthogonal objects J. Algorithms 13 1992 99 113
22. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer-Verlag Berlin
23. S.J. Teller, and C.H. Séquin Visibility preprocessing for interactive walkthroughs Proc. SIGGRAPH '91 Comput. Graph. 25 4 1991 61 69
24. C.D. Tóth A note on binary plane partitions Discrete Comput. Geom. 20 2003 3 16
25. C.D. Tóth Binary space partitions for line segments with a limited number of directions SIAM J. Comput. 32 2003 307 325
26. W.C. Thibault, and B.F. Naylor Set operations on polyhedra using binary space partitioning trees Proc. SIGGRAPH '87 Comput. Graph. 21 4 1987 153 162