We present two software packages for computing straight skeletons: Monos, our implementation of an algorithm by Biedl et al. (2015), computes the straight skeleton of a monotone input polygon, and Surfer2 implements a generalization of an algorithm by Aichholzer and Aurenhammer (1998) to handle multiplicatively-weighted planar straight-line graphs as input. The graphical user interfaces that ship with our codes support step-by-step computations, where each event can be investigated and studied by the user. This makes them a canonical candidate for educational purposes and detailed event analyses. Both codes are freely available on GitHub.
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.76, author = {Eder, G\"{u}nther and Held, Martin and Palfrader, Peter}, title = {{Step-By-Step Straight Skeletons}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {76:1--76:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.76}, URN = {urn:nbn:de:0030-drops-122343}, doi = {10.4230/LIPIcs.SoCG.2020.76}, annote = {Keywords: weighted straight skeleton, implementation, visualization, graphical user interface, education} }
Feedback for Dagstuhl Publishing