Primitives for the manipulation of three-dimensional subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Finite Elements in Analysis and Design
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
libMesh: a C++ library for parallel adaptive mesh refinement/coarsening simulations
Engineering with Computers
Compact combinatorial maps: A volume mesh data structure
Graphical Models
Hi-index | 0.00 |
We propose a compact data structure for volumetric meshes of arbitrary topology and bounded valence, which offers cell-face, face-edge, and edge-vertex incidence queries in constant time. Our structure is simple to implement, easy to use, and allows for arbitrary, user-defined volume cells, while remaining very efficient in memory usage compared to previous work.