Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane
Authors:
Open Access
- 1 August 1998
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Search for shortest path around semialgebraic obstacles in the planeJournal of Mathematical Sciences, 1994
- Computing minimum length paths of a given homotopy classComputational Geometry, 1994
- Approximate Euclidean shortest path in 3-space1994
- Description of the connected components of a semialgebraic set in single exponential timeDiscrete & Computational Geometry, 1994
- Counting connected components of a semialgebraic set in subexponential timecomputational complexity, 1992
- 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 realsJournal of Symbolic Computation, 1992
- Sur la complexité du principe de Tarski-SeidenbergBulletin de la Société Mathématiques de France, 1990
- Complexity of deciding Tarski algebraJournal of Symbolic Computation, 1988
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985