Discrete bisector function and Euclidean skeleton in 2D and 3D

We propose a new definition and an algorithm for the discrete bisector function, which is an important tool for analyzing and filtering Euclidean skeletons. We also introduce a new thinning algorithm which produces homotopic discrete Euclidean skeletons. These algorithms, which are valid both in 2D...

Full description

Saved in:
Bibliographic Details
Published inImage and vision computing Vol. 25; no. 10; pp. 1543 - 1556
Main Authors Couprie, Michel, Coeurjolly, David, Zrour, Rita
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.10.2007
Elsevier
Subjects
Bisector function
Computational Geometry
Computer Science
Digital topology
Euclidean distance transform
Skeleton
Voronoi diagram
Voronoi diagram
Skeleton
Bisector function
Euclidean distance transform
Online AccessGet full text

Cover

More Information
Summary:We propose a new definition and an algorithm for the discrete bisector function, which is an important tool for analyzing and filtering Euclidean skeletons. We also introduce a new thinning algorithm which produces homotopic discrete Euclidean skeletons. These algorithms, which are valid both in 2D and 3D, are integrated in a skeletonization method which is based on exact transformations, allows the filtering of skeletons, and is computationally efficient.
ISSN:0262-8856
1872-8138
DOI:10.1016/j.imavis.2006.06.020