Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results

DOI10.1016/j.jsc.2023.102234zbMath1527.14116arXiv2203.03961MaRDI QIDQ6170822

Mohab Safey El Din, Éric Schost, Unnamed Author

Publication date: 10 August 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.03961

zbMATH Keywords

critical pointscomputational real algebraic geometryroadmapsreal algebraic sets

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Computational real algebraic geometry (14Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Divide and conquer roadmap for algebraic sets
• A baby step-giant step roadmap algorithm for general algebraic sets
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Definability and fast quantifier elimination in algebraically closed fields
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Counting connected components of a semialgebraic set in subexponential time
• Nash triviality in families of Nash manifolds
• On the geometry of polar varieties
• Generalized polar varieties: geometry and algorithms
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
• Computing Roadmaps of General Semi-Algebraic Sets
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
• Robots, computer algebra and eight connected components

This page was built for publication: Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results