Cited in
(15)- Lepp-bisection algorithms, applications and mathematical properties
- 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
- Complexity of the bisection method
- On the problem of starting points for iterative methods
- On generalized bisection of 𝑛-simplices
- Properties of triangulations obtained by the longest-edge bisection
- Multithread parallelization of LEPP-bisection algorithms
- On the Shape of Tetrahedra from Bisection
- Improved maximum angle estimate for longest-edge bisection
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- The longest-edge bisection algorithm may produce degenerating tetrahedra
- On the orbits of similarity classes of tetrahedra generated by the longest-edge bisection algorithm.
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
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)
