Skeletonization of polygonal figures based on the generalized Delaunay triangulationстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 2 октября 2014 г.
Местоположение издательства:Road Town, United Kingdom
Первая страница:131
Последняя страница:142
Аннотация:A problem of construction of a continuous skeleton of a 2D figure bounded by a finite set of polygons is considered. Examples are presented that show that certain well-known algorithms fail to solve this probem. A new approach is suggested that is based on the direct construction of the generalized Delaunay triangulation of the set of figure boundary elements (sites). This makes it possible to avoid direct construction of the Voronoi diagrams, which is the most complex and labor-consuming part of the known approaches An easy-to-implement O(n logn) algorithm based on the idea of the plane sweep is suggested.