Local refinement based on the 7-triangle longest-edge partition

DOI10.1016/j.matcom.2009.01.009zbMath1166.65316OpenAlexW2065109398MaRDI QIDQ1025330

Auxiliadora Moreno-González, Alberto Márquez, José P. Suárez, Ángel Plaza

Publication date: 18 June 2009

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/34686

zbMATH Keywords

triangulationnumerical examplessubdivisionmesh refinementlocal refinementskeletonbisectionlongest-edge based algorithms

Mathematics Subject Classification ID

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

Related Items

Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric, A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric diagram and hybrid scheme for triangle subdivision
• A recursive approach to local mesh refinement in two and three dimensions
• Local refinement of simplicial grids based on the skeleton
• Refinement based on longest-edge and self-similar four-triangle partitions
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• Graph-based data structures for skeleton-based refinement algorithms
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Propagation of longest-edge mesh patterns in local adaptive refinement
• On Faster Convergence of the Bisection Method for all Triangles
• Local mesh refinement in 2 and 3 dimensions
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Error Estimates for Adaptive Finite Element Computations
• USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
• The 4-triangles longest-side partition of triangles and linear refinement algorithms