TY - GEN

T1 - Equal-area locus-based convex polygon decomposition

AU - Adjiashvili, David

AU - Peleg, David

PY - 2008

Y1 - 2008

N2 - This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon P and a set X of k points positioned arbitrarily inside P, the task is to divide P into k equal area convex parts, each containing exactly one point of X. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time O(k n∈+∈k 2logk).

AB - This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon P and a set X of k points positioned arbitrarily inside P, the task is to divide P into k equal area convex parts, each containing exactly one point of X. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time O(k n∈+∈k 2logk).

UR - http://www.scopus.com/inward/record.url?scp=48249114738&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69355-0_13

DO - 10.1007/978-3-540-69355-0_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:48249114738

SN - 3540693262

SN - 9783540693260

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 141

EP - 155

BT - Structural Information and Communication Complexity - 15th International Colloquium, SIROCCO 2008, Proceedings

T2 - 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008

Y2 - 17 June 2008 through 20 June 2008

ER -