Open AccessIterative Method for Edge Length Equalization
Author(s) -
João Paulo Peçanha,
J.L. Souza Filho,
Marcelo Bernardes Vieira,
Marcelo Lobosco,
Simone Dantas
Publication year - 2013
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2013.05.212
Subject(s) - computer science , enhanced data rates for gsm evolution , surface (topology) , algorithm , topology (electrical circuits) , manifold (fluid mechanics) , triangle mesh , grid , process (computing) , geometry , polygon mesh , mathematics , computer vision , combinatorics , computer graphics (images) , mechanical engineering , engineering , operating system
This paper presents a method for triangular surface remeshing to obtain new faces whose edge lengths are as close as possible to a target value m. The process uses as input a 2-manifold mesh with arbitrary geometry and topology. The proposed algorithm runs iteratively, automatically adjusting the necessary amount of vertices, and applies a global relaxation process using a variation of Laplace-Beltrami discrete operator. We introduce geometry constraints in order to preserve salient features of the original model. The method results on a grid with edge lengths near to m with low standard deviation, i.e. the vertices are uniformly distributed over the original surface. The dual space of the final triangular surface results in a trivalent, mostly hexagonal mesh, suitable for several applications
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom