On the Bisection Method for Triangles
From MaRDI portal
Publication:3673948
DOI10.2307/2007533zbMATH Open0523.65033OpenAlexW4240308494MaRDI QIDQ3673948FDOQ3673948
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/2007533
Length, area and volume in real or complex geometry (51M25) Nonlinear algebraic or transcendental equations (65H99)
Cited In (13)
- Properties of triangulations obtained by the longest-edge bisection
- On the Shape of Tetrahedra from Bisection
- Multithread parallelization of LEPP-bisection algorithms
- Improved Maximum Angle Estimate for Longest-Edge Bisection
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
- Lepp-bisection algorithms, applications and mathematical properties
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Complexity of the bisection method
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
- On generalized bisection of 𝑛-simplices
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- On the problem of starting points for iterative methods
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)
