Convergence and continuity criteria for discrete approximations of the continuous planar skeleton
CVGIP: Image Understanding
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Assisted articulation of closed polygonal models
ACM SIGGRAPH 98 Conference abstracts and applications
Two- and three-dimensional patterns of the face
Two- and three-dimensional patterns of the face
Artistic Vision: painterly rendering using computer vision techniques
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
Shape Description By Medial Surface Construction
IEEE Transactions on Visualization and Computer Graphics
A Formal Classification of 3D Medial Axis Points and Their Local Geometry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Acceleration of sweep-line technique by employing smart quicksort
Information Sciences—Informatics and Computer Science: An International Journal
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
SIAM Journal on Scientific Computing
Sweep-line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science
Incremental reconstruction of generalized Voronoi diagrams on grids
Robotics and Autonomous Systems
Medial axis computation for planar free-form shapes
Computer-Aided Design
A sweepline algorithm for Euclidean Voronoi diagram of circles
Computer-Aided Design
Medial axis of a planar region by offset self-intersections
Computer-Aided Design
Medial Axis Transformation of a Planar Shape
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
This paper presents a new algorithm for constructing the approximation of a polygon's medial axis. The algorithm works in three steps. Firstly, constrained Delaunay triangulation of a polygon is done. After that, the obtained triangulation is heuristically corrected by inserting Steiner points. Finally, the obtained triangles are classified into three classes, thus enabling the construction of the polygon's medial axis. As shown by experiments, the obtained approximate polygon medial axis has better properties than those methods based on a Voronoi diagram.