Straight Skeleton in 1-Cut Thm zShrink boundary yHandle nonconvex polygons new event when vertex hits opposite edge yHandle nonpolygons butt vertices of degree 0 and 1
Straight Skeletons An alternative to the medial axis Kevin Danaher Computer Geometry Fall 2002
Shrinking Process (contd) zPolygon hierarchy during shrinking
Events zTwo events can occur: yEdge event: an edge shrinks to zero, making its neighboring edges adjacent. ySplit event: A reflex vertex runs to an edge and splits it, thus splitting the whole polygon. New adjacencies occur between the split edge and each of the two edges incident to the reflex vertex.
Formal Definitions zThe straight skeleton, S(P), of polygon, P, is the union of the pieces of the angular bisectors traced out by the polygon vertices during the shrinking process. zEach edge, e, sweeps out a certain area called the face of e. zBisector pieces are called arcs, and their endpoints which are not vertices of P are called nodes of S(P).
Properties zIf P is an n-gon, then S(P): yrealizes 2n -3 arcs yrealizes n -2 nodes yDivides P into n monotone polygons
Why straight skeleton? zThe straight skeleton has a lower combinatorial complexity than the medial axis for non-convex polygons. yMedial axis has 2n+r –3 arcs (with r parabolically curved) -vs- 2n –3 for straight skeleton
Bibliography zO. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gartner. A novel type of skeleton for polygons. Journal of universal computer science, Institute for Image Processing and Computer Supported New Media, 1(12): , zO. Aichholzer and F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, Proc.2nd COCOON, Lecture Notes in Computer Science, 1090, Springer-Verlag, Berlin, 1996, pp zP. Felkel, S. Obdrzalek, Straight Skeleton Implementaion, 14th Spring Conference on Computer Graphics (SCCG'98), , 1998.