A Distributed Simplification Method


Yoshida, Y., Konno, K. and Tokuyama, Y., A Distributed Simplification Method with PC Cluster, Society for Art and Science, Vol.7, No.3, pp.113-123, (2008)D

Abstract:
Simplification algorithm of 3D model is basic, important technology that can reduce the redundancy of the expanding 3D shape data, and that can apply to various applications. The QEM method is given as an algorithm to simplify data while preserving the feature of 3D model. The QEM method is one of the algorithms with the best balance between details and the simplification speed after the vertex is degenerated. However, because the QEM method is a successive algorithm that can delete only one edge at a time, it takes time for simplification of the huge 3D models. PC cluster is one of the environment that can enlarge computational resources with uniting many PCs. It is constructed easily and used generally. In this paper, it proposes the method made parallel by extending the QEM method, and using the PC cluster. With the PC cluster constructed by typical windows PCs, simplification high-speed by this method becomes possible while maintaining the feature of 3D model.




ExampleP

(a) 3D model (b) segmentation (c) 3D shape data
(d) first simplification (e) second simplification (f) result



ExampleQ

(a) 3D model (b) segmentation (c) 3D shape data
(d) first simplification (e) second simplification (f) result



`s@sngnjt@QOOV

`s@sngnjt@QOOT