An Adaptive Sampling Scheme for Out-of-Core Simplification
| dc.contributor.author | Fei, Guangzheng | en_US |
| dc.contributor.author | Cai, Kangying | en_US |
| dc.contributor.author | Guo, Baining | en_US |
| dc.contributor.author | Wu, Enhua | en_US |
| dc.date.accessioned | 2015-02-16T07:23:19Z | |
| dc.date.available | 2015-02-16T07:23:19Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.abstract | Current out-of-core simplification algorithms can efficiently simplify large models that are too complex to be loaded in to the main memory at one time. However, these algorithms do not preserve surface details well since adaptive sampling, a typical strategy for detail preservation, remains to be an open issue for out-of-core simplification. In this paper, we present an adaptive sampling scheme, called the balanced retriangulation (BR), for out-of-core simplification. A key idea behind BR is that we can use Garland's quadric error matrix to analyze the global distribution of surface details. Based on this analysis, a local retriangulation achieves adaptive sampling by restoring detailed areas with cell split operations while further simplifying smooth areas with edge collapse operations. For a given triangle budget, BR preserves surface details significantly better than uniform sampling algorithms such as uniform clustering. Like uniform clustering, our algorithm has linear running time and small memory requirement. | en_US |
| dc.description.number | 2 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 21 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.00571 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 111-118 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.00571 | en_US |
| dc.publisher | Blackwell Publishers Ltd and the Eurographics Association | en_US |
| dc.title | An Adaptive Sampling Scheme for Out-of-Core Simplification | en_US |