Recognizing weakly simple polygons
type: Item
instance of: scholarly article
title: Recognizing weakly simple polygons
zbMATH Open document ID: 1454.68151
author: Hugo A. Akitaya
author: Greg Aloupis
author: Jeff Erickson
author: Csaba D. Tóth
published in: Discrete \& Computational Geometry
publication date: 2018-01-11T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5900/
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52C45
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6824881
zbMATH Keywords: simple polygon
zbMATH Keywords: combinatorial embedding
zbMATH Keywords: perturbation
MaRDI profile type: Publication
OpenAlex ID: W2309657040
cites work: Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
cites work: When can you fold a map?
cites work: Q4411355
cites work: Q4875182
cites work: Detecting Weakly Simple Polygons
cites work: Triangulating a simple polygon in linear time
cites work: Dynamic LCA Queries on Trees
cites work: Q4797605
cites work: On embedding a cycle in a plane graph
cites work: Q5452284
cites work: A Census of Plane Graphs with Polyline Edges
cites work: \(c\)-planarity of embedded cyclic \(c\)-graphs
cites work: Polygons: Meister was right and Poinsot was wrong but prevailed
cites work: Q4500936
cites work: On approximability by embeddings of cycles in the plane.
DOI: 10.1007/S00454-017-9918-3
description: scientific article; zbMATH DE number 6824881