1 citations · 3 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
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…
Rods and Rings: Soft Subdivision Planner for R^3 x S^2
Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap
We consider path planning for a rigid spatial robot moving amidst polyhedral obstacles. Our robot is either a rod or a ring. Being axially-symmetric, their configuration space is R…
Clustering Complex Zeros of Triangular Systems of Polynomials
Rémi Imbach, Marc Pouget, Chee Yap
This paper gives the first algorithm for finding a set of natural -clusters of complex zeros of a triangular system of polynomials within a given polybox in , for…
Certified Computation of planar Morse-Smale Complexes
Amit Chattopadhyay, Gert Vegter, Chee K. Yap
The Morse-Smale complex is an important tool for global topological analysis in various problems of computational geometry and topology. Algorithms for Morse-Smale complexes have b…
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves
Michael Burr, Sung Woo Choi, Ben Galehouse +1
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve…