Recognizing Weakly Simple Polygons
Computational Geometry
2017-08-01 v2
Abstract
We present an -time algorithm that determines whether a given planar -gon is weakly simple. This improves upon an -time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input for several geometric algorithms. As such, how to recognize simple or weakly simple polygons is a fundamental question.
Keywords
Cite
@article{arxiv.1603.07401,
title = {Recognizing Weakly Simple Polygons},
author = {Hugo Akitaya and Greg Aloupis and Jeff Erickson and Csaba D. Tóth},
journal= {arXiv preprint arXiv:1603.07401},
year = {2017}
}
Comments
35 pages, 28 figures. A 15-page extended abstract has appeared in the Proceeding of the 32nd International Symposium on Computational Geometry (Boston, MA, 2016)