Computer graphics processing and selective visual display system – Computer graphics processing – Three-dimension
Reexamination Certificate
2000-02-24
2003-09-30
Padmanabhan, Mano (Department: 2671)
Computer graphics processing and selective visual display system
Computer graphics processing
Three-dimension
C345S424000
Reexamination Certificate
active
06628281
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates generally to an improved data processing system and in particular to a method and a system for improving display of three dimensional objects. Still more particularly, the present invention provides a method to calculate the intersection of a bounding volume with a plane parallel to the front of the screen at a specified depth.
2. Description of the Related Art
Realistic 3D rendering of images is critically important in many computer applications. Volume rendering via texture mapping requires the calculation of the intersection of a series of screen-aligned planes with a bounding volume. This volume rendering is accomplished by computing which halfspace of each side of the bounding volume a vertex of a polygon lies and then computing the intersection of the planes which lie in the inner halfspaces of the bounding volumes. The problem of computing the intersection of a plane with a bounding volume with the least computationally expensive algorithm is key to determining the set of polygons that must be texture mapped and composited in the graphics frame buffer to render volumetric data.
Therefore, it would be advantageous to have a method and system to minimize the floating point computation needed to perform volume rendering via texture mapping.
SUMMARY OF THE INVENTION
Apparatus and methods are provided to perform volume rendering via composited texture-mapped convex polyhedra. This is accomplished by generating a sequence of z polygons defined by the intersection of a sequence of z planes parallel to the view plane with the convex polyhedron. The vertices of the convex polyhedron are numbered sequentially based on z-axis depth and this defines a sequence of slabs that are bounded by z planes intersecting the vertices. The edges of the convex polyhedron are numbered based on viewing the polyhedron along an axis from the closest vertex to the furthest vertex.
A data structure maintains a list of active edges for each slab, where an edge is “active” if the edge intersects any z plane in the slab. Each vertex in the z polygon is defined by the intersection of an active edge with the z plane. The z polygon is rendered by connecting adjacent vertices, where the ordering is determined by the order of the active edges in the slab. Each edge of the z polygon can be rendered by performing only three multiplications, two additions, and one subtraction. These computationally efficient methods make volume rendering via texture mapping feasible.
REFERENCES:
patent: 5113490 (1992-05-01), Winget
patent: 5574835 (1996-11-01), Duluk et al.
patent: 5630039 (1997-05-01), Fossum
patent: 6285779 (2001-09-01), Lapidous et al.
patent: 6480205 (2002-11-01), Greene et al.
Angel (Interactive Computer Graphics: A top-down Approach: 1997: ISBN 0-201-85571-2).
D'Amora Bruce
Fossum Gordon C.
McBurney Mark E.
Padmanabhan Mano
Walder, Jr. Stephen J.
Yee Duke W.
LandOfFree
Method and system for computing the intersection of a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for computing the intersection of a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for computing the intersection of a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3044266