Four-triangles adaptive algorithms for RTIN terrain meshes

DOI10.1016/j.mcm.2008.02.012zbMath1165.65321OpenAlexW1981864985MaRDI QIDQ2390054

Yanyan Li

Publication date: 20 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.02.012

zbMATH Keywords

mesheslongest edgeterrain modeling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric ⋮ Longest-edge \(n\)-section algorithms: properties and open problems

Uses Software

• Metro

Cites Work

• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• Graph-based data structures for skeleton-based refinement algorithms
• Propagation of longest-edge mesh patterns in local adaptive refinement
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• 4--8 Subdivision
• Right-triangulated irregular networks

This page was built for publication: Four-triangles adaptive algorithms for RTIN terrain meshes