Modifiable array data structures for mesh topology
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) General geometric structures on low-dimensional manifolds (57M50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- A compact adjacency-based topological data structure for finite element mesh representation
- Efficient data structures for adaptive remeshing with the FEM
- Data structures and concepts for adaptive finite element methods
- A class of data structures for 2-D and 3-D adaptive mesh refinement
- Data Structures for Multiresolution Representation of Unstructured Meshes
Cites work
- 3D anisotropic mesh adaptation by mesh modification
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
- A compact adjacency-based topological data structure for finite element mesh representation
- A mesh adaptation framework for dealing with large deforming meshes
- Accounting for curved domains in mesh adaptation
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- Introduction to algorithms
- Mesh data structure selection for mesh generation and FEA applications
- PUMI: parallel unstructured mesh infrastructure
- Tetrahedral and hexahedral mesh adaptation for CFD problems
- Triangulations in CGAL (extended abstract)
Cited in
(3)
This page was built for publication: Modifiable array data structures for mesh topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738149)
