carrier image

A Study on Size-Optimal Longest Edge Refinement Algorithms

Bedregal, Carlos and Maria-Cecilia Rivara

21st International Meshing Roundtable, Springer-Verlag, pp.121-136, October 7-10 2012

IMR
PROCEEDINGS

21st International Meshing Roundtable
San Jose, CA
October 7-10,2012

Department of Computer Science, University of Chile
Email: cbedrega@dcc.uchile.cl

Summary
Mesh generation and refinement are widely used in applications that require a decomposition of geometric objects for processing. Longest edge refinement algorithms seek to obtain a better decomposition over selected regions of the mesh by the division of its elements. Until now, these algorithms did not provide theoretical guarantees on the size of the triangulation obtained. In this paper we present a study of the computational cost of longest edge bisection algorithms for 2-dimensional mesh refinement and our developments in the theoretical analysis of such algorithms.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article