Abstract. 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 previously known ones. The main new idea is a simple randomized O(nlog n) expected time algorithm for computing √ n cells in an arrangement of n lines
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized increm...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
This note combines the lazy randomized incremental construction scheme with the technique of \connec...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
This note combines the lazy randomized incremental construction scheme with the technique of "connec...
Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the arrangement A(L) of L is th...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
This paper presents a very simple incremental randomized algorithm for computing the trapezoidal dec...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized increm...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
This note combines the lazy randomized incremental construction scheme with the technique of \connec...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
This note combines the lazy randomized incremental construction scheme with the technique of "connec...
Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the arrangement A(L) of L is th...
AbstractThis paper presents a very simple incremental randomized algorithm for computing the trapezo...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
This paper presents a very simple incremental randomized algorithm for computing the trapezoidal dec...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized increm...
DOI
Add to ORKG