English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Connected Area Partitioning

Hert, S. (2001). Connected Area Partitioning. In Proceedings of the 17th European Workshop on Computational Geometry (CG-01) (pp. 35-38). Berlin, Germany: Freie Universität Berlin.

Item is

Files

show Files
hide Files
:
connected_area_part.ps.gz (Any fulltext), 19KB
 
File Permalink:
-
Name:
connected_area_part.ps.gz
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/gzip
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Hert, Susan1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present an algorithm to solve the following polygon partitioning problem, which is motivated by a terrain-covering application in robotics: Given a simply connected polygon $\cal P$ and values \subrange{a}{1}{p+1} such that $\sum_{i = 1}^{p+1} a_i = Area({\cal P})$, find a partitioning of $\cal P$ into $p+1$ polygons \subrange{P}{1}{p+1} such that $Area(P_i) = a_i$ for all $i$ and polygon $P_{p+1}$ is connected to each of the other polygons. The algorithm we present runs in $O(n + q \log q + pn)$ time for a polygon with $n$ vertices that has been partitioned into $q$ convex pieces.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022001
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Freie Universität Berlin
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518178
Other: Local-ID: C1256428004B93B8-13D9C87B204D4571C1256A9C002958AC-h-cap-01
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Berlin, Germany
Start-/End Date: 2001

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 17th European Workshop on Computational Geometry (CG-01)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Freie Universität Berlin
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 35 - 38 Identifier: -