Computing roadmaps of semi-algebraic sets on a variety

Computing roadmaps of semi-algebraic sets on a variety (1997)

Cached

Download Links

by Saugata Basu , Richard Pollack , Marie-françoise Roy

Venue:	Journal of the AMS
Citations:	26 - 9 self

BibTeX

@ARTICLE{Basu97computingroadmaps,
    author = {Saugata Basu and Richard Pollack and Marie-françoise Roy},
    title = {Computing roadmaps of semi-algebraic sets on a variety},
    journal = {Journal of the AMS},
    year = {1997},
    volume = {13},
    pages = {55--82}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Let R be a real closed field, Z(Q) a real algebraic variety defined as the zero set of a polynomial Q ∈ R[X1,...,Xk]andSasemi-algebraic subset of Z(Q), defined by a Boolean formula with atoms of the form P < 0,P> 0,P =0withP∈P, where P is a finite subset of R[X1,...,Xk]. A semi-algebraic set C is semi-algebraically connected if it is non-empty and is not

Citations

443	The Complexity of Robot Motion Planning - Canny - 1987
417	Morse theory - Milnor - 1969
308	Quantifier elimination for real closed fields by cylindrical algebraic decomposition - COLLINS - 1975
177	On the combinatorial and algebraic complexity of quantifier elimination - Basu, Pollack, et al. - 1996
170	On the piano movers’ problem ii. general techniques for computing topological properties of real algebraic manifolds - Schwartz, Sharir - 1983
136	Géométrie algébrique réelle - Bochnak, Coste, et al. - 1987
56	On the computational complexity and geometry of the first order theory of the reals - Renegar - 1992
45	algebraic geometry, Ergebnisse der Mathematik und ihrer Grenzgebiete - Bochnak, Coste, et al. - 1998
42	Computing road maps in general semi-algebraic sets - Canny - 1993
33	Morse Theory, Annals of Mathematics Studies - Milnor - 1963
29	Thom’s lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets - Coste, Roy - 1988
22	Counting connected components of a semialgebraic set in subexponential time - Grigor’ev, Vorobjov - 1992
18	Counting connected components of a semi-algebraic set in subexponential time - Grigoriev, Vorobjov - 1992
17	Construction of roadmaps of semi-algebraic sets - Gournay, Risler - 1993
16	Quanti elimination for real closed by cylindrical algebraic decomposition - Collins - 1975
13	Single exponential path finding in semi-algebraic sets II: The general case - Heintz, Roy, et al. - 1994
12	Robot motion planning - JC - 1991
11	On Computing a Set of Points meeting every Semialgebraically Connected Component of a Family of Polynomials on a Variety - Basu, Pollack, et al.
10	Computing roadmaps of semi-algebraic sets - Basu, Pollack, et al. - 1996
10	On the computational complexity and geometry of the order theory of the reals - Renegar - 1992
6	Nash triviality in families of Nash manifolds - Coste, Shiota - 1992
5	Hardt Semi-algebraic Local Triviality in Semi-algebraic Mappings - M - 1980
5	Finding irreducible components of some real transcendental varieties - ROY, VOROBJOV - 1994
4	Vorobjov Computing the Complexification of a Semialgebraic Set - Roy, N - 1996
3	Robot Motion Planning, The Kluwer - Latombe - 1991
2	Solern o Single exponential path in semi-algebraic sets I : The case of a regular hypersurface - Heintz, Roy, et al. - 1990
1	Safey Finding at least a point in each connected component of a real algebraic set defined by a single equation - Rouillier, Roy, et al.
1	G'e om'etrie alg'ebrique r'eelle (Real algebraic geometry). Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge, Bd. 12, Berlin etc.: Springer-Verlag - Bochnak, Coste, et al. - 1987
1	Vorobjov Computing the Complexi of a Semi- algebraic Set - Roy, N - 1996