Parallel Implementation of Mesh Simplification on a Beowulf Cluster

The parallel implementation of a novel mesh simplification method is introduced detailedly in this paper, which is based on a Beowulf cluster system. Taking full advantage of the distributed memory and high performance network, we can simplify out-of-core models quickly and avoid thrashing the virtual memory system. In addition, the file I/O and load balancing are also considered to make sure a near optimal utilization of the computational resources as well as obtaining high quality output. A set of numerical experiments have demonstrated that our parallel implementation can not only reduce the execution time greatly but also obtain higher parallel efficiency.

[1]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[2]  Michael Garland,et al.  Efficient adaptive simplification of massive meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[3]  Lu Yongquan,et al.  A New Adaptive Mesh Simplification Method Using Vertex Clustering with Topology-and-Detail Preserving , 2008, 2008 International Symposium on Information Science and Engineering.

[4]  Bo Li,et al.  Simplification Algorithm for Large Polygonal Model in Distributed Environment , 2007, ICIC.

[5]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[6]  Jan Bækgaard Pedersen,et al.  A parallel framework for simplification of massive meshes , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[7]  Michael Mikolajczak,et al.  Designing And Building Parallel Programs: Concepts And Tools For Parallel Software Engineering , 1997, IEEE Concurrency.

[8]  Jintao Wang,et al.  Parallel adaptive simplification of massive meshes , 2009, 2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics.

[9]  Peter Lindstrom,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[10]  Jan Bækgaard Pedersen,et al.  Parallel Model Simplification of Very Large Polygonal Meshes , 2002, PDPTA.

[11]  Jonathan Schaeffer,et al.  On the Versatility of Parallel Sorting by Regular Sampling , 1993, Parallel Comput..

[12]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.