An efficient shape representation scheme using Voronoi skeletons
| Autor: | Niranjan Mayya, Vadakkedathu T. Rajan |
|---|---|
| Rok vydání: | 1995 |
| Předmět: |
ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
Computer Science::Computational Geometry Lloyd's algorithm Topology Weighted Voronoi diagram Artificial Intelligence Robustness (computer science) TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Signal Processing Polygon Topological skeleton Computer Vision and Pattern Recognition Centroidal Voronoi tessellation Voronoi diagram Software Pruning (morphology) MathematicsofComputing_DISCRETEMATHEMATICS ComputingMethodologies_COMPUTERGRAPHICS Mathematics |
| Zdroj: | Pattern Recognition Letters. 16:147-160 |
| ISSN: | 0167-8655 |
| DOI: | 10.1016/0167-8655(94)00087-j |
| Popis: | This paper describes an efficient shape representation scheme using Voronoi skeletons. This paper makes the following significant contributions. First a new algorithm for the construction of the Voronoi diagram of a polygon with holes is described. The main features of this algorithm are its robustness in handling the standard degenerate cases (colinearity of more than two points; co-circularity of more than three points), and its ease of implementation . The algorithm has been fully implemented and tested on a variety of test inputs. Second, the Voronoi diagram of a polygon is used to derive accurate and robust skeletons for planar shapes . The shape representation scheme using Voronoi skeletons possesess the important properties of connectivity as well as Euclidean metrics. Redundant skeletal edges are deleted in a pruning step which guarantees that connectivity of the skeleton will be preserved. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect