A Simple and Novel Seed-Set Finding Approach for Iso-Surface Extraction
dc.contributor.author | Hung, Chiang-Han | en_US |
dc.contributor.author | Yang, Chuan-kai | en_US |
dc.contributor.editor | Ken Brodlie and David Duke and Ken Joy | en_US |
dc.date.accessioned | 2014-01-31T06:52:04Z | |
dc.date.available | 2014-01-31T06:52:04Z | |
dc.date.issued | 2005 | en_US |
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 |
dc.description.seriesinformation | EUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualization | en_US |
dc.identifier.isbn | 3-905673-19-3 | en_US |
dc.identifier.issn | 1727-5296 | en_US |
dc.identifier.uri | https://doi.org/10.2312/VisSym/EuroVis05/125-132 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | A Simple and Novel Seed-Set Finding Approach for Iso-Surface Extraction | en_US |
Files
Original bundle
1 - 1 of 1