The complexity of detecting taut angle structures on triangulations
The complexity of detecting taut angle structures on triangulations
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)The complexity of detecting taut angle structures on triangulationsBenjamin A. Burton and Jonathan SpreerBenjamin A. Burton and Jonathan Spreerpp.168 - 183Chapter DOI:https://doi.org/10.1137/1.9781611973105.13PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract There are many fundamental algorithmic problems …