The complexity of robot motion planning
The complexity of robot motion planning
Mathematics for computer algebra
Mathematics for computer algebra
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Efficient exact geometric computation made easy
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A core library for robust numeric and geometric computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A new constructive root bound for algebraic expressions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
High-Level Filtering for Arrangements of Conic Arcs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
The diamond operator: implementation of exact real algebraic numbers
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Exact medial axis computation for circular arc boundaries
Proceedings of the 7th international conference on Curves and Surfaces
| Hi-index | 0.00 |
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k- th root operations for integral k, and taking roots of polynomials whose coefficients are given by the values of subexpressions.We consider the sign computation of real algebraic expressions, a task vital for the implementation of geometric algorithms. We prove a new separation bound for real algebraic expressions and compare it analytically and experimentally with previous bounds. The bound is used in the sign test of the number type leda_real.