Pages that link to "Item:Q2381525"
From MaRDI portal
The following pages link to Complexity of the bisection method (Q2381525):
Displaying 11 items.
- Properties of triangulations obtained by the longest-edge bisection (Q403206) (← links)
- Multithread parallelization of LEPP-bisection algorithms (Q412318) (← links)
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric (Q905319) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection (Q2229910) (← links)
- Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation (Q3296621) (← links)
- (Q4035584) (← links)
- (Q4984904) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)
- (Q5506446) (← links)
