Computing roadmaps in smooth real algebraic sets
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177864
- Computing roadmaps of semi-algebraic sets on a variety
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Divide and conquer roadmap for algebraic sets
Cited in
(8)- Numerical roadmap of smooth bounded real algebraic surface
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- scientific article; zbMATH DE number 177864 (Why is no real title available?)
- Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
- A baby step-giant step roadmap algorithm for general algebraic 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
- Computing the dimension of real algebraic sets
This page was built for publication: Computing roadmaps in smooth real algebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568151)
