Related Experiment Video
Updated: Jul 17, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in
David Coeurjolly1, Annick Montanvert
1Laboratoire LIRIS UMR-CNRS 5205, Universite Claude Bernard Lyon 1, Villeurbanne, France. david.coeurjolly@liris.cnrs.fr
Abstract:
In 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.
Related Concept Videos
Divergence Theorem in 3D Space
Area Computation by the Alternative Coordinate Method
Distance Problem
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Parallel-axis Theorem
Cross Product and Its Geometry