Digital Library

cab1

 
Title:      COMPUTATIONAL COST OF GNG3D ALGORITHM FOR MESH SIMPLIFICATION
Author(s):      Rafael Álvarez , José Noguera , Leandro Tortosa , Antonio Zamora
ISBN:      978-972-8924-30-0
Editors:      Piet Kommers and Pedro Isaías
Year:      2007
Edition:      Single
Keywords:      Mesh simplification, polygonal reduction, computational cost, neural networks
Type:      Full Paper
First Page:      75
Last Page:      82
Language:      English
Cover:      cover          
Full Contents:      click to dowload Download
Paper Abstract:      In this paper we present a study of the computational cost of the GNG3D algorithm for mesh optimization. This algorithm has been implemented taking as a basis a new method which is based on neural networks and consists on two differentiated phases: an optimization phase and a reconstruction phase. The optimization phase is developed applying an optimization algorithm based on the Growing Neural Gas model, which constitutes an unsupervised incremental clustering algorithm. The primary goal of this phase is to obtain a simplified set of vertices representing the best approximation of the original 3D object. In the reconstruction phase we use the information provided by the optimization algorithm to reconstruct the faces thus obtaining the optimized mesh. The computational cost of both phases is calculated, showing some examples.
   

Social Media Links

Search

Login