Isosurfaces on optimal regular samples

Authors:
Hamish Carr;Thomas Theußl;Torsten Möller
Affiliations:
University of British Columbia, Vancouver, British Columbia, Canada;Vienna University of Technology, Vienna, Austria;Simon Fraser University, Vancouver, BC, Canada
Venue:
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
Year:
2003

Citing 0
Cited 10

Voxelization in Common Sampling Lattices

PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Linear and Cubic Box Splines for the Body Centered Cubic Lattice

VIS '04 Proceedings of the conference on Visualization '04
Artifacts Caused by Simplicial Subdivision

IEEE Transactions on Visualization and Computer Graphics
On Histograms and Isosurface Statistics

IEEE Transactions on Visualization and Computer Graphics
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids

Discrete Applied Mathematics
Weighted distances based on neighbourhood sequences in non-standard three-dimensional grids

SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Weighted neighbourhood sequences in non-standard three dimensional grids: metricity and algorithms

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Weighted neighborhood sequences in non-standard three-dimensional grids: parameter optimization

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Topology preserving digitization with FCC and BCC grids

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Applications of optimal sampling lattices for volume acquisition via 3D computed tomography

VG'07 Proceedings of the Sixth Eurographics / Ieee VGTC conference on Volume Graphics

Quantified Score

Hi-index	0.00

Visualization

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.