DUAL ADAPTIVE PATHS FOR MULTIRESOLUTION HIERARCHIES

Abstract

The recent increase in the generated polygonal dataset sizes has outpaced the performance of graphics hardware. Several solutions such as multiresolution hierarchies and level-of-detail rendering have been developed to bridge the increasing gap. However, the discrete levels of detail generate annoying popping effects, the preliminaries multiresolution schemes cannot perform drastic changes on the selected level of detail within the span of small number of frames, and the current cluster-based hierarchies suffer from the high-detailed representation of the boundaries between clusters. In this paper, we are presenting a novel approach for multiresolution hierarchy that supports dual paths for run-time adaptive simplification — fine and coarse. The proposed multiresolution hierarchy is based on the fan-merge operator and its reverse operator fan-split. The coarse simplification path is achieved by directly applying fan-merge/split, while the fine simplification route is performed by executing edge-collapse/vertex-split one at a time. The sequence of the edge-collapses/vertex-splits is encoded implicitly by the order of the children participating in the fan-merge/split operator. We shall refer to this multiresolution hierarchy as fan-hierarchy. Fan-hierarchy provides a compact data structure for multiresolution hierarchy, since it stores 7/6 pointers, on the average, instead of 3 pointers for each node. In addition, the resulting depth of the fan-hierarchy is usually smaller than the depth of hierarchies generated by edge-collapse based multiresolution schemes. It is also important to note that fan-hierarchy inherently utilizes fan representation for further acceleration of the rendering process.