TY - JOUR

T1 - Equal-area locus-based convex polygon decomposition

AU - Adjiashvili, D.

AU - Peleg, D.

PY - 2010/3/17

Y1 - 2010/3/17

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 algorithm runs in time O (k n + k2 log k).

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 algorithm runs in time O (k n + k2 log k).

KW - Equitable subdivision

KW - Ham sandwich

KW - Polygon decomposition

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

U2 - 10.1016/j.tcs.2010.01.012

DO - 10.1016/j.tcs.2010.01.012

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:76849112482

SN - 0304-3975

VL - 411

SP - 1648

EP - 1667

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 14-15

ER -