Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension

Simple item page
dc.creatorCoeurjolly, David
dc.creatorMontanvert, Annick
dc.date2007-05-23
dc.date.accessioned2026-07-07T08:02:57Z
dc.date.available2026-07-07T08:02:57Z
dc.descriptionIn binary images, the distance transformation (DT) and the geometrical skeleton extraction are classic tools for shape analysis. In this paper, we present time optimal algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for $d$-dimensional images. We also present a $d$-dimensional medial axis filtering process that allows us to control the quality of the reconstructed shape.
dc.identifierhttps://arxiv.org/abs/0705.3343
dc.identifierhttp://arxiv.org/abs/0705.3343
dc.identifierIEEE Transactions on Pattern Analysis and Machine Intelligence 29, 3 (01/03/2007) 437-448
dc.identifierdoi:10.1109/TPAMI.2007.54
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129405
dc.subjectComputational Geometry
dc.titleOptimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
dc.typetext

Files

Collections

arXiv