Abstract
In this paper we describe an algorithm of construction of a roadmap for a compact semi-algebraic setS ⊂ Rn, which is similar to the algorithm of [3], but which is simpler in the sense that it does not need the use of Whitney stratifications, and more general because it accepts as input any compact semi-algebraic set. The complexity of this algorithm is measured in terms of the numberk of polynomials definingS, their maximum degreed, and the number of variablesn. With respect to those measures, our algorithm runs in time\(\left( {kd} \right)^{O\left( {n^3 } \right)} \). The goal of this paper is not a strengthening of the previous results (similar bounds of complexity are obtained in [5] and [13], even for a non-compact set), but more a new approach, and we hope the efficiency of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benedetti R., Risler J-J.: Real algebraic and semi algebraic sets. Hermann, 1990
Canny J.: A New Method for Robot Motion Planning and Real Geometry. IEEE 1987
Canny J.: The Complexity of Robot Motion Planning. Cambridge: M. I.T. Press 1988
Canny J.: Generalized characteristic polynomials. Symb. Comput.9, 241–250 (1990)
Canny J.: Computing roadmaps of general semi-algebraic sets. AAECC 91, New Orleans, 1991
Cucker F., Gonzalez Vega L., Rossello F., On algorithms for real algebraic plane curves, MEGA vol. 90, pp. 63–87, Basel: Birkhäuser 1990
Canny J., Grigor'ev D. Y., Vorobjov N. N.: Finding connected components of a semi-algebraic set in subexponential time. App. Algebra Eng. Comm. Comp. 217–238 (1992)
Grigor'ev D. Y., Vorobjov N. N.: Solving Systems of Polynomial Equations in Subexponential Time. J. Symb. Comput.5, 37–64 (1988)
Grigor'ev D. Y., Vorobjov N. N.: Counting Connected Components of a Semi-algebraic Set in Subexponential Time. Submitted to J. of Complexity Theory
Grigor'ev D. Y.: Complexity of deciding Tarski algebra. J. Symb. Comput.5, 65–108 (1988)
Heintz J.: Th. Comput. Sci24, 239–277 (1983)
Heintz J., Roy M-F., Solerno P.: Sur la complexité du principe de Tarki-Seidenberg. Bull. Soc. Math. France118, 101–126 (1990)
Heintz J., Roy M-F., Solerno P.: Single exponential path finding in semi-algebraic sets, part II, 1990. Proc. 60th birthday Conf. for prof. Abhyankar (to appear)
Lakshman Y. N., Lazard D.: On the Complexity of Zero-Dimensional Algebraic Systems, Preprint, LITP (Paris 6 University), 1990
Milnor J.: On the Betti Numbers of Real Varieties. Proc. Am. Math. Soc.15, 275–280 (1964)
Monge G.: Géométrie Descriptive. Paris: Gauthier-Villars 1922
Roy M.-F.: Computation of the topology of a real algebraic curve, in proceedings of the conf. on Comp. Geometry and Topology, Sevilla, 1987. Astérisque192, 17–33 (1990)
Schafarevich: Basic Algebraic Geometry. Berlin, Heidelberg, New York: Springer 1977
Trotman D.: On Canny's Roadmap Algorithm. Lecture Notes in Math. vol. 1462, pp. 320–339. Berlin, Heidelberg, New York: Springer 1990
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gournay, L., Risler, J.J. Construction of roadmaps in semi-algebraic sets. AAECC 4, 239–252 (1993). https://doi.org/10.1007/BF01200148
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01200148