• Corpus ID: 5569623

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces

@article{Din2009ABS,
  title={A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces},
  author={Mohab Safey El Din and {\'E}ric Schost},
  journal={ArXiv},
  year={2009},
  volume={abs/0902.1612}
}
We consider the problem of constructing roadmaps of real algebraic sets. The problem was introduced by Canny to answer connectivity questions and solve motion planning problems. Given $s$ polynomial equations with rational coefficients, of degree $D$ in $n$ variables, Canny's algorithm has a Monte Carlo cost of $s^n\log(s) D^{O(n^2)}$ operations in $\mathbb{Q}$; a deterministic version runs in time $s^n \log(s) D^{O(n^4)}$. The next improvement was due to Basu, Pollack and Roy, with an… 
On the intrinsic complexity of point finding in real singular hypersurfaces
TLDR
A natural construction is introduced that allows to tackle the case of a non-smooth real hypersurface by means of a reduction to a smooth complete intersection.
Variant quantifier elimination
TLDR
The main idea underlying the algorithm is to substitute the repeated projection step of CAD by a single projection without carrying out a parametric existential decision over the reals, and it is found that the algorithm can tackle important and challenging problems, such as numerical stability analysis of the widely-used MacCormack's scheme.
Variant real quantifier elimination: algorithm and application
TLDR
The main idea underlying the algorithm VQE is to substitute the repeated projection step of CAD by a single projection without carrying out a parametric existential decision over the reals, which can tackle important and challenging problems, such as numerical stability analysis of the widely-used MacCormack's scheme.

References

SHOWING 1-10 OF 36 REFERENCES
Construction of roadmaps in semi-algebraic sets
  • Laurent Gournay, J. Risler
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2005
TLDR
An algorithm of construction of a roadmap for a compact semi-algebraic setS ⊂ Rn is described, 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 non-compact set.
Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case
The objective of this paper is to show how the recently proposed method by Giusti, Heintz, Morais, Morgenstern, Pardo \cite{gihemorpar} can be applied to a case of real polynomial equation solving.
Polar varieties and efficient real elimination
Abstract. Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, \ldots, f_p$. This paper is devoted to the algorithmic problem of finding
Computing Roadmaps of General Semi-Algebraic Sets
  • J. Canny
  • Mathematics, Computer Science
    Comput. J.
  • 1993
TLDR
The eoadmap algorithm described in [3, 4] which worked only for compact, regularly stratified sets is replaced by a one-dimensional semi-algebraic subset R(S) of S.
The complexity of robot motion planning
TLDR
John Canny resolves long-standing problems concerning the complexity of motion planning and, for the central problem of finding a collision free path for a jointed robot in the presence of obstacles, obtains exponential speedups over existing algorithms by applying high-powered new mathematical techniques.
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
This paper continues the discussion, begun in J. Schwartz and M. Sharir [Comm. Pure Appl. Math., in press], of the following problem, which arises in robotics: Given a collection of bodies B, which
COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY
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] and S a semi-algebraic subset of Z(Q), defined by a Boolean formula with
Polar varieties and computation of one point in each connected component of a smooth real algebraic set
TLDR
An algorithm is deduced that extends that of Bank, Giusti, Heintz and Mbakop to non-compact situations and its arithmetic complexity is polynomial in the complexity of evaluation of the input system, an intrinsic algebraic quantity and a combinatorial quantity.
Algebraic Geometry I: Complex Projective Varieties
Let me begin with a little history. In the 20th century, algebraic geometry has gone through at least 3 distinct phases. In the period 1900-1930, largely under the leadership of the 3 Italians,
Computing roadmaps of semi-algebraic sets (extended abstract)
TLDR
A new algorithm for computing a semi-algebraic path in S comecting two points if they happen to lie in the same connected component of S is presented, which improves the complexity of the fastest algorithm solving this problem known to this date.
...
1
2
3
4
...