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

Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry

โœ Scribed by Deok-Soo Kim; Donguk Kim; Kokichi Sugihara

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
877 KB
Volume
18
Category
Article
ISSN
0167-8396

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Voronoi diagram of a circle set from Vor
Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
โœ Deok-Soo Kim; Donguk Kim; Kokichi Sugihara ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

In this and the following papers, we present an algorithm to compute the exact Voronoi diagram of a circle set from the Voronoi diagram of a point set. The circles are located in a two dimensional Euclidean space, the radii of the circles are non-negative and not necessarily equal, and the circles a

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 generic triangle-based data structure
A generic triangle-based data structure of the complete set of higher order Voronoi diagrams for emergency management
โœ Ickjai Lee; Kyungmi Lee ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1019 KB

We introduce a generic Delaunay triangle-based data structure for geoinformation processing in disaster and emergency management. The data structure supports the complete set of higher order Voronoi diagrams (order-k) Voronoi diagrams, ordered order-k Voronoi diagrams, and kth nearest Voronoi diagra