The storage independent polygonal mesh simplification system

Authors:
Hung-Kuang Chen;Chin-Shyurng Fahn;Ming-Bo Lin
Affiliations:
Dept. of Electronic Engineering, National Chin-Yi University of Technology, Taichung, Taiwan, ROC;Dept. of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C;Dept. of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C
Venue:
ICVR'07 Proceedings of the 2nd international conference on Virtual reality
Year:
2007

Citing 10
Cited 0

Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd 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
Out-of-core simplification of large polygonal models

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Hierarchical geometric models for visible surface algorithms

Communications of the ACM
A memory insensitive technique for large model simplification

Proceedings of the conference on Visualization '01
A multiphase approach to efficient surface simplification

Proceedings of the conference on Visualization '02
Evaluation of Memoryless Simplification

IEEE Transactions on Visualization and Computer Graphics
WSCLOCK—a simple and effective algorithm for virtual memory management

SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Level of Detail for 3D Graphics

Level of Detail for 3D Graphics
A Linear Time Algorithm for High Quality Mesh Simplification

ISMSE '04 Proceedings of the IEEE Sixth International Symposium on Multimedia Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional simplification algorithms operate either in the main memory or in the disk space. In this paper, we propose a novel storage independent polygonal mesh simplification system (SIPMSS). The new system offers an advanced memory utilization scheme and efficient storage-independent primitives that achieve constant main memory footprint and excellent runtime efficiency. It not only provides a very flexible platform for both in-core and out-of-core simplification algorithms but also permits very efficient integration of various types of simplification algorithms. The results presented in the section of experiments further approve its effectiveness and usefulness for both in-core and out-of-core of simplification.