Mesh Graph Structure for Longest-Edge Refinement Algorithms

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. Keywords. Longest-edge refinement, bisection, data structures, improvement.

• Type: Conference
• Year: 1998
• Where: IMR
• Authors: Angel Plaza, José P. Suárez, Miguel A. Padron
• Keywords: Algorithms, Computational Geometry, Data Structures, IMR 1998, Longest-edge Algorithms