Continuous skeleton computation by Voronoi diagram
From MaRDI portal
Publication:3136065
Recommendations
Cited in
(23)- Text region extraction in a document image based on the Delaunay tessellation
- Delaunay conforming iso-surface, skeleton extraction and noise removal
- A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
- Natural neighbor coordinates of points on a surface
- A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\)
- Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries
- Q-MAT+: an error-controllable and feature-sensitive simplification algorithm for medial axis transform
- Delaunay triangulations approximate anchor hulls
- Specified–Precision Computation of Curve/Curve Bisectors
- Extraction of the Euclidean skeleton based on a connectivity criterion
- DIFFERENTIAL TOPOLOGY AND GEOMETRY OF SMOOTH EMBEDDED SURFACES: SELECTED TOPICS
- Voronoi diagrams of polygons: a framework for shape representation.
- Binarization of gray-level images based on skeleton region growing
- Scaffolding skeletons using spherical Voronoi diagrams
- A pruning algorithm for stable Voronoi skeletons
- Euclidean distance-based skeletons: a few notes on average outward flux and ridgeness
- Convergence rate for the \(\lambda \)-medial-axis estimation under regularity conditions
- Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. I: Theoretical foundations
- Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
- Intelligent Solutions for Curve Reconstruction Problem
- Skeletonisation: An electrostatic field-based approach
- Voronoi cells in metric algebraic geometry of plane curves
- Non-centered Voronoi skeletons
This page was built for publication: Continuous skeleton computation by Voronoi diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136065)
