On-line Zone Construction in Arrangements of Lines in the Plane (1999)
Cached
Download Links
- [www.cs.duke.edu]
- [valis.cs.uiuc.edu]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of the 3rd Workshop of Algorithm Engineering |
| Citations: | 6 - 4 self |
BibTeX
@INPROCEEDINGS{Aharoni99on-linezone,
author = {Y. Aharoni and D. Halperin and I. Hanniel and S. Har-Peled and C. Linhart},
title = {On-line Zone Construction in Arrangements of Lines in the Plane},
booktitle = {In Proc. of the 3rd Workshop of Algorithm Engineering},
year = {1999},
pages = {139--153},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Given a finite set L of lines in the plane we wish to compute the zone of an additional curve fl in the arrangement A(L), namely the set of faces of the planar subdivision induced by the lines in L that are crossed by fl, where fl 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. 1 Introduction Given a finite collection L of lines in the plane, the arrangement A(L) is the subdivision of the plane into vertices, edges and faces induced by L. Arrangements of lines in the plane, as well as arrangements of other objects and in higher dimensional spaces, ...
