Show simple item record

dc.contributor.authorCarr, Hamishen_US
dc.contributor.editorH.-C. Hege and R. Machiraju and T. Moeller and M. Srameken_US
dc.date.accessioned2014-01-29T17:53:56Z
dc.date.available2014-01-29T17:53:56Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905674-03-3en_US
dc.identifier.issn1727-8376en_US
dc.identifier.urihttp://dx.doi.org/10.2312/VG/VG07/081-090en_US
dc.description.abstractIsosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher-order interpolants and for the quadrilinear interpolant in four dimensions. We also demonstrate that, apart from degenerate cases, Nielson's cases are in fact subsets of two basic configurations of the trilinear interpolant.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): G.1.1 [Numerical Analysis]: Interpolation G.1.2 [Numerical Analysis]: Approximation I.3.5 [Computer Graphics]: Computational Geometry and Object Modelingen_US
dc.title(No) More Marching Cubesen_US
dc.description.seriesinformationEurographics/IEEE VGTC Symposium on Volume Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record