ON PARTITIONING RECTILINEAR POLYGONS INTO STAR-SHAPED POLYGONS

被引：1
|
作者：
LIU, R [1 ]
NTAFOS, S [1 ]
机构：
[1] UNIV TEXAS,COMP SCI PROGRAM,RICHARDSON,TX 75083
来源：
ALGORITHMICA | 1991年 / 6卷 / 06期
关键词：
POLYGON DECOMPOSITION; STAR-SHAPED POLYGONS; COMPUTATIONAL GEOMETRY;
D O I：
10.1007/BF01759071
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present an algorithm for finding optimum partitions of simple monotone rectilinear polygons into star-shaped polygons. The algorithm may introduce Steiner points and its time complexity is O(n), where n is the number of vertices in the polygon. We then use this algorithm to obtain an O(n log n) approximation algorithm for partitioning simple rectilinear polygons into star-shaped polygons with the size of the partition being at most six times the optimum.
引用
收藏
页码：771 / 800
页数：30
相关论文
共 50 条
12345