On the Bisection Method for Triangles

DOI10.2307/2007533zbMath0523.65033OpenAlexW4240308494MaRDI QIDQ3673948

Andrew Adler

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2007533

zbMATH Keywords

bisection methodinfinite family of triangles

Mathematics Subject Classification ID

Length, area and volume in real or complex geometry (51M25) Nonlinear algebraic or transcendental equations (65H99)

Related Items

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