Article ID Journal Published Year Pages File Type
10336962 Computers & Graphics 2011 14 Pages PDF
Abstract
▶ A real-time greedy algorithm to perform an incremental, error-guided update of the cut though a multi-resolution volume representation. ▶ A new optimal polynomial-time cut update algorithm for multi-resolution volume rendering. ▶ For very large volumes our compatible out-of-core support maintains an extended cut in main memory, which serves as a cache for the cut on the graphics card.
Related Topics
Physical Sciences and Engineering Computer Science Computer Graphics and Computer-Aided Design
Authors
, ,