1990
DOI: 10.1145/99308.99322
|View full text |Cite
|
Sign up to set email alerts
|

A polygonal approximation to direct scalar volume rendering

Abstract: Abstrac tOne method of directly rendering a three-dimensional volume of scalar data is to project each cell in a volume ont o the screen . Rasterizing a volume cell is more complex tha n rasterizing a polygon . A method is presented that approximates tetrahedral volume cells with hardware renderabl e transparent triangles . This method produces results wliiel i are visually similar to more exact methods for scalar volum e rendering, but. is faster and has smaller memory requirements . The method is best suited… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
167
0

Year Published

1999
1999
2013
2013

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 250 publications
(172 citation statements)
references
References 15 publications
1
167
0
Order By: Relevance
“…This can be achieved through ray casting (eg, [6]), projecting tetrahedra (eg, [13]), or several other means. Using specific parameters of focal length, detector dimensions, and field of view, DRRs sufficiently represent xray projections and have been used for numerous different procedures, including 2-D/3-D registration and radiotherapy [8,[13][14][15].…”
Section: Methodsmentioning
confidence: 99%
“…This can be achieved through ray casting (eg, [6]), projecting tetrahedra (eg, [13]), or several other means. Using specific parameters of focal length, detector dimensions, and field of view, DRRs sufficiently represent xray projections and have been used for numerous different procedures, including 2-D/3-D registration and radiotherapy [8,[13][14][15].…”
Section: Methodsmentioning
confidence: 99%
“…Shirley et al [12] describe a method for projecting tetrahedrons onto the image plane. The tetrahedrons need to be sorted before projection.…”
Section: Unstructured Mesh Representationmentioning
confidence: 99%
“…The entry position is given by rasterization, but the computation of the exit point is not so straightforward. Hirche used an adaptation of the Projected tetrahedra algorithm by Shirley and Tuchman [ST90], while Wang et al [WTL * 04] computed ray-plane intersections for the current view ray to find the exit point.…”
Section: Thick Surfacesmentioning
confidence: 99%