6437 search results - page 6 / 1288 » Parallel Algorithms for Arrangements |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
FLOPS
2010
Springer
13 years 6 months ago
2010
Springer
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...