An experimental study of point location in general planar arrangements

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 16-25

  Harald, Idit ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; COSTS; NONLINEAR PROGRAMMING; NONLINEAR SYSTEMS;

LANDMARKS ALGORITHMS; OVERLAPPING CURVES; PLANAR ARRANGEMENTS; TRAPEZOIDAL-DECOMPOSITION;

ALGORITHMS;

EID: 33646826536     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. The COAL project homepage. http://www.cgal.org/.
2. The CORE library homepage. http://www.cs.nyu.edu/exact/core-pages/.
3. The LEDA homepage. http://wvw.algorithmic-solutions.com/enleda.htm.
4. The GNU MP bignum library, http://www.swox.com/gmp/.
5. P. K. Agarwal and M. Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49-119. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
6. S. Arya, T. Malamatos, and D. M. Mount. Entropy-preserving cutting and space-efficient planar point location. In Proc. 12th ACM-SIAM Sympos. Disc. Alg., pages 256-261, 2001.
7. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45:891-923, 1998.
8. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, Sept. 1975.
9. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Comput. Geom. Theory Appl., 22(1-3):5-19.
10. O. Devillers. The Delaunay hierarchy. Internat. J. Found. Comput. Sci., 13:163-180, 2002.
11. O. Devillers and P. Guigue. The shuffling buffer. Internat. J. Comput. Geom. Appl., 11:555-572, 2001.
12. O. Devillers, S. Pion, and M. Teillaud. Walking in a triangulation. Internat. J. Found, Comput. Sci., 13:181-199, 2002.
13. L. Devroye, C. Lemaire, and J.-M. Moreau. Fast Delaunay point-location with search structures. In Proc. 11th Canad. Conf. Comput. Geom., pages 136-141, 1999.
14. L. Devroye, E. P. Mücke, and B. Zhu. A note on point location in Delaunay triangulations of random points. Algorithmica, 22:477-482, 1998.
15. M. Edahiro, I. Kokubo, and T. Asano. A new point-location algorithm and its practical efficiency - comparison with existing algorithms. ACM Trans. Graph., 3:86-109, 1984.
16. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. J. Exp. Algorithmics, 5:13, 2000.
17. E. Fogel, R. Wein, and D. Halperin. Code flexibility and program efficiency by genericity: Improving cgal's arrangements. In Proc. 12th Annual European Symposium on Algorithms (ESA), volume 3221 of LNCS, pages 664-676. Springer-Verlag, 2004.
18. D. Halperin. Arrangements. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 24, pages 529-562. Chapman & Hall/CRC, 2nd edition, 2004.
19. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28-35, 1983.
20. J. Matoušek. Geometric Discrepancy - An Illustrated Guide. Springer, 1999.
21. K. Mehlhorn and S. Näher. LED A: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
22. E. P. Mücke, I. Saias, and B. Zhu. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 274-283, 1996.
23. K. Mulmuley. A fast planar partition algorithm, I. J. Symbolic Comput., 10(3-4):253-280, 1990.
24. H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods, volume 63 of Regional Conference Series in Applied Mathematics. CBMS-NSF, 1992.
25. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer, 1985.
26. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669-679, July 1986.
27. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1(1):51-64, 1991.