Flexible Distributed Mesh Data Structure for Parallel Adaptive Analysis

Shephard, Mark S.; Seol, Seegyoung

doi:10.1002/9780470558027.ch19

Cited by 10 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their approach and its extension for parallel analysis [28], a dynamic mesh representation is used, i.e. a representation which is able to adapt to the needs of an individual algorithm.…”

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 RPI implementation of the TSTT mesh interface builds on its research and development of flexible mesh databases that can store the desired mesh adjacencies [26]. The RPI implementation was fully implemented to support parallel distributed meshes [25,27,29,33].…”

Section: Mesh Interfacementioning

confidence: 99%

Rensselaer Component of the Terascale Simulation Tools and Technologies - Final Report

Shephard¹

2009

View full text Add to dashboard Cite

“…The most detailed description of this subject for unstructured meshes is reported by Seol et al [11]. In their work, mesh is migrated between processors in the context of a partition model, which is maintained before and after the migration.…”

Section: B Previous Workmentioning

confidence: 99%

“…In their work, mesh is migrated between processors in the context of a partition model, which is maintained before and after the migration. The method described in [11] requires at least four message exchanges between each sending and receiving processor pair: synchronizing the partition model before migration, sending entities, receiving back entity references, and forwarding references to other sharing processors. The described method packs entities of each topological dimension in separate messages; to avoid the high latency cost of sending many separate messages, a message aggregator is used.…”

Section: B Previous Workmentioning

confidence: 99%

Mesh Interface Resolution and Ghost Exchange in a Parallel Mesh Representation

Tautges

Kraftcheck

Bertram

et al. 2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops &Amp; PhD Forum

View full text Add to dashboard Cite

Abstract-Algorithms are described for the resolution of shared vertices and higher-dimensional interfaces on domain-decomposed parallel mesh, and for ghost exchange between neighboring processors. Performance data is given for large (up to 64M tet and 32M hex element) meshes on up to 16k processors. Shared interface resolution for structured mesh is also described. Small modifications are required to enable the algorithm to match vertices based on geometric location, useful for joining multi-piece meshes; this capability is also demonstrated.

show abstract

Flexible Distributed Mesh Data Structure for Parallel Adaptive Analysis

Cited by 10 publications

References 23 publications

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

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

Rensselaer Component of the Terascale Simulation Tools and Technologies - Final Report

Mesh Interface Resolution and Ghost Exchange in a Parallel Mesh Representation

Contact Info

Product

Resources

About