Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete

Rémy Malgouyres, Angel R. Francés. Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete. In David Coeurjolly, Isabelle Sivignon, Laure Tougne, Florent Dupont, editors, Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings. Volume 4992 of Lecture Notes in Computer Science, pages 177-188, Springer, 2008. [doi]

Abstract

Abstract is missing.