This is a Python 3 implementation of the straight skeleton algorithm as described by Felkel and Obdržálek in their 1998 conference paper Straight skeleton implementation.
The algorithm itself is fairly dated, and shown to be incorrect for certain input polygons. This implementation is a bit crap, and does not really attempt to fix the algorithm. It works kinda okay for most real-life input (for example country contours or floor plans).
For a modern and excellent overview of the topic please refer to Stefan Huber's excellent Computing Straight Skeleton and Motorcycle Graphs: Theory and Practice.
You will need Python 3.8.1.
Download the repo and install using pip: pip install -r requirements.txt.
We use euclid3 for geometry computations, and the demo uses Pillow to display the images.
Use demo.py for a demonstration.
The demo parses an input polygon file, and outputs a tree structure representing the straight skeleton, as well as an image of the polygon with the skeleton.
demo.py [-h] [--verbose] [--log {DEBUG,INFO,WARNING,ERROR}] <polygon-file>
-hshow the help message and exit.--verboseoutput an image after every event, marking the current state of the skeleton and the bisectors of all vertices. Do not do this for large polygons--logset the lowest log level to display. Polyskel logs events at info level, and further information at debug level.<polygon-file>the text file describing the polygon. The polygon is to be given as a counter-clockwise series of vertices specified by their coordinates. Holes can be specified as a clockwise series of coordinates. A number of example inputs are supplied in theexamplesfolder.
Check out Yongha Hwang's fork to see polyskel in sweet real-life action <3 <3 <3.
There is also a Swift port available of Yongha Hwang's version.