This note combines the lazy randomized incremental construction scheme with the technique of "connectivity acceleration" to obtain an O(n(log* n)2) time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n ve...
This note combines the lazy randomized incremental construction scheme with the technique of "connec...
This note combines the lazy randomized incremental construction scheme with the technique of \connec...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
This paper presents a very simple incremental randomized algorithm for computing the trapezoidal dec...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized increm...
The number of elementary connected regions arising from polygon overlay of two or more map layers is...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. ...
We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. ...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
Random projection is a simple geometric technique for reducing the dimensionality of a set of points...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n ve...
This note combines the lazy randomized incremental construction scheme with the technique of "connec...
This note combines the lazy randomized incremental construction scheme with the technique of \connec...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
This paper presents a very simple incremental randomized algorithm for computing the trapezoidal dec...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized increm...
The number of elementary connected regions arising from polygon overlay of two or more map layers is...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. ...
We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. ...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
Random projection is a simple geometric technique for reducing the dimensionality of a set of points...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n ve...
DOI
Add to ORKG