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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of symbolic computation Ročník 120; s. 102234
Hlavní autori:	Prébet, Rémi, Safey El Din, Mohab, Schost, Éric
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.01.2024 Elsevier
Predmet:	Algebraic Geometry Computational real algebraic geometry Computer Science Critical points Mathematics Real algebraic sets Roadmaps Symbolic Computation 14Q30 68W30 Critical points 14Q20 Real algebraic sets 14P05 Roadmaps Computational real algebraic geometry
ISSN:	0747-7171, 1095-855X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!