Skip to main content
SpringerLink
Log in

Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General Case

  • Chapter
Algebraic Geometry and its Applications

Abstract

This paper is devoted to the following result. Let S be a semi-algebraic subset of R n ; one can decide in single exponential time whether two points of S belong to the same semi-algebraically connected component of S, and if they do, one can find a semi-algebraic path connecting them. This paper is the sequel to [HRS 4] in which the result is proved in the particular but fundamental case of a bounded regular hypersurface.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bochnak J., Coste M., Roy M.-F.: Géométrie algébrique réelle. Springer Verlag (1987).

    MATH  Google Scholar 

  2. Canny J.: Some algebraic and geometric computations in PSPACE. ACM Symposium on the theory of computation, 460–467 (1988).

    Google Scholar 

  3. Canny J.: The complexity of robot motion planning. MIT Press(1989)

    Google Scholar 

  4. Canny J., Grigor’ev D. Yu., Vorobjov N. N. (jr): Defining connected components of a semi-algebraic set in subexponential time. Manuscript LOMI Steklov Institute of Leningrad (1990).

    Google Scholar 

  5. Collins G.: Quantifier elimination for real closed fields by cylindric algebraic decomposition. Second GI Conference on Automata Theory and Formal Languages. Lecture Notes in Computer Sciences, vol. 33, pp. 134–183, Springer-Verlag, Berlin (1975).

    Google Scholar 

  6. von zur Gathen J.: Paralel arithmetic computations: a survey. Proc. 13 th Conf. MFCS (1986).

    Google Scholar 

  7. Grigor’ev D. Yu.: Complexity of deciding Tarski algebra. J. Symbolic Computation 5 (1988) 65–108.

    Article  MathSciNet  MATH  Google Scholar 

  8. Grigor’ev D. Yu, Heintz J., Roy M.-F., Solernó P., Vorobjov N. N. (jr): Comptage des composantes connexes d’un ensemble semi-algébrique en temps simplement exponentiel. C. R. Acad. Sci. Paris 312 (1990) 879–882.

    Google Scholar 

  9. Grigor’ev D. Yu., Vorobjov N. N. (jr): Solving systems of polynomial inequalities in subexponential time. J. Symbolic Computation 5 (1988) 37–64.

    Article  MathSciNet  MATH  Google Scholar 

  10. Grigor’ev D. Yu., Vorobjov N. N. (jr): Counting connected components of a semi-algebraic set in subexponential time. Manuscrit LOMI (1989). Submitted to Computational Complexity.

    Google Scholar 

  11. Heintz J., Krick T., Roy M.-F., Solernó P.: Single exponential time algorithms for basic constructions in elementary geometry. Invited Lecture AAECC’8 Tokyo (1990).

    Google Scholar 

  12. Heintz J., Roy M.-F., Solernó P.: On the complexity of semi-algebraic sets. Proc. IFIP San Francisco. North-Holland (1989) 293–298.

    Google Scholar 

  13. Heintz J., Roy M.-F., Solernó P.: Complexité du principe de Tarski-Seidenberg. Compte-Rendus de l’Académie des Sciences Paris. 309 (1989) 825–830.

    MATH  Google Scholar 

  14. Heintz J., Roy M.-F., Solernô P.: Sur la complexité du principe de Tarski-Seidenberg. Bull. Soc. math. France, 118 (1990) 101–126.

    MathSciNet  MATH  Google Scholar 

  15. Heintz J., Roy M.-F., Solernó P.: Single exponential path finding in semi-algebraic sets: Part I: The case of a regular bounded hypersurface. Part II 465 Proc. AAECC-8 Tokyo (1990).

    Google Scholar 

  16. Heintz J., Roy M.-F., Solerno P.: Description of connected components of semi-algebraic sets in single exponential time. Manuscript (1990)

    Google Scholar 

  17. Renegar J.: On the computational complexity and geometry of the first order theory of the reals. Technical Report 856, Cornell University Ithaca (1989). Submitted to Journal of Symbolic Computation.

    Google Scholar 

  18. Solerno P.: Effective Lojasiewicz inequalities. To appear in AAECC (1990).

    Google Scholar 

  19. Schwartz J., Sharir M.: On the “piano movers” problem II. General techniques for computing topological properties of real algebraic manifolds. Adv. Applied Math. 4, 298–351 (1983).

    Article  MathSciNet  MATH  Google Scholar 

  20. Walker R.: Algebraic curves. Princeton University Press (1950).

    MATH  Google Scholar 

Download references

Authors
  1. Joos Heintz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marie-Francoise Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pablo Solerno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA

    Chandrajit L. Bajaj

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Heintz, J., Roy, MF., Solerno, P. (1994). Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General Case. In: Bajaj, C.L. (eds) Algebraic Geometry and its Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2628-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2628-4_28

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7614-2

  • Online ISBN: 978-1-4612-2628-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation