Algorithms for fair partitioning of convex polygons

被引：5

作者：

Armaselu, Bogdan ^{[1
]}

Daescu, Ovidiu ^{[1
]}

机构：

[1] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75083 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2015年 / 607卷

关键词：

Algorithm; Fair partitioning; Convex polygon;

D O I：

10.1016/j.tcs.2015.08.003

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we study the problem of partitioning a convex polygon P of n vertices into m polygons of equal area and perimeter. We give an algorithm for m = 2 that runs in 0(n) time, and an algorithm for m = 2(k), where k is an integer, that runs in O ((2n)(k)) time. These are the first algorithms to solve this problem. (C) 2015 Elsevier B.V. All rights reserved.

引用

页码：351 / 362

页数：12

共 50 条

[31] On a partition into convex polygons
Urabe, M
DISCRETE APPLIED MATHEMATICS, 1996, 64 (02) : 179 - 191
[32] CONVEX LATTICE POLYGONS
WILLS, JM
COMMENTARII MATHEMATICI HELVETICI, 1973, 48 (02) : 188 - 194
[33] Reconfiguring convex polygons
Aichholzer, O
Demaine, ED
Erickson, J
Hurtado, F
Overmars, M
Soss, M
Toussaint, GT
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 20 (1-2): : 85 - 95
[34] THE MORPHOLOGY OF CONVEX POLYGONS
OLARIU, S
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1992, 24 (07) : 59 - 68
[35] FAST CONVEX POLYGONS
ABRASH, M
DR DOBBS JOURNAL, 1991, 16 (03): : 129 - &
[36] APPROXIMATION OF CONVEX POLYGONS
ALT, H
BLOMER, J
GODAU, M
WAGENER, H
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 703 - 716
[37] On a partition into convex polygons
Discrete Appl Math, 2 (179):
[38] PARALLEL ALGORITHMS FOR SEPARATION OF 2 SETS OF POINTS AND RECOGNITION OF DIGITAL CONVEX POLYGONS
SARKAR, D
STOJMENOVIC, I
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1992, 21 (02) : 109 - 121
[39] Convex polygons as carriers
Shephard, G. C.
MATHEMATICAL GAZETTE, 2016, 100 (547): : 93 - 102
[40] ON PARTITIONING RECTILINEAR POLYGONS INTO STAR-SHAPED POLYGONS
LIU, R
NTAFOS, S
ALGORITHMICA, 1991, 6 (06) : 771 - 800

← 1 2 3 4 5 →