## Computing faces in segment and simplex arrangements (1995)

Venue: | In Proc. 27th Annu. ACM Sympos. Theory Comput |

Citations: | 17 - 11 self |

### BibTeX

@INPROCEEDINGS{Amato95computingfaces,

author = {Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos},

title = {Computing faces in segment and simplex arrangements},

booktitle = {In Proc. 27th Annu. ACM Sympos. Theory Comput},

year = {1995},

pages = {672--682}

}

### Years of Citing Articles

### OpenURL

### Abstract

For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel algorithm for constructing their arrangement. It runs in O(log 2 n) time using O(n log n + k) work in the EREW PRAM model, where k is the number of intersecting line segment pairs, and provides a fairly simple divide-and-conquer alternative to the optimal sequential “plane-sweep ” algorithm of Chazelle and Edelsbrunner. Moreover, our method can be used to output all k intersecting pairs while using only O(n) working space, which solves an open problem posed by Chazelle and Edelsbrunner. We also describe a sequential algorithm for computing a single face in an arrangement of n line segments that runs in O(n 2 (n) log n) time, which improves on a previous O(n log 2 n) time algorithm. For collections of simplices in IR d, we give methods for constructing a set of m = O(n d,1 log c n+k) cells of constant descriptive complexity that covers their arrangement, where c> 1 is a constant and k is the number of faces in the arrangement. The construction is performed sequentially in O(m) time, or in O(log n) time using O(m) work in the EREW PRAM model. The covering can be augmented to answer point location queries in O(log n) time. In addition to supplying the first parallel methods for these problems, we improve on the previous best sequential methods by reducing the query times (from O(log 2 n) in IR 3 and O(log 3 n) in IR d, d>3), and also the size and construction cost of the covering (from O(n d,1+ + k)). 1