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 条
  • [1] Optimal polygon cover problems and applications
    Chen, DZ
    Hu, XBS
    Wu, XD
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 564 - 576
  • [2] OPTIMAL COVER OF POINTS BY DISKS IN A SIMPLE POLYGON
    Kaplan, Haim
    Katz, Matthew J.
    Morgenstern, Gila
    Sharir, Micha
    SIAM JOURNAL ON COMPUTING, 2011, 40 (06) : 1647 - 1661
  • [3] Optimal Cover of Points by Disks in a Simple Polygon
    Kaplan, Haim
    Katz, Matthew J.
    Morgenstern, Gila
    Sharir, Micha
    ALGORITHMS-ESA 2010, 2010, 6346 : 475 - +
  • [4] Complexities of efficient solutions of rectilinear polygon cover problems
    P. Berman
    B. DasGupta
    Algorithmica, 1997, 17 : 331 - 356
  • [5] Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
    Dept. of Comp. Sci. and Engineering, Pennsylvania State University, University Park, PA 16802, United States
    不详
    Algorithmica (New York), 4 (331-356):
  • [6] Complexities of efficient solutions of rectilinear polygon cover problems
    Berman, P
    DasGupta, B
    ALGORITHMICA, 1997, 17 (04) : 331 - 356
  • [7] OPTIMAL PARALLEL HYPERCUBE ALGORITHMS FOR POLYGON PROBLEMS
    ATALLAH, MJ
    CHEN, DZ
    IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 914 - 922
  • [8] Optimal parallel hypercube algorithms for polygon problems
    Atallah, Mikhail J., 1600, IEEE, Los Alamitos, CA, United States (44):
  • [9] Optimal BSR solutions to several convex polygon problems
    Myoupo, JF
    Semé, D
    Stojmenovic, I
    JOURNAL OF SUPERCOMPUTING, 2002, 21 (01): : 77 - 90
  • [10] Optimal BSR Solutions to Several Convex Polygon Problems
    Jean-Frédéric Myoupo
    David Semé
    Ivan Stojmenovic
    The Journal of Supercomputing, 2002, 21 : 77 - 90
12345