Triangulation refinement by using edge subdivision

DOI10.3103/S1063454109020071MaRDI QIDQ735608zbMATH OpenOpenAlexFDO

Authors N. A. Lebedinskaya, D. M. Lebedinskiĭ

Publication date 23 October 2009

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1063454109020071

zbMATH Keywords

triangulationrefinementsubdivision

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• Properties of triangulations obtained by the longest-edge bisection
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

Cites work

• Multiple-scale decomposition for the Zlamal approximation

Cited in

(4)

• Golden triangulations
• On recursive refinement of convex polygons
• The limit property for the interior solid angles of some refinement schemes for simplicial meshes
• scientific article; zbMATH DE number 66959 (Why is no real title available?)

This page was built for publication: Triangulation refinement by using edge subdivision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735608)