Voronoi diagrams from convex hulls
โ Scribed by Kevin Q. Brown
- Book ID
- 113162083
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 852 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The combinatorial complexity of the Voronoi diagram of n lines in three dimensions under a convex distance function induced by a polytope with a constant ลฝ 2 ลฝ . . ลฝ . number of edges is shown to be O n โฃ n log n , where โฃ n is a slowly growing inverse of the Ackermann function. There are arrangemen
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