SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
A Survey of Polygonal Simplification Algorithms
A Survey of Polygonal Simplification Algorithms
| Hi-index | 0.00 |
Polygonal model simplification algorithms take a full-sized polygonal model as input and output a less-detailed version of the model with fewer polygons. When the internal data structures for the input model are larger than main memory, many simplification algorithms suffer from poor performance due to paging.We present a case study of the recently-introduced R-Simp algorithm and how its data locality and performance can be substantially improved through an off-line spatial sort and an on-line reorganization of its internal data structures. When both techniques are used, R-Simp's performance improves by up to 7-fold. We empirically characterize the data-access pattern of R-Simp and present an application-specific metric, called cluster pagespan, of R-Simp's locality of memory reference.