Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems

被引：0
|
作者：
Dept. of Comp. Sci. and Engineering, Pennsylvania State University, University Park, PA 16802, United States [1 ]
不详 [2 ]
机构：
来源：
Algorithmica (New York) | / 4卷 / 331-356期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Efficient and local efficient solutions for assignment type problems
    Ferland, JA
    Marziliano, P
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (03): : 301 - 313
  • [42] Multi Cover of a Polygon Minimizing the Sum of Areas
    Abu-Affash, A. Karim
    Carmi, Paz
    Katz, Matthew J.
    Morgenstern, Gila
    WALCOM: ALGORITHMS AND COMPUTATION, 2011, 6552 : 134 - 145
  • [43] Efficient approximate solutions to micromagnetic problems
    Arrott, AS
    Templeton, TL
    JOURNAL OF APPLIED PHYSICS, 1997, 81 (08) : 5570 - 5572
  • [44] EFFICIENT SOLUTIONS FOR BARGAINING PROBLEMS WITH CLAIMS
    GIL, MDM
    MATHEMATICAL SOCIAL SCIENCES, 1995, 30 (01) : 57 - 69
  • [45] Efficient solutions schemes for interface problems
    Fish, J
    Pandheeradi, M
    Belsky, V
    FINITE ELEMENTS IN ANALYSIS AND DESIGN, 1996, 22 (04) : 267 - 280
  • [46] Two Dimensional Rectilinear Polygon Packing using Genetic Algorithm with a Hierarchical Chromosome
    Matayoshi, Mitsukuni
    2011 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2011, : 989 - 996
  • [47] An efficient algorithm to decompose a compound rectilinear shape into simple rectilinear shapes
    Sharif, Imran
    Chaudhuri, Debasis
    Kushwaha, Naveen
    Samal, Ashok
    Singh, Brij Mohan
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2018, 26 (01) : 150 - 161
  • [48] Searching for Local Pareto Optimal Solutions: A Case Study on Polygon-Based Problems
    Liu, Yiping
    Ishibuchi, Hisao
    Nojima, Yusuke
    Masuyama, Naoki
    Han, Yuyan
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 896 - 903
  • [49] EXTREMAL POLYGON CONTAINMENT PROBLEMS
    SHARIR, M
    TOLEDO, S
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1994, 4 (02): : 99 - 118
  • [50] Efficient regular polygon dissections
    Kranakis, E
    Krizanc, D
    Urrutia, J
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2000, 1763 : 172 - 187
12345