English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The Area Partitioning Problem

MPS-Authors
/persons/resource/persons44076

Bast,  Hannah
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44616

Hert,  Susan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bast, H., & Hert, S. (2000). The Area Partitioning Problem. In D. Bremner (Ed.), Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00) (pp. 163-171). Fredericton, Canada: University of New Brunswick.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3405-A
Abstract
Given an arbitrary polygon with $n$ vertices, we wish to partition it into $p$ connected pieces of given areas. The problem is motivated by a robotics application in which the polygon is a workspace that is to be divided among $p$ robots performing a terrain-covering task. We show that finding an area partitioning with minimal cut length is NP-hard in the number of pieces and that it is even hard to approximate to within any factor that is independent of the shape of the polygon. We then present a simple $O(pn)$-time algorithm that produces non-optimal, but often quite reasonable, area partitionings for arbitrary polygons.