Simplification of 3D triangular Mesh for level of detail computation

Ng, Kok Why and Low, Zhi Wen (2014) Simplification of 3D triangular Mesh for level of detail computation. In: 2014 11th International Conference on Computer Graphics, Imaging and Visualization (CGIV). IEEE, pp. 11-16. ISBN 978-1-4799-5720-0

Full text not available from this repository.
Official URL: http://www.computer.org/csdl/proceedings/cgiv/2014...

Abstract

Advance three-dimensional (3D) scanning devices can create very detail complex 3D polygonal models. Though the random access memory (RAM) and parallel computing in graphics card are enormously improved, many modelers still confront with intricacy of slow computing due to exponential increase of number of polygons for realistic look of surface models. In this paper, a simple and fast triangular mesh simplification method based on half-edge collapsed scheme is proposed. The Euclidean distance of each triangle edges and the disparity between two adjacent triangles are computed for decimation validation. The to-be-collapsed vertices and edges are conducted in priority queue data structure. The empirical results show that the proposed simplified model shape is well-preserved and is computation efficient. Two existing popular methods (FMLOD and FSIMP) are to be compared with the proposed method and the result demonstrates a rational outcome and is comparable in visual quality.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science > QA76.75-76.765 Computer software
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 06 Apr 2015 05:01
Last Modified: 06 Apr 2015 05:01
URI: http://shdl.mmu.edu.my/id/eprint/6149

Actions (login required)

View Item View Item