Adaptive TetraPuzzles -- efficient out-of-core construction and visualization of gigantic polygonal models

We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models. The method uses a regular conformal hierarchy of tetrahedra to spatially partition the model. Each tetrahedral cell contains a precomputed simplified version of the original model, represented using cache coherent indexed strips for fast rendering. The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds (sets of tetrahedral cells sharing their longest edge). The construction preprocess operates out-of-core and parallelizes nicely. Appropriate boundary constraints are introduced in the simplification to ensure that all conforming selective subdivisions of the tetrahedron hierarchy lead to correctly matching surface patches. For each frame at runtime, the hierarchy is traversed coarse-to-fine to select diamonds of the appropriate resolution given the view parameters. The resulting system can interatively render high quality views of out-of-core models of hundreds of millions of triangles at over 40Hz (or 70M triangles/s) on current commodity graphics platforms.

@Article{CGGMPS04c,
  author       = {Cignoni, P. and Ganovelli, F. and Gobbetti, E. and Marton, F. and Ponchio, F. and Scopigno, R.},
  title        = {Adaptive TetraPuzzles -- efficient out-of-core construction and visualization of gigantic polygonal models},
  journal      = {ACM Transactions on Graphics},
  number       = {3},
  volume       = {23},
  pages        = {796--803},
  month        = {august},
  year         = {2004},
  publisher    = {ACM Press},
  note         = {Proc. SIGGRAPH 2004 i dxproject: VPLANET  address: New York, NY, USA},
  keywords     = {VPLANET},
  url          = {https://publications.crs4.it/pubdocs/2004/CGGMPS04c},
}