Minimum number of pieces in a convex partition of a polygonal domain

被引：0
|
作者：
Martini, H [1 ]
机构：
[1] TU Chemnitz, Fak Math, D-09107 Chemnitz, Germany
[2] George Mason Univ, Dept Math Sci, Fairfax, VA 22030 USA
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1999年 / 9卷 / 06期
关键词：
convex partition; polygonal domain; degenerate holes;
D O I：
10.1142/S0218195999000340
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Let F be a given nonempty family of directions in the plane. For a multiply connected polygonal domain P with polygonal holes, possibly degenerate, we determine the minimum number of convex polygons into which P is partitioned by linear cuts in the directions from F.
引用
收藏
页码：599 / 614
页数：16
相关论文
共 50 条
  • [1] Minimum convex partition of polygonal domains by guillotine cuts
    Martini, H
    Soltan, V
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (02) : 291 - 304
  • [2] Minimum Convex Partition of Polygonal Domains by Guillotine Cuts
    H. Martini
    V. Soltan
    [J]. Discrete & Computational Geometry, 1998, 19 : 291 - 305
  • [3] Minimum Convex Partition of Polygonal Domains by Guillotine Cuts
    [J]. Discrete and Computational Geometry, 19 (02):
  • [4] A fixed parameter algorithm for the minimum number convex partition problem
    Grantson, M
    Levcopoulos, C
    [J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2005, 3742 : 83 - 94
  • [5] Touring Convex Polygons in Polygonal Domain Fences
    Ahadi, Arash
    Mozafari, Amirhossein
    Zarei, Alireza
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT II, 2017, 10628 : 61 - 75
  • [6] Minimum convex partition of a constrained point set
    Fevens, T
    Meijer, H
    Rappaport, D
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 109 (1-2) : 95 - 107
  • [7] Approximation algorithms for the minimum convex partition problem
    Knauer, Christian
    Spillner, Andreas
    [J]. ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 232 - 241
  • [8] ON A PARTITION PROBLEM WITH A MINIMUM NUMBER OF CLASSES
    TOMESCU, I
    [J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1967, 265 (21): : 645 - &
  • [9] Approximation of polygonal curves with minimum number of line segments or minimum error
    Chan, WS
    Chin, F
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (01) : 59 - 77
  • [10] MINIMUM NUMBER OF FACETS OF A CONVEX POLYTOPE
    MCMULLEN, P
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1971, 3 (FEB): : 350 - &
12345