Skip to main navigation Skip to search Skip to main content

A new skeletonization algorithm based on constrained Delaunay triangulation

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

7 Citations (Scopus)

Abstract

A new skeletonization algorithm based on the constrained Delaunay triangulation (CDT) is proposed in this paper. The CDT partitions a shape into a set of nonoverlapping triangles which represent the shape's local symmetry properties and interconnecting relationships between branches. The skeleton of the shape is generated from the skeletons of the triangles. Methods for removing skeletonization artefacts are provided. An outstanding feature of the algorithm is that the structural information at intersections of a shape is preserved in its skeleton.

Original languageEnglish
Title of host publicationISSPA 1999 - Proceedings of the 5th International Symposium on Signal Processing and Its Applications
PublisherIEEE Computer Society
Pages927-930
Number of pages4
ISBN (Print)1864354518, 9781864354515
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event5th International Symposium on Signal Processing and Its Applications, ISSPA 1999 - Brisbane, QLD, Australia
Duration: 22 Aug 199925 Aug 1999

Publication series

NameISSPA 1999 - Proceedings of the 5th International Symposium on Signal Processing and Its Applications
Volume2

Conference

Conference5th International Symposium on Signal Processing and Its Applications, ISSPA 1999
Country/TerritoryAustralia
CityBrisbane, QLD
Period22/08/9925/08/99

Fingerprint

Dive into the research topics of 'A new skeletonization algorithm based on constrained Delaunay triangulation'. Together they form a unique fingerprint.

Cite this