Optimally cutting a surface into a disk

DOI10.1145/513400.513430zbMath1414.68118arXivcs/0207004OpenAlexW2102151147MaRDI QIDQ4557560

Jeff Erickson, Sariel Har-Peled

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0207004

zbMATH Keywords

approximationNP-hardnesscomputational topologycut graphpolyhedral 2-manifoldpolygonal schema

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polyhedral manifolds (52B70)

Related Items (1)

Origami Embedding of Piecewise-Linear Two-Manifolds

This page was built for publication: Optimally cutting a surface into a disk