@inproceedings{e74d90f0d10c47b6a2e6d5fab14bd2b9,
title = "Recognizing weakly simple polygons",
abstract = "We present an O(n log n)-time algorithm that determines whether a given planar n-gon is weakly simple. This improves upon an O(n2 log n)-time algorithm by Chang, Erickson, and Xu [4]. 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 = "Crossing, Weakly simple polygon",
author = "Akitaya, {Hugo A.} and Greg Aloupis and Jeff Erickson and T{\'o}th, {Csaba D.}",
note = "Publisher Copyright: {\textcopyright} Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, and Csaba D. T{\'o}th.; 32nd International Symposium on Computational Geometry, SoCG 2016 ; Conference date: 14-06-2016 Through 17-06-2016",
year = "2016",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.SoCG.2016.8",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "8.1--8.16",
editor = "Sandor Fekete and Anna Lubiw",
booktitle = "32nd International Symposium on Computational Geometry, SoCG 2016",
}