Mesh graph structure for longest-edge refinement algorithms

Proceedings, 7th International Meshing Roundtable, Sandia National Lab, pp.335-344, October 1998

MESHING
RESEARCH
CORNER

7th International Meshing Roundtable
October 26-28, 1998
Dearborn, Michigan, USA

Department of Mathematics.
Universizy of Las Palmas de Gran Canaria. Spain
Email: {angel,jsuarez,mpadron}@aries.dma.ulpgc.es

Abstract
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be used to reformulate longest-edge algorithms to develop new algorithms and to design efficient data structures for the refinement/derefinement of 2D and 3D triangulations.

Download Full Paper (Postscript Format)