Computing roadmaps in smooth real algebraic sets

zbMATH Open1192.65058MaRDI QIDQ3568151FDOQ3568151

Authors: Marc Mezzarobba, Mohab Safey El Din 

Publication date: 17 June 2010

Recommendations

• scientific article
• 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

zbMATH Keywords

complexityconnectednesspolynomial system solvingreal solutions

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Cited In (6)

• Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
• Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
• Title not available (Why is that?)
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
• Computing the dimension of real algebraic sets

Uses Software

• FGb
• ISOLATE

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)