Computational geometry: an introduction
Computational geometry: an introduction
Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Simulating the Grassfire Transform Using an Active Contour Model
IEEE Transactions on Pattern Analysis and Machine Intelligence
The vector distance transform in two and three dimensions
CVGIP: Graphical Models and Image Processing
Euclidean Voronoi labelling on the multidimensional grid
Pattern Recognition Letters
Skeletonization via distance maps and level sets
Computer Vision and Image Understanding
An algorithm for constructing the convex hull of a set of spheres in dimension d
Computational Geometry: Theory and Applications
A unified linear-time algorithm for computing distance maps
Information Processing Letters
On the Generation of Skeletons from Discrete Euclidean Distance Maps
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding the minimal set of maximum disks for binary objects
Graphical Models and Image Processing
Efficient shape representation by minimizing the set of centres of maximal discs/spheres
Pattern Recognition Letters
Computing and simplifying 2D and 3D continuous skeletons
Computer Vision and Image Understanding
A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Continuous Skeletons from Digitized Images
Journal of the ACM (JACM)
Fast Euclidean distance transformation by propagation using multiple neighborhoods
Computer Vision and Image Understanding
On approximating Euclidean metrics by digital distances in 2D and 3D
Pattern Recognition Letters
Skeletonization of Three-Dimensional Object Using Generalized Potential Field
IEEE Transactions on Pattern Analysis and Machine Intelligence
Medial axis for chamfer distances: computing look-up tables and neighbuorhoods in 2D or 3D
Pattern Recognition Letters
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pruning Discrete and Semiocontinuous Skeletons
ICIAP '95 Proceedings of the 8th International Conference on Image Analysis and Processing
On the Local Form and Transitions of Symmetry Sets, Medial Axes, and Shocks
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
A Formal Classification of 3D Medial Axis Points and Their Local Geometry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Exact medial axis with euclidean distance
Image and Vision Computing
3-D chamfer distances and norms in anisotropic grids
Image and Vision Computing
A comparison among distances based on neighborhood sequences in regular grids
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Finding a minimum medial axis of a discrete shape is NP-hard
Theoretical Computer Science
Discrete 2D and 3D euclidean medial axis in higher resolution
Image and Vision Computing
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Pattern Recognition
Hierarchical Discrete Medial Axis for Sphere-Tree Construction
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Players and ball detection in soccer videos based on color segmentation and shape analysis
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
Medial axis LUT computation for chamfer norms using H-polytopes
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Distance transformation on two-dimensional irregular isothetic grids
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Appearance radii in medial axis test mask for small planar chamfer norms
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A novel algorithm for distance transformation on irregular isothetic grids
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Fast distance transformation on irregular two-dimensional grids
Pattern Recognition
New reduced discrete Euclidean nD medial axis with optimal algorithm
Pattern Recognition Letters
Digital distance functions on three-dimensional grids
Theoretical Computer Science
Separable algorithms for distance transformations on irregular grids
Pattern Recognition Letters
Robust skeletonization using the discrete λ-medial axis
Pattern Recognition Letters
Fast and accurate approximation of digital shape thickness distribution in arbitrary dimension
Computer Vision and Image Understanding
Scale filtered euclidean medial axis
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Guaranteed quality tetrahedral Delaunay meshing for medical images
Computational Geometry: Theory and Applications
| Hi-index | 0.15 |
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.