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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of symbolic computation Vol. 120; p. 102234
Main Authors:	Prébet, Rémi, Safey El Din, Mohab, Schost, Éric
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.01.2024 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!