A fast algorithm for constructing approximate medial axis of polygons, using Steiner points
This paper presents a new algorithm for constructing the approximation of a polygons 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 polygons medial axis. As shown by experiments, the obtained approximate polygon medial axis has better properties than those methods based on a Voronoi diagram.
algorithms approximation medial axis polygons steiner points constrained delaunay triangulation