A Simple and Novel Seed-Set Finding Approach for Iso-Surface Extraction

Hung, Chiang-Han; Yang, Chuan-kai

A Simple and Novel Seed-Set Finding Approach for Iso-Surface Extraction

Files

125-132.pdf (161.91 KB)

Date

2005

Authors

Hung, Chiang-Han
Yang, Chuan-kai

Publisher

The Eurographics Association

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.

        @inproceedings{:10.2312/VisSym/EuroVis05/125-132
,
booktitle = {EUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualization
},
editor = {Ken Brodlie and David Duke and Ken Joy
},
title = {{A Simple and Novel Seed-Set Finding Approach for Iso-Surface Extraction
}},
author = {Hung, Chiang-Han and 
Yang, Chuan-kai
},
year = {2005
},
publisher = {The Eurographics Association
},
ISSN = {1727-5296
},
ISBN = {3-905673-19-3
},
DOI = {/10.2312/VisSym/EuroVis05/125-132
}
}