A strong and easily computable separation bound for arithmetic expressions involving radicals

DOI10.1007/S004530010005zbMath0953.68136OpenAlexW2024331629MaRDI QIDQ1977120

Kurt Mehlhorn, Rudolf Fleischer, Stefan Schirra, Christoph Burnikel

Publication date: 29 January 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010005

zbMATH Keywords

exact geometric computationseparation bound

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

How much precision is needed to compare two sums of square roots of integers?, A separation bound for real algebraic expressions, Constructive root bound for \(k\)-ary rational input numbers, On Isolating Roots in a Multiple Field Extension, Hypergeometric Functions in Exact Geometric Computation, What can we do with a Solution?, Bounding the sum of square roots via lattice reduction, Recent progress in exact geometric computation, On the minimum gap between sums of square roots of small integers, Exact, efficient, and complete arrangement computation for cubic curves, Much Ado about Zero