Back to Search
Start Over
A fast algorithm for constructing approximate medial axis of polygons, using Steiner points
- Source :
-
Advances in Engineering Software (1992) . Oct2012, Vol. 52, p1-9. 9p. - Publication Year :
- 2012
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 09659978
- Volume :
- 52
- Database :
- Academic Search Index
- Journal :
- Advances in Engineering Software (1992)
- Publication Type :
- Academic Journal
- Accession number :
- 78543840
- Full Text :
- https://doi.org/10.1016/j.advengsoft.2012.05.006