2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2010
DOI: 10.1109/synasc.2010.91
|View full text |Cite
|
Sign up to set email alerts
|

Connectivity in Semi-algebraic Sets

Abstract: We consider the problem of deciding whether two given points in a semialgebraic set can be connected, that is, whether the two points lie in a same connected component. In particular, we consider a semialgebraic set consisting of points where a given polynomial is non-zero. We will describe a method based on gradient fields, eigenvectors and interval analysis.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 13 publications
0
0
0
Order By: Relevance