| dc.contributor.author | Carr, Hamish | en_US |
| dc.contributor.author | Theußl, Thomas | en_US |
| dc.contributor.author | Möller, Torsten | en_US |
| dc.contributor.editor | G.-P. Bonneau and S. Hahmann and C. D. Hansen | en_US |
| dc.date.accessioned | 2014-01-30T07:36:31Z | |
| dc.date.available | 2014-01-30T07:36:31Z | |
| dc.date.issued | 2003 | en_US |
| dc.identifier.isbn | 3-905673-01-0 | en_US |
| dc.identifier.issn | 1727-5296 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/VisSym/VisSym03/039-048 | en_US |
| dc.description.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 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Isosurfaces on Optimal Regular Samples | en_US |
| dc.description.seriesinformation | Eurographics / IEEE VGTC Symposium on Visualization | en_US |
