| | |
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
|
