A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

被引：9

作者：

Fernandez, Jose ^{[1
]}

Toth, Boglarka ^{[2
]}

Canovas, Lazaro ^{[1
]}

Pelegrin, Blas ^{[1
]}

机构：

[1] Univ Murcia, Dept Stat & Operat Res, Murcia, Spain

[2] Budapest Univ Technol & Econ, Dept Differential Equat, H-1117 Budapest, Hungary

来源：

TOP | 2008年 / 16卷 / 02期

关键词：

Convex polygon decomposition; Polygonal holes; Location; 68U05; 52B55; 90B85;

D O I：

10.1007/s11750-008-0055-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present algorithms for decomposing a polygon (with holes) into convex polygons by diagonals. The methods are computationally quick, and although the partitions that they produce may not have minimal cardinality they usually have a low number of convex pieces. Thus, the methods are suitable for being used when achieving a modest load on the CPU time is more important than finding optimal decompositions as, for instance, in location problems.

引用

页码：367 / 387

页数：21

共 21 条

[1]

[Anonymous], 1985, Computational Geometry, North-Holland

[2]

[Anonymous], P CCCG

[3]

[Anonymous], 1995, FACILITY LOCATION SU

[4]

[Anonymous], 1994, COMPUTATIONAL GEOMET