Compact Representations of Simplicial Meshes in Two and Three Dimensions

We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of five less memory than the most efficient standard data structures for triangular or tetrahedral meshes, while efficiently supporting traversal among simplices, storing data on simplices, and insertion and deletion of simplices. Our implementation of the data structures uses about 5 bytes/triangle in two dimensions (2D) and 7.5 bytes/tetrahedron in three dimensions (3D). We use the data structures to implement 2D and 3D incremental algorithms for generating a Delaunay mesh. The 3D algorithm can generate 100 Million tetrahedrons with 1 Gbyte of memory, including the space for the coordinates and all data used by the algorithm. The runtime of the algorithm is as fast as Shewchuk’s Pyramid code, the most efficient we know of, and uses a factor of 3.5 less memory overall.

• Type: Conference
• Year: 2003
• Where: IMR
• Authors: Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow
• Keywords: Computational Geometry, Data Structures, IMR 2003, Simplicial Meshes, Standard Data Structures