Loading…

Iterative Method for Edge Length Equalization

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 ne...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science 2013, Vol.18, p.481-490
Main Authors: Peçanha, J.P., Filho, J.L. Souza, Vieira, M.B., Lobosco, M., Dantas, S.O.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2013.05.212