2020
DOI: 10.48550/arxiv.2012.03381
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Solving the Minimum Convex Partition of Point Sets with Integer Programming

Abstract: The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in geometric terms, as finding a subdivision of a planar map -which represents, say, a geographical area -into regions subject to certain conditions while optimizing some objective function. In this paper, we investigate one of these geometric problems known as the Minimum Convex Part… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 20 publications
(37 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?