Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Fast polyhedral cell sorting for interactive rendering of unstructured grids
Autore:
Comba, J; Klosowski, JT; Max, N; Mitchell, JSB; Silva, CT; Williams, PL;
Indirizzi:
Stanford Univ, Stanford, CA 94305 USA Stanford Univ Stanford CA USA 94305Stanford Univ, Stanford, CA 94305 USA IBM, TJ Watson Res Ctr, Yorktown Heights, NY 10598 USA IBM Yorktown Heights NY USA 10598 Res Ctr, Yorktown Heights, NY 10598 USA Univ Calif Lawrence Livermore Natl Lab, Livermore, CA 94550 USA Univ CalifLawrence Livermore Natl Lab Livermore CA USA 94550 A 94550 USA SUNY Stony Brook, Stony Brook, NY 11794 USA SUNY Stony Brook Stony Brook NY USA 11794 rook, Stony Brook, NY 11794 USA
Titolo Testata:
COMPUTER GRAPHICS FORUM
fascicolo: 3, volume: 18, anno: 1999,
pagine: C369 -
SICI:
0167-7055(1999)18:3<C369:FPCSFI>2.0.ZU;2-E
Fonte:
ISI
Lingua:
ENG
Keywords:
volume rendering; scientific visualization; finite element methods; depth ordering; volume visualization; visibility ordering;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
22
Recensione:
Indirizzi per estratti:
Indirizzo: Comba, J Stanford Univ, Stanford, CA 94305 USA Stanford Univ Stanford CA USA 94305 Univ, Stanford, CA 94305 USA
Citazione:
J. Comba et al., "Fast polyhedral cell sorting for interactive rendering of unstructured grids", COMPUT GR F, 18(3), 1999, pp. C369

Abstract

Direct volume rendering based on projective methods works by projecting invisibility order the polyhedral cells of a mesh onto the image plane, and incrementally compositing the cell's color and opacity into the final image. Crucial to this method is the computation of a visibility ordering of thecells. If the mesh is "well-behaved" (acyclic and convex), then the MPVO method of Williams provides a very fast sorting algorithm; however this method only computes an approximate ordering in general datasets, resulting in visual artifacts when rendered. A recent method of Silva et al. removed theassumption that the mesh is convex, by means of a sweep algorithm used in conjunction with the MPVO method; their algorithm is substantially faster than previous exact methods for general meshes. In this paper we propose a new technique, which we call BSP-XMPVO which isbased on a fast and simple way of using binary space partitions on the boundary elements of the mesh to augment the ordering produced by MPVO. Our results are shown to be orders of magnitude better than previous exact methods of sorting cells.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 06/04/20 alle ore 05:42:14