Pages that link to "Item:Q3673948"

The following pages link to On the Bisection Method for Triangles (Q3673948):

Displaying 13 items.

• Properties of triangulations obtained by the longest-edge bisection (Q403206) (← links)
• Multithread parallelization of LEPP-bisection algorithms (Q412318) (← links)
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686) (← links)
• Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
• On the non-degeneracy property of the longest-edge trisection of triangles (Q969154) (← links)
• Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
• On global and local mesh refinements by a generalized conforming bisection algorithm (Q1959467) (← links)
• A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection (Q2229910) (← links)
• Complexity of the bisection method (Q2381525) (← links)
• On the problem of starting points for iterative methods (Q2424042) (← links)
• On generalized bisection of 𝑛-simplices (Q3127327) (← links)
• On the Shape of Tetrahedra from Bisection (Q4305978) (← links)
• Improved Maximum Angle Estimate for Longest-Edge Bisection (Q5104664) (← links)