Equal-area locus-based convex polygon decomposition

D. Adjiashvili; D. Peleg

doi:10.1016/j.tcs.2010.01.012

Equal-area locus-based convex polygon decomposition

D. Adjiashvili
, D. Peleg

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

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 + k² log k).

Original language	English
Pages (from-to)	1648-1667
Number of pages	20
Journal	Theoretical Computer Science
Volume	411
Issue number	14-15
DOIs	https://doi.org/10.1016/j.tcs.2010.01.012
State	Published - 17 Mar 2010
Externally published	Yes

Keywords

Equitable subdivision
Ham sandwich
Polygon decomposition

Access to Document

10.1016/j.tcs.2010.01.012

Cite this

@article{884210ec75fb4be2a3e8b334b015ecbd,

title = "Equal-area locus-based convex polygon decomposition",

abstract = "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).",

keywords = "Equitable subdivision, Ham sandwich, Polygon decomposition",

author = "D. Adjiashvili and D. Peleg",

year = "2010",

month = mar,

day = "17",

doi = "10.1016/j.tcs.2010.01.012",

language = "אנגלית",

volume = "411",

pages = "1648--1667",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "14-15",

}

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 - https://www.scopus.com/pages/publications/76849112482

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 -

Equal-area locus-based convex polygon decomposition

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this