Advertisement

Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersurface

  • Joos Heintz
  • Marie-Francoise Roy
  • Pablo Solernó
Submitted Contributions Computational Algebra And Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)

Abstract

Let V be a bounded semialgebraic hypersurface defined by a regular polynomial equation and let x1, x 2 be two points of V. Assume that x 1 , x 2 are given by a boolean combination of polynomial inequalities. We describe an algorithm which decides in single exponential sequential time and polynomial parallel time whether x 1 and x 2 are contained in the same semialgebraically connected component of V. If they do, the algorithm constructs a continuous semialgebraic path of V connecting x 1 and x 2 . By the way the algorithm constructs a roadmap of V. In particular we obtain that the number of semialgebraically connected components of V is computable within the mentioned time bounds.

Keywords

Transfer Principle Parallel Complexity Real Closed Field Semialgebraic Subset Quantifier Free Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCR]
    Bochnak J., Coste M., Roy M.-F.: Géométrie algébrique réelle. Springer Verlag (1987).Google Scholar
  2. [C 1]
    Canny J: Some algebraic and geometric computations in PSPACE. ACM Symptosium on the theory of computation, 460–467 (1988).Google Scholar
  3. [C 2]
    Canny J.: The complexity of motion planning. M.I.T. Thesis 1986, M.I.T. Press (1988).Google Scholar
  4. [C 3]
    Canny J.: A new algebraic method for robot motion planning and real geometry. Proc. 28th IEEE Symp. on Found. of Comp. Science (FOCS), 39–48 (1987).Google Scholar
  5. [CGV]
    Canny J., Grigor'ev D., Vorobjov N.: Defining connected components of a semialgebraic set in subexponential time. Manuscript Steklov Mathematical Inst., Leningrad, LOMI (1990).Google Scholar
  6. [CR]
    Coste M., Roy M.-F.: Thom's lemma, the coding of real algebraic numbers and the topology of semialgebraic sets. J. Symbolic Computation 5, 121–129 (1988).Google Scholar
  7. [FGM]
    Fitchas N., Galligo A., Morgenstern J.: Algorithmes rapides en séquentiel et en parallèle pour l'élimination des quantificateurs en géométrie élémentaire. Sém. Structures Algébriques Ordonnées, Sélection d'exposés 1984–1987 Vol I. Publ. Univ. Paris VII, No. 32, 29–35 (1990).Google Scholar
  8. [Ga]
    von zur Gathen J.: Parallel arithmetic computations; a survey. Proc. 13th Conf. MFCS (1986).Google Scholar
  9. [G]
    Grigor'ev D.: Complexity of deciding Tarski algebra. J. Symbolic Computation 5, 65–108 (1988).Google Scholar
  10. [GV 1]
    Grigor'ev D., Vorobjov N.: Solving systems of polynomial inequalities in subexponential time. J. Symbolic Computation 5, 37–64 (1988).Google Scholar
  11. [GV 2]
    Grigor'ev D., Vorobjov N.: Counting connected components of a semialgebraic set in subexponential time. Manuscript Steklov Mathematica Inst., Leningrad, LOMI (1990).Google Scholar
  12. [GHRSV]
    Grigor'ev D., Heintz J., Roy M.-F., Solernó P., Vorobjov N.: Comptage des composantes connexes d'un ensemble semi-algébrique en temps simplement exponentiel. To appear in C.R. Acad. Sci. Paris.Google Scholar
  13. [HRS 1]
    Heintz J., Roy M.-F., Solernó P.: On the complexity of semialgebraic sets. Proc. IFIP'89, 293–298 (1989).Google Scholar
  14. [HRS 2]
    Heintz J., Roy M.-F., Solernó P.: Complexité du principe de Tarski-Seidenberg. Comptes Rendus de l'Acad. de Sciences Paris, 309, 825–830 (1989).Google Scholar
  15. [HRS 3]
    Heintz J., Roy M.-F., Solernó P.: Sur la complexité du principe de Tarski-Seidenberg. Bulletin de la Soc. Math. de France 118, 101–126 (1990).Google Scholar
  16. [HRS 4]
    Heintz J., Roy M.-F., Solernó P.: Construction de chemins dans un ensemble semi-algébrique (II). Preprint (1990).Google Scholar
  17. [HKRS]
    Heintz J., Krick T., Roy M.-F., Solernó P.: Geometric problems solvable in single exponential time. Preprint (1990).Google Scholar
  18. [R]
    Renegar J.: On the computational complexity and geometry of the first order theory of the reals. Technical Report 856, Cornell Univ. (1989).Google Scholar
  19. [RS]
    Roy M.-F., Szpirglas A.: Sign determination on 0-dimensional sets. To appear in Proc. MEGA'90, Castiglioncello (1990).Google Scholar
  20. SS.
    Schwartz J., Sharir M.: On the piano movers' problem: II General Techniques for calculating topological properties of real algebraic manifolds. Adv. Appl. Math. 298–351 (1983).Google Scholar
  21. [S 1]
    Solernó P.: Complejidad de conjuntos semialgebraicos. Thesis Univ. de Buenos Aires (1989).Google Scholar
  22. [S 2]
    Solernó P.: Construction de fonctions de Morse pour une hypersurface régulière en temps admissible. Preprint (1990).Google Scholar
  23. [T]
    Trotman D.: On Canny's roadmap algorithm: orienteering in semialgebraic sets. Manuscript Univ. Aix-Marseille (1989).Google Scholar
  24. [VSBR]
    Valiant L., Skyum S., Berkowitz S., Rackoff C.: Fast parallel computation of polynomials using few processors. SIAM J. Comp. 12, 641–644 (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Joos Heintz
    • 2
    • 3
  • Marie-Francoise Roy
    • 1
  • Pablo Solernó
    • 2
    • 3
  1. 1.IRMAR. Université de Rennes IRennes CedexFrance
  2. 2.Working Group Noaï Fitchas. Instituto Argentino de Matemática CONICETBuenos AiresArgentina
  3. 3.Facultad de Ciencias Exactas y Naturales. Dpto. de Matemática (Univ. de Buenos Aires)Ciudad UniversitariaArgentina

Personalised recommendations