Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/SYNASC.2010.91 | SYNASC |
Keywords | Field | DocType |
gradient,interval analysis,set theory,polynomial,gradient field method,connected component,gradient methods,road map,semialgebraic set,eigenvector,semi-algebraic sets,keywords-connectivity,eigenvalues and eigenfunctions,polynomials,connectivity,gradient field,eigenvectors,planning,algorithm design and analysis | Semialgebraic set,Set theory,Discrete mathematics,Algebraic number,Algorithm design,Polynomial,Connected component,Interval arithmetic,Eigenvalues and eigenvectors,Mathematics | Conference |
ISSN | ISBN | Citations |
2470-8801 | 978-1-4244-9816-1 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoon Hong | 1 | 104 | 11.39 |
| James Rohal | 2 | 0 | 0.34 |
| Mohab Safey El Din | 3 | 450 | 35.64 |
| Éric Schost | 4 | 712 | 58.00 |