Optimal Surface Flattening
From MaRDI portal
Publication:3507338
DOI10.1007/978-3-540-69311-6_25zbMath1143.68615OpenAlexW1504467940MaRDI QIDQ3507338
Publication date: 19 June 2008
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_25
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- The flattening of triangulated surfaces incorporating darts and gussets.
- Planar development of free-form surfaces: quality evaluation and visual inspection
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
- On the Computational Complexity of Combinatorial Problems
- The Rectilinear Steiner Tree Problem is $NP$-Complete
This page was built for publication: Optimal Surface Flattening