Mesh data structure selection for mesh generation and FEA applications

Garimella, Rao V.

doi:10.1002/nme.509

Cited by 42 publications

(39 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of the data structures for simplicial complexes proposed in the work of De Floriani are implemented in the Mangrove Topological Data Structure Library which is publicly available [5]. For a detailed description and comparison of a selection of data structures focusing on mesh generation and finite element analysis, we refer to the work of Garimella [16]. Also a concise overview and comparison of array-based data structure concepts has been given by Alumbaugh et al in [1].…”

Section: Related Workmentioning

confidence: 99%

OpenVolumeMesh – A Versatile Index-Based Data Structure for 3D Polytopal Complexes

Kremer

Bommes

Kobbelt

2013

Proceedings of the 21st International Meshing Roundtable

View full text Add to dashboard Cite

Summary. We present a data structure which is able to represent heterogeneous 3-dimensional polytopal cell complexes and is general enough to also represent nonmanifolds without incurring undue overhead. Extending the idea of half-edge based data structures for two-manifold surface meshes, all faces, i.e. the two-dimensional entities of a mesh, are represented by a pair of oriented half-faces. The concept of using directed half-entities enables inducing an orientation to the meshes in an intuitive and easy to use manner.We pursue the idea of encoding connectivity by storing first-order top-down incidence relations per entity, i.e. for each entity of dimension d, a list of links to the respective incident entities of dimension d−1 is stored. For instance, each half-face as well as its orientation is uniquely determined by a tuple of links to its incident halfedges or each 3D cell by the set of incident half-faces. This representation allows for handling non-manifolds as well as mixed-dimensional mesh configurations. No entity is duplicated according to its valence, instead, it is shared by all incident entities in order to reduce memory consumption. Furthermore, an array-based storage layout is used in combination with direct index-based access. This guarantees constant access time to the entities of a mesh.Although bottom-up incidence relations are implied by the top-down incidences, our data structure provides the option to explicitly generate and cache them in a transparent manner. This allows for accelerated navigation in the local neighborhood of an entity.We provide an open-source and platform-independent implementation of the proposed data structure written in C++ using dynamic typing paradigms. The library is equipped with a set of STL compliant iterators, a generic property system to dynamically attach properties to all entities at run-time, and a serializer/deserializer supporting a simple file format. Due to its similarity to the OpenMesh data structure, it is easy to use, in particular for those familiar with OpenMesh. Since the presented data structure is compact, intuitive, and efficient, it is suitable for a variety of applications, such as meshing, visualization, and numerical analysis. OpenVolumeMesh is open-source software licensed under the terms of the LGPL.

show abstract

Section: Related Workmentioning

confidence: 99%

OpenVolumeMesh – A Versatile Index-Based Data Structure for 3D Polytopal Complexes

Kremer

Bommes

Kobbelt

2013

Proceedings of the 21st International Meshing Roundtable

View full text Add to dashboard Cite

show abstract

“…The complete method was implemented in C programing language using MSTK [6] environment for mesh representation.…”

Section: Numerical Examplesmentioning

confidence: 99%

Extension of efficient, swept‐integration‐based conservative remapping method for meshes with changing connectivity

Kuchařík

Shashkov

2007

Numerical Methods in Fluids

View full text Add to dashboard Cite

show abstract

“…This data structure, although very simple and sufficient for several finite element applications, is not adequate in an adaptive analysis environment due to the lack of topological information [1][2][3][4]. Indeed, several finite element applications [5][6][7][8][9][10], such as fragmentation simulation, require a data structure that provides adjacency information among the mesh topological entities.…”

Section: Introductionmentioning

confidence: 98%

“…A data structure that explicitly stores all topological entities, and all the adjacency relationships among them, tends to perform queries very efficiently, but demands high, sometimes prohibitive, storage space (to store all the information). Moreover, editing tasks may demand high computational efforts because several adjacency relationships have to be updated [1][2][3][4].…”

Section: Introductionmentioning

confidence: 99%

A compact adjacency-based topological data structure for finite element mesh representation

Celes

Paulino

Espinha

2005

Int. J. Numer. Meth. Engng

View full text Add to dashboard Cite

SUMMARYThis paper presents a novel compact adjacency-based topological data structure for finite element mesh representation. The proposed data structure is designed to support, under the same framework, both two-and three-dimensional meshes, with any type of elements defined by templates of ordered nodes. When compared to other proposals, our data structure reduces the required storage space while being 'complete', in the sense that it preserves the ability to retrieve all topological adjacency relationships in constant time or in time proportional to the number of retrieved entities. Element and node are the only entities explicitly represented. Other topological entities, which include facet, edge, and vertex, are implicitly represented. In order to simplify accessing topological adjacency relationships, we also define and implicitly represent oriented entities, associated to the use of facets, edges, and vertices by an element. All implicit entities are represented by concrete types, being handled as values, which avoid usual problems encountered in other reduced data structures when performing operations such as entity enumeration and attribute attachment. We also extend the data structure with the use of 'reverse indices', which improves performance for extracting adjacency relationships while maintaining storage space within reasonable limits. The data structure effectiveness is demonstrated by two different applications: for supporting fragmentation simulation and for supporting volume rendering algorithms.

show abstract

Mesh data structure selection for mesh generation and FEA applications

Cited by 42 publications

References 12 publications

OpenVolumeMesh – A Versatile Index-Based Data Structure for 3D Polytopal Complexes

OpenVolumeMesh – A Versatile Index-Based Data Structure for 3D Polytopal Complexes

Extension of efficient, swept‐integration‐based conservative remapping method for meshes with changing connectivity

A compact adjacency-based topological data structure for finite element mesh representation

Contact Info

Product

Resources

About