Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves

DOI10.1137/0220038zbMath0736.68030OpenAlexW2008564520MaRDI QIDQ3978171

Kurt Mehlhorn, Chee-Keng Yap

Publication date: 25 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220038

zbMATH Keywords

winding numberWhitney-Graustein theoremcomputational algebraic topologypolygonscation of polygons

Mathematics Subject Classification ID

Degree, winding number (55M25) Parallel algorithms in computer science (68W10)

Related Items (2)

Winding indexes of Max. and Min. Hamiltonians in N-Gons ⋮ Complexity of plane and spherical curves

This page was built for publication: Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves