Homological reconstruction and simplification in R3

Abstract : We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-complete.
Document type :
Reports
[Research Report] RR-8169, INRIA. 2012


https://hal.inria.fr/hal-00761208
Contributor : Olivier Devillers <>
Submitted on : Wednesday, December 5, 2012 - 10:09:35 AM
Last modification on : Wednesday, February 4, 2015 - 10:40:16 AM

File

RR-8169.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00761208, version 1

Citation

Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier. Homological reconstruction and simplification in R3. [Research Report] RR-8169, INRIA. 2012. <hal-00761208>

Export

Share

Metrics

Consultation de
la notice

365

Téléchargement du document

69