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

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is tackled through the computation of so-called roadmaps which are re...

Ausführliche Beschreibung