License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2016.8
URN: urn:nbn:de:0030-drops-59003
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5900/
Go to the corresponding LIPIcs Volume Portal


Akitaya, Hugo A. ; Aloupis, Greg ; Erickson, Jeff ; Tóth, Csaba

Recognizing Weakly Simple Polygons

pdf-format:
LIPIcs-SoCG-2016-8.pdf (0.8 MB)


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(n^2 log n)-time algorithm by [Chang, Erickson, and Xu, SODA, 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.

BibTeX - Entry

@InProceedings{akitaya_et_al:LIPIcs:2016:5900,
  author =	{Hugo A. Akitaya and Greg Aloupis and Jeff Erickson and Csaba T{\'o}th},
  title =	{{Recognizing Weakly Simple Polygons}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{8:1--8:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{S{\'a}ndor Fekete and Anna Lubiw},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5900},
  URN =		{urn:nbn:de:0030-drops-59003},
  doi =		{10.4230/LIPIcs.SoCG.2016.8},
  annote =	{Keywords: weakly simple polygon, crossing}
}

Keywords: weakly simple polygon, crossing
Seminar: 32nd International Symposium on Computational Geometry (SoCG 2016)
Issue Date: 2016
Date of publication: 09.06.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI