An efficient algorithm for decomposing a polygon into star-shaped polygons
作者:
Highlights:
•
摘要
In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency of this new decomposition contrasts with the heavy computational burden of existing methods.
论文关键词:Polygonal decomposition,Syntactic pattern recognition,Triangulation,Star-shaped polygons,Colouring algorithms,Computational geometry
论文评审过程:Received 11 June 1980, Revised 9 February 1981, Available online 19 May 2003.
论文官网地址:https://doi.org/10.1016/0031-3203(81)90002-9