Fast distance transformation on irregular two-dimensional grids
DOI10.1016/J.PATCOG.2010.04.018zbMATH Open1205.68352OpenAlexW2074514748MaRDI QIDQ991938FDOQ991938
Authors: 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
Recommendations
quadtreeVoronoi diagramirregular gridsmedial axis extractionrun length encodingsquared Euclidean distance transformation
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Thinning algorithms based on quadtree and octree representations
- Multidimensional binary search trees used for associative searching
- Sequential Operations in Digital Picture Processing
- Title not available (Why is that?)
- Distance on a Hexagonal Grid
- Simple and Efficient Traversal Methods for Quadtrees and Octrees
- On computing the exact Euclidean distance transform on rectangular and hexagonal grids
- A general algorithm for computing distance transforms in linear time
- Finding a minimum medial axis of a discrete shape is NP-hard
- A novel algorithm for distance transformation on irregular isothetic grids
- Title not available (Why is that?)
- Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
Cited In (8)
- Mapping multiple regions to the grid with bounded Hausdorff distance
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
- A novel algorithm for distance transformation on irregular isothetic grids
- Fast raster scan distance propagation on the discrete rectangular lattice
- Separable distance transformation and its applications
- Stochastic distance transform: theory, algorithms and applications
- Unsupervised polygonal reconstruction of noisy contours by a discrete irregular approach
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
This page was built for publication: Fast distance transformation on irregular two-dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991938)