Complexity of the bisection method

DOI10.1016/j.tcs.2007.03.004zbMath1127.68108OpenAlexW2158390333MaRDI QIDQ2381525

Claudio Gutierrez, Maria-Cecilia Rivara, Flavio Gutierrez

Publication date: 18 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.004

zbMATH Keywords

triangulationbisection methodlongest edge bisection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Unnamed Item ⋮ Properties of triangulations obtained by the longest-edge bisection ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric ⋮ Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation ⋮ A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection ⋮ A new trigonometrical algorithm for computing real root of non-linear transcendental equations ⋮ Lepp-bisection algorithms, applications and mathematical properties

Cites Work

• Unnamed Item
• Adaptive refinement of unstructured finite-element meshes
• On the Bisection Method for Triangles
• On Faster Convergence of the Bisection Method for all Triangles
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• A Proof of Convergence and an Error Bound for the Method of Bisection in R n
• COMPUTATIONAL GEOMETRY COLUMN 23