Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

IMR
1998
Springer

favoriteEmaildiscussreport

113views Computational Geometry» more IMR 1998»

Mesh Graph Structure for Longest-Edge Refinement Algorithms

13 years 8 months ago

Mesh Graph Structure for Longest-Edge Refinement Algorithms

Download www.gi.ulpgc.es

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.

Angel Plaza, José P. Suárez, Miguel

Real-time Traffic

Algorithms | Computational Geometry | Data Structures | IMR 1998 | Longest-edge Algorithms |

claim paper

Related Content

» Mesh Refinement Based on the 8Tetrahedra Longest Edge Partition

» Mesh quality improvement and other properties in the fourtriangles longestedge partition

» GPU Algorithms for Diamondbased Multiresolution Terrain Processing

» An Efficient Query Structure for Mesh Refinement

» Isodiamond Hierarchies An Efficient Multiresolution Representation for Isosurfaces and Int...

» A Flexible Kernel for Adaptive Mesh Refinement on GPU

» Localized Delaunay Refinement for Sampling and Meshing

» Viewdependent refinement of progressive meshes

» The Refined Process Structure Tree

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	IMR
Authors	Angel Plaza, José P. Suárez, Miguel A. Padron

Comments (0)