Optimal polygon cover problems and applications

被引：1
|
作者：
Chen, DZ
Hu, XBS
Wu, XD
机构：
[1] Univ Texas, Dept Comp Sci, Edinburg, TX 78596 USA
[2] Univ Notre Dame, Dept Comp Sci & Engn, Notre Dame, IN 46556 USA
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 2002年 / 12卷 / 04期
关键词：
monotone polygon covers; star-shaped polygon covers; strip covers; shortest path queries; visibility problems;
D O I：
10.1142/S0218195902000918
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Polygon cover problems are important in several applied areas, such as material layout, layered manufacturing, radiation therapy and radiosurgery, etc. In this paper, we study three optimal polygon cover problems: monotone polygon cover among obstacles, star-shaped polygon cover among obstacles, and strip cover for trapezoidalized polygons. Based on some interesting geometric observations, we develop efficient algorithms for solving these problems. The complexity bounds of our monotone cover and star-shaped cover algorithms are comparable to those of the previously best known algorithms for simpler cases of the problems without considering obstacles. Our strip cover algorithm improves the quality of the previously best known solutions.
引用
收藏
页码：309 / 338
页数：30
相关论文
共 50 条
12345