View-dependent progressive mesh using non-redundant DAG hierarchy

Authors:
Zhi Zheng;Tony K. Y. Chan
Affiliations:
Nanyang Technological University, Singapore;Nanyang Technological University, Singapore
Venue:
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Year:
2005

Citing 9
Cited 1

Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
View-dependent refinement of progressive meshes

Proceedings of the 24th 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
Efficient implementation of multi-triangulations

Proceedings of the conference on Visualization '98
A stateless client for progressive view-dependent transmission

Proceedings of the sixth international conference on 3D Web technology
Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models

IEEE Transactions on Visualization and Computer Graphics
Truly selective refinement of progressive meshes

GRIN'01 No description on Graphics interface 2001
Level of Detail for 3D Graphics

Level of Detail for 3D Graphics
Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing

IEEE Transactions on Visualization and Computer Graphics

An effective error resilient packetization scheme for progressive mesh transmission over unreliable networks

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a non-redundant DAG hierarchy for view-dependent multiresolution mesh for client-server based online browsing of triangle mesh models. The multiresolution hierarchy and the selectively refined mesh for rendering are two relatively independent units, analogous to the server and the client. The multiresolution hierarchy, which is a DAG of vertex split operations, encodes all the dependent relationships between the vertex splits, so no extra legality checks on the surrounding neighborhood are required before a refinement or simplification operation. The DAG built by our algorithm has no redundant edges. This property can reduce run-time memory cost and time cost. We present a method to incrementally traverse the DAG as the viewing parameters change, and a mesh updating approach that is convenient for triangle budget control.