Computational Real Algebraic Geometry

Computational real algebraic geometry studies various algorithmic questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by the power and elegance with which it solves a broad and general class of problems arising in robotics, vision, computer aided design, geometric theorem proving, etc. The following survey paper discusses the underlying concepts, algorithms and a series of representative applications. This paper will appear as a chapter in the "Handbook of Discrete and Computational Geometry" (Edited by J.E. Goodman and J. O''Rourke), CRC Series in Discrete and Combinatorial Mathematics.

[1]  James H. Davenport,et al.  Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..

[2]  Nicolai Vorobjov,et al.  Counting connected components of a semialgebraic set in subexponential time , 1992, computational complexity.

[3]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[4]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[5]  J. Risler,et al.  Real algebraic and semi-algebraic sets , 1990 .

[6]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[7]  Bernard Chazelle,et al.  Computational geometry: a retrospective , 1994, STOC '94.

[8]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[9]  Dima Grigoriev,et al.  Complexity of Deciding Tarski Algebra , 1988, J. Symb. Comput..

[10]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[11]  Tomás Recio,et al.  Algorithms in Real Algebraic Geometry and Applications to Computational Geometry , 1990, Discrete and Computational Geometry.

[12]  Joos Heintz,et al.  Sur la complexité du principe de Tarski-Seidenberg , 1989 .

[13]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[14]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[15]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[16]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[17]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[18]  S. Basu,et al.  A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials , 1998 .

[19]  John F. Canny.  Improved Algorithms for Sign Determination and Existential Quantifier Elimination , 1993, Comput. J..

[20]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[21]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.

[22]  J. Renegar.  Recent Progress on the Complexity of the Decision Problem for the Reals , 1990, Discrete and Computational Geometry.

[23]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.