AbstractThis paper presents a randomized parallel algorithm for computing planar Voronoi diagrams of n point sites according to symmetric convex distance functions. This algorithm uses, with high probability, O(nlog(n)/p) local computation time and O(n/p) space on the processors plus time for O(1) communication rounds on a coarse grained multicomputer with p processors
In the Hausdorff Voronoi diagram of a family of clusters of points in the plane, the distance betwee...
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorith...
In this note we describe deterministic parallel algorithms for planar point location and for buildin...
AbstractThis paper presents a randomized parallel algorithm for computing planar Voronoi diagrams of...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
AbstractWe present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex p...
The ability to manipulate objects in computer graphics and robotics depends critically on fast and f...
We show that the abstract Voronoi diagram of n sites in the plane can be constructed in time O(n log...
We show that the abstract Voronoi diagram of n sites in the plane can be constructed in time O(n log...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
Abstract. The Voronoi diagram is a widely used data structure. The theory of algorithms for computin...
Abstract—We study Voronoi diagrams for distance functions that add together two convex functions, ea...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the design and...
AbstractWe introduce the simple abstract Voronoi diagram in 3-space as an abstraction of the usual V...
In the Hausdorff Voronoi diagram of a family of clusters of points in the plane, the distance betwee...
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorith...
In this note we describe deterministic parallel algorithms for planar point location and for buildin...
AbstractThis paper presents a randomized parallel algorithm for computing planar Voronoi diagrams of...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
AbstractWe present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex p...
The ability to manipulate objects in computer graphics and robotics depends critically on fast and f...
We show that the abstract Voronoi diagram of n sites in the plane can be constructed in time O(n log...
We show that the abstract Voronoi diagram of n sites in the plane can be constructed in time O(n log...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
Abstract. The Voronoi diagram is a widely used data structure. The theory of algorithms for computin...
Abstract—We study Voronoi diagrams for distance functions that add together two convex functions, ea...
In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set ...
Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the design and...
AbstractWe introduce the simple abstract Voronoi diagram in 3-space as an abstraction of the usual V...
In the Hausdorff Voronoi diagram of a family of clusters of points in the plane, the distance betwee...
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorith...
In this note we describe deterministic parallel algorithms for planar point location and for buildin...
DOI
Add to ORKG