Hesselink, Wim H.

Roerdink, Jos B.T.M.

Visser, Menno

English

A general algorithm for computing Euclidean skeletons of 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity which is linear in the amount of voxels, and can be easily parallelized. The relation of the IMA skeleton to the usual definition in terms of centers of maximal disks is discussed.</p

ARTS repository - University of Groningen

Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform

https://pure.rug.nl/ws/files/2911138/2005CompImagVisHesselink.pdf

Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform

Abstract

Similar works

Full text

Available Versions

ARTS repository - University of Groningen