Computing Roadmaps of General Semi-Algebraic Sets
From MaRDI portal
Recommendations
Cited in
(42)- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Construction of roadmaps in semi-algebraic sets
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries
- Numerically computing real points on algebraic sets
- Quantitative curve selection lemma
- Numerical roadmap of smooth bounded real algebraic surface
- Computing the homology of semialgebraic sets. I: Lax formulas
- On soft predicates in subdivision motion planning
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- scientific article; zbMATH DE number 16983 (Why is no real title available?)
- scientific article; zbMATH DE number 27176 (Why is no real title available?)
- scientific article; zbMATH DE number 177548 (Why is no real title available?)
- scientific article; zbMATH DE number 177864 (Why is no real title available?)
- Variant quantifier elimination
- scientific article; zbMATH DE number 1256732 (Why is no real title available?)
- scientific article; zbMATH DE number 589123 (Why is no real title available?)
- Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
- Divide and conquer roadmap for algebraic sets
- Computing roadmaps of semi-algebraic sets on a variety
- A baby step-giant step roadmap algorithm for general algebraic sets
- On the number of cells defined by a family of polynomials on a variety
- Bounding the length of gradient trajectories
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- Smooth points on semi-algebraic sets
- Algorithm for Connectivity Queries on Real Algebraic Curves
- Persistent Homology of Semialgebraic Sets
- Efficient simplicial replacement of semialgebraic sets
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
- On the computation of the homology of semialgebraic sets
- On k-enclosing slab problems
- Smooth connectivity in real algebraic varieties
- Whitney stratification of algebraic boundaries of convex semi-algebraic sets
- Connectivity in symmetric semi-algebraic sets
- Computing roadmaps in unbounded smooth real algebraic sets. II: Algorithm and complexity
- Deciding connectivity in symmetric semi-algebraic sets
- Using interval arithmetic to prove that a set is path-connected
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
- Computing the first Betti number of a semi-algebraic set
This page was built for publication: Computing Roadmaps of General Semi-Algebraic Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140561)
