In the paper we show how to approximate the Voronoi diagram of a finite set of planar points in a chemical processor consisting of an agar-palladium thin layer and potassium iodide liquid diffusing on it. The configuration of a given point set is represented by the spatial distribution of KI drops a
Continuous skeleton computation by Voronoi diagram
β Scribed by Jonathan W. Brandt; V.Ralph Algazi
- Publisher
- Elsevier Science
- Year
- 1992
- Weight
- 1022 KB
- Volume
- 55
- Category
- Article
- ISSN
- 1049-9660
No coin nor oath required. For personal study only.
β¦ Synopsis
The skeleton of a continuous shape can be approximated from the Voronoi diagram of points sampled along the shape boundary.
To bound the error of this approximation, one must relate the spatial complexity of the shape to the boundary sampling density.
The regular set modef of mathematical morphology provides a practical basis to establish such a relationship. Given a binary image shape, we exhibit a corresponding continuous, regular shape such that the sequence of points describing its boundary constitutes a sufficiently dense sampling for an accurate skeleton approximation.
Additionally, we bound the regeneration error from the sampling density and the regularity parameter. This approach opens significant new possibilities for shape analysis by the exact, Euclidean skeleton. As a simple example, we describe how the skeleton can be refined by pruning, without introducing significant error in the regenerated image. 8 19% Academic PMS, I~C.
π SIMILAR VOLUMES
Despite its important applications in various disciplines in science and engineering, the Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclid