Consistent subdivision of convex polyhedra into tetrahedra

Authors:
Nelson Max
Affiliations:
Lawrence Livermore National Laboratory, and University of California, Davis
Venue:
Journal of Graphics Tools
Year:
2002

Citing 2
Cited 3

A polygonal approximation to direct scalar volume rendering

VVS '90 Proceedings of the 1990 workshop on Volume visualization
Interval volume tetrahedrization

VIS '97 Proceedings of the 8th conference on Visualization '97

Isosurface Construction in Any Dimension Using Convex Hulls

IEEE Transactions on Visualization and Computer Graphics
Volume Interval Segmentation and Rendering

VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Time-varying interval volumes

VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simple method of subdividing a grid of convex polyhedral cells into tetrahedra such that the subdivisions of two adjacent cells divide their common face into the same set of triangles. The method is then generalized to grids of convex polytopes in n dimensions.