Fast distance transformation on irregular two-dimensional grids

DOI10.1016/j.patcog.2010.04.018zbMath1205.68352OpenAlexW2074514748MaRDI QIDQ991938

Antoine Vacavant

Publication date: 8 September 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2010.04.018

zbMATH Keywords

quadtreeVoronoi diagramirregular gridsmedial axis extractionrun length encodingsquared Euclidean distance transformation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Stochastic distance transform: theory, algorithms and applications ⋮ Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach ⋮ Separable Distance Transformation and Its Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a minimum medial axis of a discrete shape is NP-hard
• On computing the exact Euclidean distance transform on rectangular and hexagonal grids
• Thinning algorithms based on quadtree and octree representations
• A Novel Algorithm for Distance Transformation on Irregular Isothetic Grids
• Multidimensional binary search trees used for associative searching
• Distance on a Hexagonal Grid
• Simple and Efficient Traversal Methods for Quadtrees and Octrees
• Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
• Distance Transformation on Two-Dimensional Irregular Isothetic Grids
• Sequential Operations in Digital Picture Processing

This page was built for publication: Fast distance transformation on irregular two-dimensional grids