Connectivity in Semi-algebraic sets

被引：5
|
作者：
Hong, Hoon [1 ]
机构：
[1] N Carolina State Univ, Dept Math, Raleigh, NC 27695 USA
来源：
12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010) | 2011年
关键词：
connectivity; road map; semi-algebraic sets; gradient fields; Morse-Smale complex; ROADMAPS;
D O I：
10.1109/SYNASC.2010.91
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：4 / 7
页数：4
相关论文
共 50 条
12345