Compact Representations of Simplicial Meshes in Two and Three Dimensions

  title={Compact Representations of Simplicial Meshes in Two and Three Dimensions},
  author={Daniel K. Blandford and Guy E. Blelloch and David E. Cardoze and Clemens Kadow},
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… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 48 extracted citations

79 Citations

Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 68 references

Com - pa t representations of separable graphs

  • D. Blandford, G. Blello h, I. Kash.
  • Pro . ACMSIAM Symposium on Dis rete Algorithms
  • 2003

Etree - a databaseoriented method for generating largeo tree meshes

  • D. R. O'Hallaron T. Tu, J. C. Lopez.
  • Pro . International MeshingRoundtable , pages
  • 2002

Similar Papers

Loading similar papers…