๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A straightforward iterative algorithm for the planar Voronoi diagram

โœ Scribed by John C. Tipper

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
545 KB
Volume
34
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A sweepline algorithm for Euclidean Voro
A sweepline algorithm for Euclidean Voronoi diagram of circles
โœ Li Jin; Donguk Kim; Lisen Mu; Deok-Soo Kim; Shi-Min Hu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 647 KB

Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed

A nearly optimal parallel algorithm for
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
โœ Piotr Berman; Andrzej Lingas ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an

A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
โœ Wei-Chang Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota