On the Bisection Method for Triangles

DOI10.2307/2007533MaRDI QIDQ3673948zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

This page was built for publication: On the Bisection Method for Triangles

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