Online point location in planar arrangements and its applications

Discrete and Computational Geometry

Volumn 26, Issue 1, 2001, Pages 19-40

  Har Peled, S ^a   Sharir, M ^b,c  

^a University of Illinois at Urbana Champaign   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035593621     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0026-y     Document Type: Article

References (31)

1. T. Asano, M. de Berg, O. Cheong, L. J. Guibas, J. Snoeyink, and H. Tamaki. Spanning trees crossing few barriers. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 41-48, 1999.
2. P. K. Agarwal. Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, New York, 1991.
3. N. Alon, H. Last, R. Pinchasi, and M. Sharir. On the complexity of arrangements of circles in the plane. Manuscript 2000.
4. P. K. Agarwal, J. Matoušek, and O. Schwarzkopf. Computing many faces in arrangements of lines and segments. SIAM J. Comput., 27(2):491-505, 1998.
5. K.-F. Böhringer, B. Donald, and D. Halperin. The area bisectors of a polygon and force equilibria in programmable vector fields. Discrete Comput. Geom., 22(2):269-285, 1999.
6. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
7. J. Basch, L. J. Guibas, and G. D. Ramkumar. Reporting red-blue intersections between two sets of connected line segments. In Proc. 4th Annu. European Sympos. Algorithms, Volume 1136 of Lecture Notes in Computer Science, pages 302-319. Springer-Verlag, Berlin, 1996.
8. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, Cambridge, 1998. Translated by H. Brönnimann.
9. B. Chazelle, H. Edelsbrunner, L. J. Guibas, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink. Counting and cutting cycles of lines and rods in space. Comput. Geom. Theory Appl., 1:305-323, 1992.
10. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Snoeyink. Computing a face in an arrangement of line segments. SIAM J. Comput., 22:1286-1302, 1993.
11. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145-158, 1993.
12. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. In Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., pages 92-99, 1999.
13. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
14. M. de Berg, K. Dobrindt, and O. Schwarzkopf. On lazy randomized incremental construction. Discrete Comput. Geom., 14:261-286, 1995.
15. M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput., 23:437-446, 1994.
16. M. de Berg, M. van Kreveld, M. H. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, New York, 1997.
17. H. Edelsbrunner, L. J. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir. Arrangements of curves in the plane: Topology, combinatorics, and algorithms. Theoret. Comput. Sci., 92:319-336, 1992.
18. S. Har-Peled. Multicolor combination lemma. Comput. Geom. Theory Appl., 12:155-176, 1999.
19. S. Har-Peled. Taking a walk in a planar arrangement. SIAM J. Comput., 30(4):1341-1367, 2000.
20. S. Har-Peled. Constructing planar cuttings in theory and practice. SIAM J. Comput., 29(6):2016-2039, 2000.
21. S. Har-Peled and P. Indyk. When crossings count - approximating the minimum spanning tree. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 166-175, 2000.
22. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
23. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383-390, 1975.
24. J. Matoušek, N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pages 49-58, 1991.
25. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
26. J. Pach and P. K. Agarwal. Combinatorial Geometry. Wiley, New York, 1995.
27. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
28. R. Seidel. Backwards analysis of randomized geometric algorithms. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 37-68. Springer-Verlag, Berlin, 1993.
29. M. Sharir. On joints in arrangements of lines in space and related problems. J. Combin. Theory, 67(1):89-99, 1994.
30. A. Solan. Cutting cycles of rods in space. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 135-142, 1998.
31. H. Tamaki and T. Tokuyama. How to cut pseudo-parabolas into segments. Discrete Comput. Geom., 19:265-290, 1998.