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 for Binary Shapes Markus Demuth
 

Summary: Straight Skeletons for Binary Shapes
Markus Demuth
Institute for Theoretical Computer Science
Graz University of Technology
markus.demuth@tugraz.at
Franz Aurenhammer
Institute for Theoretical Computer Science
Graz University of Technology
auren@igi.tugraz.at
Axel Pinz
Institute of Electrical Measurement and Measurement Signal Processing
Graz University of Technology
axel.pinz@tugraz.at
Abstract
This paper reviews the concept of straight skeletons,
which is well known in computational geometry, and ap-
plies it to binary shapes that are used in vision-based shape
and object recognition. We devise a novel algorithm for
computing discrete straight skeletons from binary input im-
ages, which is based on a polygonal approximation of the

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universitšt Graz

 

Collections: Computer Technologies and Information Sciences