Optimal reconstruction might be hard

DOI10.1145/1810959.1811014zbMath1284.68275OpenAlexW2025885831MaRDI QIDQ5405898

André Lieutier, Dominique Attali

Publication date: 3 April 2014

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

Full work available at URL: https://doi.org/10.1145/1810959.1811014

zbMATH Keywords

NP-completenessshape reconstructionsampling conditionstopological persistence3SAThomological simplification

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Simplicial sets and complexes in algebraic topology (55U10)

This page was built for publication: Optimal reconstruction might be hard