Compact array-based mesh data structures
From MaRDI portal
Cites work
- A class of data structures for 2-D and 3-D adaptive mesh refinement
- A compact adjacency-based topological data structure for finite element mesh representation
- A data structure dedicated to an integrated free-form surface meshing environment
- A general topology-based mesh data structure
- Adaptive meshing techniques for viscous flow calculations on mixed element unstructured meshes
- An algorithm oriented mesh database
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Design and data structure of fully adaptive, multigrid, finite-element software
- Efficient data structures for adaptive remeshing with the FEM
- Geometric Mesh Partitioning: Implementation and Experiments
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3720310 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- On the design of CGAL a computational geometry algorithms library
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Some useful data structures for the generation of unstructured grids
- Tetrahedral and hexahedral mesh adaptation for CFD problems
- Three-dimensional unstructured adaptive multigrid scheme for the Euler equations
- Using generic programming for designing a data structure for polyhedral surfaces
Cited in
(4)- Design, implementation, and evaluation of the \texttt{Surface\_mesh} data structure
- OpenVolumeMesh -- a versatile index-based data structure for 3D polytopal complexes
- AHF: array-based half-facet data structure for mixed-dimensional and non-manifold meshes
- Representing simplicial complexes with mangroves
This page was built for publication: Compact array-based mesh data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354149)
