Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Exact efficient computational geometry made easy. In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG’99), pp. 341–350 (1999)
Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica 27, 87–99 (2000)
Burnikel, C., Mehlhorn, K., Schirra, S.: How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In: Proceedings of the 2nd Annual European Symposium on Algorithms—ESA’94. Lecture Notes in Computer Science, vol. 855, pp. 227–239. Springer, Berlin (1994)
Burnikel, C., Mehlhorn, K., Schirra, S.: The LEDA class real number. Technical report MPI-I-96-1-001, Max-Planck-Institut für Informatik, Saarbrücken (1996)
Canny, J.F.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1987)
Hecke, E.: Vorlesungen über die Theorie der Algebraischen Zahlen. Chelsea, New York (1970)
Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A core library for robust numeric and geometric computation. In: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pp. 351–359. Miami, FL, 1999
LEDA (Library of Efficient Data Types and Algorithms): www.mpi-sb.mpg.de/LEDA/leda.html
Li, C., Yap, C.: A new constructive root bound for algebraic expressions. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’01), pp. 496–505 (2001)
Loos, R.: Computing in algebraic extensions. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra. Symbolic and Algebraic Computation. Computing Supplementum, vol. 4, pp. 173–188. Springer, Vienna (1982)
Mehlhorn, K., Näher, S.: The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Mehlhorn, K., Schirra, S.: Exact computation with leda_real - theory and geometric applications. In: Alefeld, G., Rohn, J., Rumpf, S., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods. Springer, Vienna (2001)
Mignotte, M.: Identification of algebraic numbers. J. Algorithms 3(3), 197–204 (1982)
Mignotte, M.: Mathematics for Computer Algebra. Springer, Berlin (1992)
Neukirch, J.: Algebraische Zahlentheorie. Springer, Berlin (1990)
Scheinerman, E.R.: When close enough is close enough. Am. Math. Mon. 107, 489–499 (2000)
Yap, C.K.: Towards exact geometric computation. Comput. Geom. Theory Appl. 7 (1997)
Yap, C.K.: Fundamental Problems in Algorithmic Algebra. Oxford University Press, Oxford (1999)
Yap, C.K., Dube, T.: The exact computation paradigm. In: Computing in Euclidean Geometry II. World Scientific, Singapore (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473 (ECG—Effective Computational Geometry for Curves and Surfaces).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Burnikel, C., Funke, S., Mehlhorn, K. et al. A Separation Bound for Real Algebraic Expressions. Algorithmica 55, 14–28 (2009). https://doi.org/10.1007/s00453-007-9132-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9132-4