# Straight Skeleton of Polygons

This page implements an algorithm for finding the straigh skeleton of an area defined by polygons (with holes). The
algorithm asumes that the polygons are not overlapping and do not contain
edges where the sides that are extended into each other. I searched for a
'simple' algorithm. This algorithm is based on the triangulation algoritm that I wrote before. For each edge it searches all
edges that are visible from it (using the triangulation) and finds the middle
line between the two edges. These are knit together to form the area that
'belongs' to the edge. If one would attach half-edges around each area, it is
possible to knit them together to create a doubly connected edge list.