COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
From MaRDI portal
Publication:4676179
DOI10.1142/S0218195905001580zbMath1060.65555MaRDI QIDQ4676179
Daniel K. Blandford, Clemens Kadow, David E. Cardoze, Guy E. Blelloch
Publication date: 3 May 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
algorithmscompressiondata structurescomputational geometryDelaunay meshsimplicial meshesmesh representations
Related Items (6)
CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS ⋮ An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models ⋮ A high quality interpolation method for colocated polyhedral/polygonal control volume methods ⋮ Automated FEM discretizations for the Stokes equation ⋮ Modifiable Array Data Structures for Mesh Topology ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Uses Software
Cites Work
- Primitives for the manipulation of three-dimensional subdivisions
- Design and implementation of a practical parallel Delaunay algorithm
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Finding the intersection of two convex polyhedra
- Using generic programming for designing a data structure for polyhedral surfaces
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Triangulations in CGAL
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Universal codeword sets and representations of the integers
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
- Separators for sphere-packings and nearest neighbor graphs
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
This page was built for publication: COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
