Robust Computing and CGAL: Projects at TAU

CGAL homepage

ACG at TAU

TAU Members

People

Projects

On-line Zone Construction in Arrangements

Abstract

Given a finite set L of lines in the plane we wish to compute the zone of an additional curve c in the arrangement A(L), namely the set of faces of the planar subdivision induced by the lines in L that are crossed by c, where c is not given in advance but rather provided on-line 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.

Links

Dan Halperin, Iddo Hanniel, Sariel Har-Peled, and C. Linhart
On-Line Zone Construction in Arrangements of Lines in the Plane
International Journal of Computational Geometry and Applications , 13:6 (2003), pp. 463-485.
A preliminary version with Y. Aharoni appeared in Proc. 3rd International Workshop on Algorithm Engineering (WAE),
London, 1999, Springer LNCS Vol. 1668, 139-153.
[BibTex,gzipped PostScript]
Taking a Walk in a Planar Arrangement - Sariel Har-Peled.
SICOMP 30 (4) 1341-1367, 2000.

Contact

Chaim Linhart

Site is maintained by Efi Fogel. Last modified: June 01 2004.