On-Line Zone Construction in Arrangements of Lines in the Plane
Given a finite set L of lines in the plane we wish to compute the zone of an additional curve γ in the arrangement A(L), namely the set of faces of the planar subdivision induced by the lines in L that are crossed by γ, where γ is not given in advance but rather provided online portion by portion. This problem is motivated by the computation of the area bisectors of a polygonal set in the plane. We present four algorithms which solve this problem efficiently and exactly (giving precise results even on degenerate input). We implemented the four algorithms. We present implementation details, comparison of performance, and a discussion of the advantages and shortcomings of each of the proposed algorithms.
KeywordsConvex Hull Binary Search Tree Input Line Recursion Tree Single Face
Unable to display preview. Download preview PDF.
- 1.Y. Aharoni. Computing the area bisectors of polygonal sets: An implementation. In preparation, 1999.Google Scholar
- 3.K.-F. Böhringer, B. Donald, and D. Halperin. The area bisectors of a polygon and force equilibria in programmable vector fields. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 457–459, 1997. To appear in Disc. and Comput. Geom.Google Scholar
- 4.K.-F. Böhringer, B. R. Donald, and N. C. MacDonald. Upper and lower bounds for programmable vector fields with applications to MEMS and vibratory plate parts feeders. In J.-P. Laumond and M. Overmars, editors, Robotics Motion and Manipulation, pages 255–276. A.K. Peters, 1996.Google Scholar
- 5.C. Burnikel, K. Mehlhorn, and S. Schirra. The LEDA class real number. Technical Report MPI-I-96-1-001, Max-Planck Institut Inform., Saarbrücken, Germany, Jan. 1996.Google Scholar
- 6.The CGAL User Manual, Version 1.2, 1998.Google Scholar
- 9.H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Heidelberg, Germany, 1987.Google Scholar
- 11.A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. The CGAL kernel: A basis for geometric computation. In M. C. Lin and D. Manocha, editors, Proc. 1st ACM Workshop on Appl. Comput. Geom., volume 1148 of Lecture Notes Comput. Sci., pages 191–202. Springer-Verlag, 1996.Google Scholar
- 12.A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the design of CGAL, the Computational Geometry Algorithms Library. Technical Report MPI-I-98-1-007, Max-Planck-Institut Inform., 1998.Google Scholar
- 15.D. Halperin. Arrangements. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 21, pages 389–412. CRC Press LLC, 1997.Google Scholar
- 16.S. Har-Peled. Constructing cuttings in theory and practice. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 327–336, 1998.Google Scholar
- 17.S. Har-Peled. Taking a walk in a planar arrangement. Manuscript, http://www.math.tau.ac.il/~sariel/papers/98/walk.html, 1999.
- 19.K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.Google Scholar
- 20.M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166–204, 1981.Google Scholar
- 21.F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.Google Scholar