Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
STRAIGHT SKELETONS OF SIMPLE POLYGONS OSWIN AICHHOLZER
 

Summary: STRAIGHT SKELETONS OF SIMPLE POLYGONS
OSWIN AICHHOLZER
FRANZ AURENHAMMER
Institute for Theoretical Computer Science
Graz University of Technology
Klosterwiesgasse 32/2, A­8010 Graz, Austria
foaich,aureng@igi.tu­graz.ac.at
DAVID ALBERTS
BERND G ¨
ARTNER
Institut f¨ ur Informatik
Freie Universit¨ at Berlin
Takustraße 9, D­14195 Berlin, Germany
falberts,gaertnerg@inf.fu­berlin.de
Keywords: Simple polygon, skeleton, roof construction
Abstract A new internal structure for simple polygons, the straight skeleton, is introduced and dis­
cussed. It is a tree and partitions the interior of a given n­gon P into n monotone polygons, one
for each edge of P . Its straight­line structure and its lower combinatorial complexity may make
the straight skeleton S(P ) preferable to the widely used medial axis of P . We show that S(P ) has
no Voronoi diagram structure and give an O(nr log n) time and O(n) space construction algorithm,

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universität Graz
Technische Universität Graz, Institute for Software Technology

 

Collections: Computer Technologies and Information Sciences