119 citations · 203 across the 12 of their papers we have counts for
16 papers
Theory and Explicit Design of a Path Planner for an SE(3) Robot
Zhaoqi Zhang, Yi-Jen Chiang, Chee Yap
We consider path planning for a rigid spatial robot with 6 degrees of freedom (6 DOFs), moving amidst polyhedral obstacles. A correct, complete and practical path planner for such…
The D-plus Discriminant and Complexity of Root Clustering
Jing Yang, Chee K. Yap
Let be an integer polynomial with distinct roots whose multiplicities are . We define the D-plus discriminant of $p(…
Complexity Analysis of Root Clustering for a Complex Polynomial
Ruben Becker, Michael Sagraloff, Vikram Sharma +2
Let be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural -clusters of roots of in some box reg…
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision
Jyh-Ming Lien, Vikram Sharma, Gert Vegter +1
This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "sim…
On mu-Symmetric Polynomials
Jing Yang, Chee K. Yap
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure . Traditionally, root functions are studied via…
Soft Subdivision Motion Planning for Complex Planar Robots
Bo Zhou, Yi-Jen Chiang, Chee Yap
The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit…