Chee-Keng Yap

Computer Science · Physical Sciences

18h-index1.3kcitations48works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(29), Advanced Numerical Analysis Techniques(10), Polynomial and algebraic computation(8), Robotic Path Planning Algorithms(7), Digital Image Processing Techniques(7)

Publications48 total

Algorithmic and Geometric Aspects of Robotics (Routledge Revivals)
2016· 4 cited
Mathematical software - ICMS 2014 : 4th International Congress, Seoul, South Korea, August 5-9, 2014 : proceedings
DIAL (Catholic University of Leuven)·2014· 12 cited
A New Lower Bound Construction for the Word Problem for Commutative Thue Systems
Journal of the American Veterinary Medical Association·2011· 1 cited
Exact numerical computation in algebra and geometry.
International Symposium on Symbolic and Algebraic Computation·2009
In Praise of Numerical Computation.
2009
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation·2008· 28 cited
Complete numerical isolation of real zeros in zero-dimensional triangular systems
2007· 34 cited
Symbolic treatment of geometric degeneracies
Lecture notes in control and information sciences·2006· 74 cited
Complete subdivision algorithms, I: intersection of Bezier curves.
2006· 1 cited
Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard.
Canadian Conference on Computational Geometry·2003· 3 cited
Precision-Sensitive Euclidean Shortest Path in 3-Space
SIAM Journal on Computing·2000· 28 cited
Emerging Challenges in Computational Topology
arXiv (Cornell University)·1999· 40 citedOpen Access
Combinatorial complexity of translating a box in polyhedral 3-space
Computational Geometry·1998· 12 cited
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
Discrete & Computational Geometry·1997· 52 citedOpen Access
Approximate Euclidean Shortest Paths in 3-Space
International Journal of Computational Geometry & Applications·1997· 42 cited
Towards exact geometric computation
Computational Geometry·1997· 178 citedOpen Access
Efficient Algorithms for the Smallest Enclosing Cylinder Problem
Canadian Conference on Computational Geometry·1996· 13 cited
Monotonicity of rectilinear geodesics in <i>d</i>-space (extended abstract)
1996· 4 citedOpen Access
Combinatorial complexity of signed discs
Computational Geometry·1995· 2 cited
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Symposium on Discrete Algorithms·1995· 29 cited
page 1 of 3Next →

Frequent Co-authors

Joonsoo Choi(6), Jürgen Sellen(4), Jack Snoeyink(3), Kurt Mehlhorn(3), Colm Ó'Dúnlaing(3), David Kirkpatrick(2), Jacob T. Schwartz(2), Leonidas Guibas(2), Jianer Chen(2), Jin-San Cheng(2), Xiao-Shan Gao(2), Dan Halperin(2), Diane L. Souvaine(2), Mark H. Overmars(1), Bud Mishra(1), T M Chan(1), Juergen Sellen(1), Marshall Bern(1), David Eppstein(1), Pankaj K. Agarwal(1)