!!Chee Yap - Selected Publications
\\
The number in [[...] for each reference below is the number of citations counted by Google Scholar: [https://scholar.google.com/citations?user=zO6kmIAAAAAJ&hl=en 1/2]\\
\\
| |All|Since 2014\\
|Citations|10779|1887\\
|h-index|52|22\\
|i10-index|133|47\\
\\
1. Fundamental problems of algorithmic algebra.\\
CK Yap. Oxford University Press, 2000.\\
Reviews by R Fateman in "Computing Reviews", 2000, and Arjeh M Cohen in "Mathematics of Computation", 71(239), 1333, 2002.\\[[437]\\
\\
2. Robust geometric computation.\\
CK Yap. Handbook of discrete and computational geometry, 653-668, 1997 (3rd edition 2018, with V. Sharma).\\[[212]\\
\\
3. A “retraction” method for planning the motion of a disc.\\
C Ó'Dúnlaing, CK Yap. Journal of Algorithms 6(1), 104-111, 1985.\\[[474] \\
\\
4. An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments. \\
CK Yap. Discrete & Computational Geometry 2(4), 365-393, 1987.\\
[[391]\\
\\
5. Parallel computational geometry.\\
A Aggarwal, B Chazelle, L Guibas, C Ó'Dúnlaing, CK Yap. Algorithmica 3(1-4), 293-327, 1988.\\[[375]\\
\\
6. Algorithmic motion planning.\\
CK Yap. Advances in robotics 1, 95-143, 1987.\\[[282]\\
\\
7. Some consequences of non-uniform conditions on uniform classes.\\
CK Yap. Theoretical Computer Science 26(3), 287-300, 1983.\\[[256]\\
\\
8. Almost tight recursion tree bounds for the Descartes method.\\
A Eigenwillig, V Sharma, CK Yap. Proceedings of the 2006 ACM international symposium on symbolic and algebraic computation, 71-78, 2006.\\[[107]\\
\\
9. Complexity analysis of root clustering for a complex polynomial.\\
R Becker, M Sagraloff, V Sharma, J Xu, CK Yap. Proceedings of the 2016 ACM international symposium on symbolic and algebraic computation, 71-78, 2016.\\[[13]\\
\\
10. On soft predicates in subdivision motion planning.\\
C Wang, YJ Chiang, CK Yap. Computational Geometry 48(8), 589-605, 2015.\\[[28]