Fast polyhedral cell sorting for interactive rendering of unstructured grids

Joao Comba, James T. Klosowski, Nelson Max, Joseph S B Mitchell, Claudio T. Silval, Peter L.williams

Research output: Contribution to journalArticle

Abstract

Direct volume rendering based on protective methods works by projecting, in visibility 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 the cells. If the mesh is well-beliaved (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 ofSilva et al. removed the assumption tliat 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 is based 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.

Original languageEnglish (US)
JournalComputer Graphics Forum
Volume18
Issue number3
StatePublished - 1999

Fingerprint

Sorting
Cells
Visibility
Volume rendering
Opacity
Color
Rendering (computer graphics)

Keywords

  • Depth ordering
  • Finite element methods
  • Scientific visualization
  • Visibility ordering
  • Volume rendering
  • Volume visualization

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Comba, J., Klosowski, J. T., Max, N., Mitchell, J. S. B., Silval, C. T., & L.williams, P. (1999). Fast polyhedral cell sorting for interactive rendering of unstructured grids. Computer Graphics Forum, 18(3).

Fast polyhedral cell sorting for interactive rendering of unstructured grids. / Comba, Joao; Klosowski, James T.; Max, Nelson; Mitchell, Joseph S B; Silval, Claudio T.; L.williams, Peter.

In: Computer Graphics Forum, Vol. 18, No. 3, 1999.

Research output: Contribution to journalArticle

Comba, J, Klosowski, JT, Max, N, Mitchell, JSB, Silval, CT & L.williams, P 1999, 'Fast polyhedral cell sorting for interactive rendering of unstructured grids', Computer Graphics Forum, vol. 18, no. 3.
Comba, Joao ; Klosowski, James T. ; Max, Nelson ; Mitchell, Joseph S B ; Silval, Claudio T. ; L.williams, Peter. / Fast polyhedral cell sorting for interactive rendering of unstructured grids. In: Computer Graphics Forum. 1999 ; Vol. 18, No. 3.
@article{65037b0bc27241ac9fd9ecaab3eebd85,
title = "Fast polyhedral cell sorting for interactive rendering of unstructured grids",
abstract = "Direct volume rendering based on protective methods works by projecting, in visibility 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 the cells. If the mesh is well-beliaved (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 ofSilva et al. removed the assumption tliat 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 is based 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.",
keywords = "Depth ordering, Finite element methods, Scientific visualization, Visibility ordering, Volume rendering, Volume visualization",
author = "Joao Comba and Klosowski, {James T.} and Nelson Max and Mitchell, {Joseph S B} and Silval, {Claudio T.} and Peter L.williams",
year = "1999",
language = "English (US)",
volume = "18",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - Fast polyhedral cell sorting for interactive rendering of unstructured grids

AU - Comba, Joao

AU - Klosowski, James T.

AU - Max, Nelson

AU - Mitchell, Joseph S B

AU - Silval, Claudio T.

AU - L.williams, Peter

PY - 1999

Y1 - 1999

N2 - Direct volume rendering based on protective methods works by projecting, in visibility 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 the cells. If the mesh is well-beliaved (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 ofSilva et al. removed the assumption tliat 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 is based 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.

AB - Direct volume rendering based on protective methods works by projecting, in visibility 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 the cells. If the mesh is well-beliaved (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 ofSilva et al. removed the assumption tliat 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 is based 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.

KW - Depth ordering

KW - Finite element methods

KW - Scientific visualization

KW - Visibility ordering

KW - Volume rendering

KW - Volume visualization

UR - http://www.scopus.com/inward/record.url?scp=0032691830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032691830&partnerID=8YFLogxK

M3 - Article

VL - 18

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -