Isosurfaces on Optimal Regular Samples

Isosurfaces on Optimal Regular Samples

Abstract

Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several different algorithms. Since the mesh that arises from BCC lattices involves a large number of cells, we show two alternate methods of reducing the number of cells by clumping tetrahedra into either octahedra or hexahedra. We also propose a theoretical model for estimating triangle counts for various algorithms, and present experimental results to show that isosurfaces generated using one of our algorithms can be competitive with isosurfaces generated using Marching Cubes on similar Cartesian grids.

Grafik Top
Authors
  • Carr, Hamish
  • Theußl, Thomas
  • Möller, Torsten
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
Joint EUROGRAPHICS - IEEE TCVG Symposium on Visualization (VisSym 2003)
Divisions
Visualization and Data Analysis
Subjects
Computergraphik
Event Location
Grenoble, France
Event Type
Conference
Event Dates
May 26-28
Date
May 2003
Export
Grafik Top