Skip to main content
Erschienen in:
Buchtitelbild

2014 | OriginalPaper | Buchkapitel

5. A Combinatorial Approach Based on Forman Theory

verfasst von : Lidija Čomić, Leila De Floriani, Paola Magillo, Federico Iuricich

Erschienen in: Morphological Modeling of Terrains and Volume Data

Verlag: Springer New York

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this chapter, we review algorithms based on Forman theory. These algorithms are combinatorial in nature and, thus, dimension-independent. Forman-based algorithms start from a Forman gradient vector field computed as a preliminary step. We discuss how to encode a Forman gradient over irregular simplicial complexes, by taking into account the relation between the input simplicial complex and its dual, and between the descending and ascending Morse complexes (Sect. 5.1). We describe the main algorithms for computing a Forman gradient on 2D and 3D scalar fields (Sect. 5.3). Finally we present algorithms which, given a Forman gradient, extract the collection of cells of the ascending and descending Morse complexes, the Morse-Smale cells, or the vertices and edges of the Morse-Smale complex (Sect. 5.4).

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat D. Canino, L. De Floriani, and K. Weiss. IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions. Computers & Graphics, 35(3):747–753, 2011. D. Canino, L. De Floriani, and K. Weiss. IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions. Computers & Graphics, 35(3):747–753, 2011.
2.
Zurück zum Zitat F. Cazals, F. Chazal, and T. Lewiner. Molecular shape analysis based upon the Morse-Smale complex and the Connolly function. In Proc. 9th Annual Symposium on Computational Geometry, pages 351–360, New York, USA, 2003. ACM Press. F. Cazals, F. Chazal, and T. Lewiner. Molecular shape analysis based upon the Morse-Smale complex and the Connolly function. In Proc. 9th Annual Symposium on Computational Geometry, pages 351–360, New York, USA, 2003. ACM Press.
3.
Zurück zum Zitat M. L. Connolly. Measurement of protein surface shape by solid angles. J. of Molecular Graphics, 4(1):3–6, 1986.MathSciNetCrossRef M. L. Connolly. Measurement of protein surface shape by solid angles. J. of Molecular Graphics, 4(1):3–6, 1986.MathSciNetCrossRef
4.
Zurück zum Zitat H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Berlin, 1987.CrossRefMATH H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Berlin, 1987.CrossRefMATH
5.
Zurück zum Zitat D. Günther, J. Reininghaus, H. Wagner, and I. Hotz. Efficient computation of 3D Morse-Smale complexes and persistent homology using discrete Morse theory. The Visual Computer, 28(10):959–969, 2012.CrossRef D. Günther, J. Reininghaus, H. Wagner, and I. Hotz. Efficient computation of 3D Morse-Smale complexes and persistent homology using discrete Morse theory. The Visual Computer, 28(10):959–969, 2012.CrossRef
6.
Zurück zum Zitat T. Gurung and J. Rossignac. SOT: Compact representation for triangle and tetrahedral meshes. Technical Report GT-IC-10-01, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA, 2010. T. Gurung and J. Rossignac. SOT: Compact representation for triangle and tetrahedral meshes. Technical Report GT-IC-10-01, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA, 2010.
7.
Zurück zum Zitat A. Gyulassy, P.-T. Bremer, B. Hamann, and V. Pascucci. A practical approach to Morse-Smale complex computation: Scalability and generality. IEEE Transactions on Visualization and Computer Graphics, 14(6):1619–1626, Nov-Dec 2008.CrossRef A. Gyulassy, P.-T. Bremer, B. Hamann, and V. Pascucci. A practical approach to Morse-Smale complex computation: Scalability and generality. IEEE Transactions on Visualization and Computer Graphics, 14(6):1619–1626, Nov-Dec 2008.CrossRef
8.
Zurück zum Zitat S. Harker, K. Mischaikow, M. Mrozek, and V. Nanda. Discrete Morse theoretic algorithms for computing homology of complexes and maps. Foundations of Computational Mathematics, 14(1):151–184, 2014.MathSciNetCrossRefMATH S. Harker, K. Mischaikow, M. Mrozek, and V. Nanda. Discrete Morse theoretic algorithms for computing homology of complexes and maps. Foundations of Computational Mathematics, 14(1):151–184, 2014.MathSciNetCrossRefMATH
9.
Zurück zum Zitat S. Harker, K. Mischaikow, M. Mrozek, V. Nanda, H. Wagner, M. Juda, and P. Dlotko. The efficiency of a homology algorithm based on discrete Morse theory and coreductions. In Proc. 3rd International Workshop on Computational Topology in Image Context (CTIC 2010). Image A, volume 1, pages 41–47, 2010. S. Harker, K. Mischaikow, M. Mrozek, V. Nanda, H. Wagner, M. Juda, and P. Dlotko. The efficiency of a homology algorithm based on discrete Morse theory and coreductions. In Proc. 3rd International Workshop on Computational Topology in Image Context (CTIC 2010). Image A, volume 1, pages 41–47, 2010.
10.
Zurück zum Zitat F. Iuricich. Multi-resolution shape analysis based on discrete Morse decompositions. PhD thesis, University of Genova – DIBRIS, Italy, 2014. F. Iuricich. Multi-resolution shape analysis based on discrete Morse decompositions. PhD thesis, University of Genova – DIBRIS, Italy, 2014.
11.
Zurück zum Zitat H. King, K. Knudson, and N. Mramor. Generating discrete Morse functions from point data. Experimental Mathematics, 14(4):435–444, 2005.MathSciNetCrossRefMATH H. King, K. Knudson, and N. Mramor. Generating discrete Morse functions from point data. Experimental Mathematics, 14(4):435–444, 2005.MathSciNetCrossRefMATH
12.
Zurück zum Zitat G. M. Nielson. Tools for triangulations and tetrahedralizations and constructing functions defined over them. In G. M. Nielson, H. Hagen, and H. Müller, editors, Scientific Visualization: overviews, Methodologies and Techniques, chapter 20, pages 429–525. IEEE Computer Society, Silver Spring, MD, 1997. G. M. Nielson. Tools for triangulations and tetrahedralizations and constructing functions defined over them. In G. M. Nielson, H. Hagen, and H. Müller, editors, Scientific Visualization: overviews, Methodologies and Techniques, chapter 20, pages 429–525. IEEE Computer Society, Silver Spring, MD, 1997.
13.
Zurück zum Zitat A. Paoluzzi, F. Bernardini, C. Cattani, and V. Ferrucci. Dimension-independent modeling with simplicial complexes. ACM Transactions on Graphics, 12(1):56–102, January 1993.CrossRefMATH A. Paoluzzi, F. Bernardini, C. Cattani, and V. Ferrucci. Dimension-independent modeling with simplicial complexes. ACM Transactions on Graphics, 12(1):56–102, January 1993.CrossRefMATH
14.
Zurück zum Zitat V. Robins, P. J. Wood, and A. P. Sheppard. Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8):1646–1658, 2011.CrossRef V. Robins, P. J. Wood, and A. P. Sheppard. Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8):1646–1658, 2011.CrossRef
15.
Zurück zum Zitat N. Shivashankar, S. Maadasamy, and V. Natarajan. Parallel computation of 2D Morse-Smale complexes. IEEE Transactions on Visualization and Computer Graphics, 18(10):1757–1770, 2012.CrossRef N. Shivashankar, S. Maadasamy, and V. Natarajan. Parallel computation of 2D Morse-Smale complexes. IEEE Transactions on Visualization and Computer Graphics, 18(10):1757–1770, 2012.CrossRef
16.
Zurück zum Zitat N. Shivashankar and V. Natarajan. Parallel computation of 3D Morse-Smale complexes. Computer Graphics Forum, 31(3):965–974, 2012.CrossRef N. Shivashankar and V. Natarajan. Parallel computation of 3D Morse-Smale complexes. Computer Graphics Forum, 31(3):965–974, 2012.CrossRef
17.
Zurück zum Zitat K. Weiss, F. Iuricich, R. Fellegara, and L. De Floriani. A primal/dual representation for discrete Morse complexes on tetrahedral meshes. Computer Graphics Forum, 32(3):361–370, 2013.CrossRef K. Weiss, F. Iuricich, R. Fellegara, and L. De Floriani. A primal/dual representation for discrete Morse complexes on tetrahedral meshes. Computer Graphics Forum, 32(3):361–370, 2013.CrossRef
Metadaten
Titel
A Combinatorial Approach Based on Forman Theory
verfasst von
Lidija Čomić
Leila De Floriani
Paola Magillo
Federico Iuricich
Copyright-Jahr
2014
Verlag
Springer New York
DOI
https://doi.org/10.1007/978-1-4939-2149-2_5