A straightforward algorithm for computing the medial axis of a simple polygon
From MaRDI portal
Publication:3989852
DOI10.1080/00207169108803978zbMath0742.68033OpenAlexW2116472185MaRDI QIDQ3989852
Publication date: 28 June 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169108803978
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Exploiting curvatures to compute the medial axis for domains with smooth boundary ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ Conformal mapping in linear time ⋮ Entropy solution at concave corners and ridges, and volume boundary layer tangential adaptivity ⋮ An Entropy Satisfying Boundary Layer Surface Mesh Generation ⋮ Stable Computation of the 2D Medial Axis Transform
Cites Work
- Unnamed Item
- Unnamed Item
- A straightforward iterative algorithm for the planar Voronoi diagram
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Shape description using weighted symmetric axis features
- Generalization of Voronoi Diagrams in the Plane
- Medial Axis Transformation of a Planar Shape