Euclidean skeletons using closest points

DOI10.3934/IPI.2011.5.95MaRDI QIDQ534492zbMATH OpenOpenAlexFDO

Authors Songting Luo, Leonidas Guibas, Hongkai Zhao

Publication date 17 May 2011

Published in Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/ipi.2011.5.95

zbMATH Keywords

eikonal equationdistance mapclosest pointsdiscrete Voronoi diagramsEuclidean skeletons

Mathematics Subject Classification ID

Image analysis in multivariate analysis (62H35) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Recommendations

• Digital skeletons in Euclidean and geodesic spaces
• Extraction of the Euclidean skeleton based on a connectivity criterion
• Discrete Skeletons from Distance Transforms in 2D and 3D
• An exact algorithm for constructing minimum Euclidean skeletons of polygons
• A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
• Skeletons in N dimensions using shape primitives

Cited in

(5)

• A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
• \(L_1\)-medial skeleton of point cloud
• Extraction of the Euclidean skeleton based on a connectivity criterion
• scientific article; zbMATH DE number 2166251 (Why is no real title available?)
• Convergence analysis of the fast sweeping method for static convex Hamilton-Jacobi equations

This page was built for publication: Euclidean skeletons using closest points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534492)