| dc.description.abstract | Iso-surface extraction is one of the most important approaches for volume rendering, and iso-contouring is one of the most effective methods for iso-surface extraction. Unlike most other methods having their search domain to be the whole dataset, iso-contouring does its search only on a relatively small subset of the original data-set. This subset, called a seed-set, has the property that every iso-surface must intersect with it, and it could be built at the preprocessing time. When an iso-value is given at the run time, iso-contouring algorithm starts from the intersected cells in the seed-set, and gradually propagates to form the whole iso-surface. As smaller seed-sets offer less cell searching time, most existing iso-contouring algorithms concentrates on how to identify an optimal seed-set. In this paper, we propose a new and linear-time approach for seed-set construction. This presented algorithm could reduce the size of the generated seed-sets by up to one or two orders of magnitude, compared with other previously proposed fast (linear time) algorithms. | en_US |
