Simplification algorithm for large polygonal model in distributed environment

Authors:
Xinting Tang;Shixiang Jia;Bo Li
Affiliations:
Department of Computer Science and Technology, Ludong University, Yantai, P.R. China;Department of Computer Science and Technology, Ludong University, Yantai, P.R. China;Department of Computer Science and Technology, Ludong University, Yantai, P.R. China
Venue:
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Year:
2007

Citing 5
Cited 0

Mesh optimization

SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Simplification envelopes

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
Interactive out-of-core isosurface extraction

Proceedings of the conference on Visualization '98
Out-of-core simplification of large polygonal models

Proceedings of the 27th annual conference on Computer graphics and interactive techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polygonal models have grown rapidly in complexity over recent years, yet most conventional simplification algorithms were designed to handle modest size datasets of a few tens of thousands of triangles. We present a parallel simplification method for large polygonal models. Our algorithm will partition the original model firstly, send each portion to a slave processor, simplify them concurrently, and merge them together lastly. We give an efficient method to deal with the problem of partition border and portion merging. With parallel implementation, the algorithm can handle extremely large data set, and speed up the execution time. Experiment shows that our algorithm can produce approximations of high quality.