The Implementation of the Colored Abstract Simplicial Complex and Its Application to Mesh Generation

We introduce the Colored Abstract Simplicial Complex library (CASC): a new, modern, and header-only C++ library that provides a data structure to represent arbitrary dimension abstract simplicial complexes (ASC) with user-defined classes stored directly on the simplices at each dimension. This is accomplished by using the latest C++ language features including variadic template parameters introduced in C++11 and automatic function return type deduction from C++14. Effectively, CASC decouples the representation of the topology from the interactions of user data. We present the innovations and design principles of the data structure and related algorithms. This includes a metadata-aware decimation algorithm, which is general for collapsing simplices of any dimension. We also present an example application of this library to represent an orientable surface mesh.

[1]  R. Bank,et al.  Some Refinement Algorithms And Data Structures For Regular Local Mesh Refinement , 1983 .

[2]  Leila De Floriani,et al.  Data structures for simplicial complexes: an analysis and a comparison , 2005, SGP '05.

[3]  Zeyun Yu,et al.  Three-dimensional geometric modeling of membrane-bound organelles in ventricular myocytes: bridging the gap between microscopic imaging and mathematical simulation. , 2008, Journal of structural biology.

[4]  Yongjie Jessica Zhang,et al.  Geometric Modeling and Mesh Generation from Scanned Images , 2016 .

[5]  Zeyun Yu,et al.  High-Fidelity Geometric Modelling for Biomedical Applications , 2008 .

[6]  Eric Vanden-Eijnden,et al.  Markovian milestoning with Voronoi tessellations. , 2009, The Journal of chemical physics.

[7]  Michael J. Holst,et al.  Feature-preserving surface mesh smoothing via suboptimal Delaunay triangulation , 2013, Graph. Model..

[8]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[9]  Jean-Daniel Boissonnat,et al.  Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension , 2009, SCG '09.

[10]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[11]  Jean-Daniel Boissonnat,et al.  The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes , 2012, Algorithmica.

[12]  T. Regge.  General relativity without coordinates , 1961 .

[13]  Leila De Floriani,et al.  IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions , 2011, Comput. Graph..

[14]  Hang Si,et al.  TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator , 2015, ACM Trans. Math. Softw..

[15]  B. Joe,et al.  Relationship between tetrahedron shape measures , 1994 .

[16]  Elijah Roberts,et al.  Cellular and molecular structure as a unifying framework for whole-cell modeling. , 2014, Current opinion in structural biology.

[17]  Timothy J. Tautges,et al.  AHF: array-based half-facet data structure for mixed-dimensional and non-manifold meshes , 2015, Engineering with Computers.

[18]  Leila De Floriani,et al.  A data structure for non-manifold simplicial d-complexes , 2004, SGP '04.

[19]  M. Holst,et al.  The emergence of gravitational wave science: 100 years of development of mathematical theory, detectors, numerical algorithms, and data analysis tools , 2016, 1607.05251.

[20]  R. Bank,et al.  An algorithm for coarsening unstructured meshes , 1996 .

[21]  M. Holst,et al.  Finite Element Exterior Calculus for Parabolic Evolution Problems on Riemannian Hypersurfaces , 2015, Journal of Computational Mathematics.

[22]  Leila De Floriani,et al.  A Dimension-Independent Data Structure for Simplicial Complexes , 2010, IMR.

[23]  Iulian Grindeanu,et al.  Array-based Hierarchical Mesh Generation in Parallel , 2015 .

[24]  I. Babuska,et al.  ON THE ANGLE CONDITION IN THE FINITE ELEMENT METHOD , 1976 .