Geometric folding for cone-tree data compression

Details Geometric folding for cone-tree data compression Geometric folding for cone-tree data compression

2006-05-23

2006-05-23

Zimmerman, Mark (Department: 2671)

Computer graphics processing and selective visual display system

Computer graphics processing

Three-dimension

C345S622000

Reexamination Certificate

active

07050053

ABSTRACT:
A system for performing visible object determination. Visualization software executing on one or more processors searches a cone tree with respect to a hull tree. Both trees respect the same group of transformations. Thus, the cone tree as stored in memory need not store all branches down to ultimate resolution. For example, the cone tree may store a selected cone and all its subcones down to the ultimate resolution, while subcones of other cones at the same level as the selected cone may not be represented in the stored cone tree. When the visualization software encounters a nonstored cone and a given hull H in its search procedure, the visualization software may apply an appropriate one of the group transformations to the given hull, and search the tranformed hull with respect to the selected cone (or a subcone of the selected cone).

REFERENCES:
patent: 6300965 (2001-10-01), Sowizral et al.
patent: 6373485 (2002-04-01), Sowizral et al.
patent: 6437796 (2002-08-01), Sowizral et al.
patent: 6445391 (2002-09-01), Sowizral et al.

Affiliated with

Also associated with

Rating

Geometric folding for cone-tree data compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Geometric folding for cone-tree data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric folding for cone-tree data compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3613567