default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChee-Keng Yap
Chee K. Yap – Chee Yap
Person information
- affiliation: New York University, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i18]Zhaoqi Zhang, Yi-Jen Chiang, Chee Yap:
Theory and Explicit Design of a Path Planner for an SE(3) Robot. CoRR abs/2407.05135 (2024)- 2023
- [j76]Bo Huang, Chee Yap:
An algorithmic approach to small limit cycles of nonlinear differential systems: The averaging method revisited. J. Symb. Comput. 115: 492-517 (2023) - [c105]Kai Hormann, Chee Yap, Ya Shi Zhang
:
Range Functions of Any Convergence Order and Their Amortized Complexity Analysis. CASC 2023: 162-182 - [i17]Soo Go, Hoon Hong, Ilia Ilmer, Alexey Ovchinnikov, Pedro Soto, Chee Yap:
Symbolic-Numeric Parameter Estimation Software Package in Julia. CoRR abs/2303.02159 (2023) - 2022
- [c104]Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). SoCG 2022: 69:1-69:6 - 2021
- [j75]Bo Zhou, Yi-Jen Chiang, Chee Yap:
Soft subdivision motion planning for complex planar robots. Comput. Geom. 92: 101683 (2021) - [j74]Rémi Imbach, Marc Pouget, Chee Yap:
Clustering Complex Zeros of Triangular Systems of Polynomials. Math. Comput. Sci. 15(2): 271-292 (2021) - [c103]Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ESA 2021: 54:1-54:19 - [c102]Kai Hormann, Lucas Kania, Chee Yap:
Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation. ISSAC 2021: 193-200 - [i16]Jing Yang, Chee K. Yap:
The D-plus Discriminant and Complexity of Root Clustering. CoRR abs/2105.03856 (2021) - [i15]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR abs/2105.05183 (2021) - 2020
- [j73]Mohab Safey El Din, Chee Yap:
Special Issue on Symbolic and Algebraic Computation: ISSAC 2017. J. Symb. Comput. 98: 1-2 (2020) - [i14]Jing Yang, Chee K. Yap:
On mu-Symmetric Polynomials. CoRR abs/2001.07403 (2020) - [i13]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision. CoRR abs/2009.00811 (2020)
2010 – 2019
- 2019
- [j72]Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap:
SIAN: software for structural identifiability analysis of ODE models. Bioinform. 35(16): 2873-2874 (2019) - [j71]Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap:
SIAN: a tool for assessing structural identifiability of parametric ODEs. ACM Commun. Comput. Algebra 53(2): 37-40 (2019) - [c101]Chee Yap:
Towards Soft Exact Computation (Invited Talk). CASC 2019: 12-36 - [c100]Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias S. Kotsireas, Vitaly Zaderman:
Root-Finding with Implicit Deflation. CASC 2019: 236-245 - [c99]Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap:
Rods and Rings: Soft Subdivision Planner for R^3 x S^2. SoCG 2019: 43:1-43:17 - [c98]Bo Huang, Chee Yap:
An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method Revisited. ISSAC 2019: 211-218 - [c97]Juan Xu, Chee Yap:
Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis. ISSAC 2019: 355-362 - [i12]Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap:
Rods and Rings: Soft Subdivision Planner for R^3 x S^2. CoRR abs/1903.09416 (2019) - [i11]Bo Huang, Chee Yap:
An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: the Averaging Method Revisited. CoRR abs/1905.03315 (2019) - [i10]Bo Zhou, Yi-Jen Chiang, Chee Yap:
Soft Subdivision Motion Planning for Complex Planar Robots. CoRR abs/1906.06154 (2019) - 2018
- [j70]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap:
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86: 51-96 (2018) - [c96]Bo Zhou, Yi-Jen Chiang, Chee Yap:
Soft Subdivision Motion Planning for Complex Planar Robots. ESA 2018: 73:1-73:14 - [c95]Rémi Imbach, Victor Y. Pan, Chee Yap:
Implementation of a Near-Optimal Complex Root Clustering Algorithm. ICMS 2018: 235-244 - [c94]Jing Yang, Chee K. Yap:
On \mu μ -Symmetric Polynomials and D-Plus. ICMS 2018: 482-491 - [c93]Juan Xu, Michael A. Burr, Chee Yap:
An Approach for Certifying Homotopy Continuation Paths: Univariate Case. ISSAC 2018: 399-406 - [i9]Rémi Imbach, Victor Y. Pan, Chee Yap:
Implementation of a Near-Optimal Complex Root Clustering Algorithm. CoRR abs/1806.10584 (2018) - [i8]Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap:
SIAN: software for structural identifiability analysis of ODE models. CoRR abs/1812.10180 (2018) - 2017
- [j69]Huck Bennett, Chee Yap:
Amortized analysis of smooth quadtrees in all dimensions. Comput. Geom. 63: 20-39 (2017) - [j68]Amit Chattopadhyay, Gert Vegter, Chee K. Yap:
Certified computation of planar Morse-Smale complexes. J. Symb. Comput. 78: 3-40 (2017) - [j67]Jianxin Wang, Chee K. Yap:
Preface. Theor. Comput. Sci. 657: 1-2 (2017) - [e5]Michael A. Burr, Chee K. Yap, Mohab Safey El Din:
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. ACM 2017, ISBN 978-1-4503-5064-8 [contents] - [i7]Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu:
Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots. CoRR abs/1704.05123 (2017) - 2016
- [j66]Huck Bennett, Evanthia Papadopoulou, Chee Yap:
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum 35(5): 229-247 (2016) - [c92]Ching-Hsiang Hsu, John Paul Ryan, Chee Yap:
Path Planning for Simple Robots using Soft Subdivision Search. SoCG 2016: 68:1-68:5 - [c91]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC 2016: 71-78 - [c90]Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu:
Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots. WAFR 2016: 576-591 - [e4]Ilias S. Kotsireas, Siegfried M. Rump, Chee K. Yap:
Mathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9582, Springer 2016, ISBN 978-3-319-32858-4 [contents] - [r3]Chee K. Yap, Vikram Sharma:
Robust Geometric Computation. Encyclopedia of Algorithms 2016: 1860-1863 - 2015
- [j65]Cong Wang, Yi-Jen Chiang, Chee-Keng Yap:
On soft predicates in subdivision motion planning. Comput. Geom. 48(8): 589-605 (2015) - [c89]Chee-Keng Yap:
Soft Subdivision Search in Motion Planning, II: Axiomatics. FAW 2015: 7-22 - [e3]Jianxin Wang, Chee-Keng Yap:
Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings. Lecture Notes in Computer Science 9130, Springer 2015, ISBN 978-3-319-19646-6 [contents] - [i6]Amit Chattopadhyay, Gert Vegter, Chee-Keng Yap:
Certified Computation of planar Morse-Smale Complexes. CoRR abs/1506.06265 (2015) - [i5]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap:
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR abs/1509.06231 (2015) - 2014
- [c88]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision. ICMS 2014: 277-282 - [c87]Huck Bennett, Chee Yap:
Amortized Analysis of Smooth Quadtrees in All Dimensions. SWAT 2014: 38-49 - [c86]Zhongdi Luo, Yi-Jen Chiang, Jyh-Ming Lien, Chee-Keng Yap:
Resolution-Exact Algorithms for Link Robots. WAFR 2014: 353-370 - [e2]Hoon Hong, Chee Yap:
Mathematical Software - ICMS 2014 - 4th International Congress, Seoul, South Korea, August 5-9, 2014. Proceedings. Lecture Notes in Computer Science 8592, Springer 2014, ISBN 978-3-662-44198-5 [contents] - [i4]Aitor Aladren, Sasa Bodiroza, Hamid Reza Chitsaz, J. J. Guerrero, Verena V. Hafner, Kris K. Hauser, Aleksandar Jevtic, Moslem Kazemi, Bruno Lara, Gonzalo López-Nicolás, Peer Neubert, Peter Protzel, Laurel D. Riek, Niko Sünderhauf, Chee Yap:
Proceedings of the 1st Workshop on Robotics Challenges and Vision (RCV2013). CoRR abs/1402.3213 (2014) - 2013
- [j64]Long Lin, Chee Yap, Jihun Yu:
Non-local isotopic approximation of nonsingular surfaces. Comput. Aided Des. 45(2): 451-462 (2013) - [c85]Chee Yap, Michael Sagraloff, Vikram Sharma:
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. CiE 2013: 434-444 - [c84]Cong Wang, Yi-Jen Chiang, Chee Yap:
On soft predicates in subdivision motion planning. SoCG 2013: 349-358 - 2012
- [j63]Jihun Yu, Chris Wojtan, Greg Turk, Chee Yap:
Explicit Mesh Surfaces for Particle Based Fluids. Comput. Graph. Forum 31(2pt4): 815-824 (2012) - [j62]Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap:
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symb. Comput. 47(2): 131-152 (2012) - [c83]Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap:
Certified computation of planar morse-smale complexes. SCG 2012: 259-268 - [c82]Vikram Sharma, Chee-Keng Yap:
Near optimal tree size bounds on a simple real root isolation algorithm. ISSAC 2012: 319-326 - [c81]Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien:
Towards Exact Numerical Voronoi Diagrams. ISVD 2012: 2-16 - 2011
- [j61]Long Lin, Chee Yap:
Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach. Discret. Comput. Geom. 45(4): 760-795 (2011) - [c80]Chee-Keng Yap, Michael Sagraloff:
A simple but exact and efficient algorithm for complex root isolation. ISSAC 2011: 353-360 - [c79]Narayan Kamath, Irina Voiculescu, Chee K. Yap:
Empirical study of an evaluation-based subdivision algorithm for complex root isolation. SNC 2011: 155-164 - [c78]Chee Yap:
A Real Elementary Approach to the Master Recurrence and Generalizations. TAMC 2011: 14-26 - [i3]Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee Yap:
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves. CoRR abs/1102.5463 (2011) - 2010
- [j60]Gert Vegter, Chee-Keng Yap:
Foreword. Math. Comput. Sci. 4(4): 385-387 (2010) - [c77]Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann:
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. ICMS 2010: 121-141
2000 – 2009
- 2009
- [j59]Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap:
Complete numerical isolation of real roots in zero-dimensional triangular systems. J. Symb. Comput. 44(7): 768-785 (2009) - [c76]Chee-Keng Yap:
In Praise of Numerical Computation. Efficient Algorithms 2009: 380-407 - [c75]Long Lin, Chee-Keng Yap:
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. SCG 2009: 351-360 - [c74]W. Dale Brownawell, Chee-Keng Yap:
Lower bounds for zero-dimensional projections. ISSAC 2009: 79-86 - [c73]Chee-Keng Yap:
Exact numerical computation in algebra and geometry. ISSAC 2009: 387-388 - [c72]Chee-Keng Yap, Jihun Yu:
Foundations of Exact Rounding. WALCOM 2009: 15-31 - [i2]Michael A. Burr, Felix Krahmer, Chee Yap:
Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j58]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008) - [c71]Chee-Keng Yap:
Theory of Real Computation According to EGC. Reliable Implementation of Real Number Algorithms 2008: 193-237 - [c70]Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap:
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC 2008: 87-94 - [r2]Chee-Keng Yap, Vikram Sharma:
Robust Geometric Computation. Encyclopedia of Algorithms 2008 - 2007
- [j57]Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap:
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. Int. J. Comput. Geom. Appl. 17(6): 555-593 (2007) - [j56]Chee-Keng Yap, Hoon Hong:
Foreword. Math. Comput. Sci. 1(1): 3-7 (2007) - [c69]Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap:
Complete numerical isolation of real zeros in zero-dimensional triangular systems. ISSAC 2007: 92-99 - 2006
- [j55]Chee-Keng Yap, Sylvain Pion:
Special Issue on Robust Geometric Algorithms and their Implementations. Comput. Geom. 33(1-2): 1-2 (2006) - [j54]Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap:
Shortest Path amidst Disc Obstacles Is Computable. Int. J. Comput. Geom. Appl. 16(5-6): 567-590 (2006) - [j53]Sylvain Pion, Chee-Keng Yap:
Constructive root bound for k-ary rational input numbers. Theor. Comput. Sci. 369(1-3): 361-376 (2006) - [j52]Ken Been, Eli Daiches, Chee-Keng Yap:
Dynamic Map Labeling. IEEE Trans. Vis. Comput. Graph. 12(5): 773-780 (2006) - [c68]Chee-Keng Yap:
Complete subdivision algorithms, I: intersection of Bezier curves. SCG 2006: 217-226 - [c67]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. SCG 2006: 483-484 - [c66]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60 - [c65]Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap:
Almost tight recursion tree bounds for the Descartes method. ISSAC 2006: 71-78 - [c64]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR 2006: 187-202 - 2005
- [j51]Chen Li, Sylvain Pion, Chee-Keng Yap:
Recent progress in exact geometric computation. J. Log. Algebraic Methods Program. 64(1): 85-111 (2005) - [c63]Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap:
Shortest path amidst disc obstacles is computable. SCG 2005: 116-125 - [c62]Vikram Sharma, Zilin Du, Chee-Keng Yap:
Robust Approximate Zeros. ESA 2005: 874-886 - [c61]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
k-Link Shortest Paths in Weighted Subdivisions. WADS 2005: 325-337 - 2004
- [j50]Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. 31(1): 139-171 (2004) - [c60]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713 - [c59]Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap:
Shortest Paths for Disc Obstacles. ICCSA (3) 2004: 62-70 - [r1]Chee K. Yap:
Robust geometric computation. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 927-952 - 2003
- [j49]Ee-Chien Chang, Chee-Keng Yap:
Competitive On-Line Scheduling with Level of Service. J. Sched. 6(3): 251-267 (2003) - [c58]Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13 - [c57]Sylvain Pion, Chee-Keng Yap:
Constructive root bound for k-ary rational input numbers. SCG 2003: 256-263 - 2002
- [c56]Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Pseudo approximation algorithms, with applications to optimal motion planning. SCG 2002: 170-178 - [c55]Chee-Keng Yap, Kenneth Been, Zilin Du:
Responsive scalable thinwire visualization: application to large geographic datasets. Visualization and Data Analysis 2002: 1-12 - [c54]Chee-Keng Yap, Henning Biermann, Aaron Hertzmann, Chen Li, Jon Meyer, Hsing-Kuo Pao, Salvatore Paxia:
Different Manhattan project: automatic statistical model generation. Visualization and Data Analysis 2002: 259-268 - [c53]Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap:
Hypergeometric Functions in Exact Geometric Computation. CCA 2002: 53-64 - 2001
- [c52]Chee Yap, Yunyue Zhu:
Yet another look at fractional cascading: B-graphs with application to point location. CCCG 2001: 173-176 - [c51]Ee-Chien Chang, Chee-Keng Yap:
Competitive Online Scheduling with Level of Service. COCOON 2001: 453-462 - [c50]Chen Li, Chee-Keng Yap:
A new constructive root bound for algebraic expressions. SODA 2001: 496-505 - 2000
- [b1]Chee-Keng Yap:
Fundamental problems of algorithmic algebra. Oxford University Press 2000, ISBN 978-0-19-512516-0, pp. I-XV, 1-511 - [j48]Ee-Chien Chang, Chee-Keng Yap:
A Simultaneous Search Problem. Algorithmica 26(2): 255-262 (2000) - [j47]Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
Smallest Enclosing Cylinders. Algorithmica 27(2): 170-186 (2000) - [j46]Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29(5): 1577-1595 (2000) - [c49]Daniela Tulone, Chee-Keng Yap, Chen Li:
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. Automated Deduction in Geometry 2000: 58-82
1990 – 1999
- 1999
- [c48]Vijay Karamcheti, Chen Li, Igor Pechtchanski, Chee-Keng Yap:
A Core Library for Robust Numeric and Geometric Computation. SCG 1999: 351-359 - [i1]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - 1998
- [j45]Dan Halperin, Chee-Keng Yap:
Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998) - 1997
- [j44]Chee-Keng Yap:
Towards Exact Geometric Computation. Comput. Geom. 7: 3-23 (1997) - [j43]Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discret. Comput. Geom. 18(4): 433-454 (1997) - [j42]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Approximate Euclidean Shortest Paths in 3-Space. Int. J. Comput. Geom. Appl. 7(4): 271-295 (1997) - [c47]Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap:
A Complete Roundness Classification Procedure. SCG 1997: 129-138 - [c46]Ee-Chien Chang, Chee-Keng Yap:
A Wavelet Approach to Foveating Images. SCG 1997: 397-399 - 1996
- [j41]Chung-Jen Ho, Chee-Keng Yap:
The Habicht Approch to Subresultants. J. Symb. Comput. 21(1): 1-14 (1996) - [c45]Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
Efficient Algorithms for the Smallest Enclosing Cylinder Problem. CCCG 1996: 264-269 - [c44]Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
d1-Optimal Motion for a Rod (Extended Abstract). SCG 1996: 252-263 - [c43]Joonsoo Choi, Chee-Keng Yap:
Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). SCG 1996: 339-348 - [c42]Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
Smallest Enclosing Cylinders. SCG 1996: C-13-C-14 - 1995
- [j40]Diane L. Souvaine, Chee-Keng Yap:
Combinatorial Complexity of Signed Discs. Comput. Geom. 5: 207-223 (1995) - [j39]Ee-Chien Chang, Chee-Keng Yap:
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Inf. Process. Lett. 55(3): 155-157 (1995) - [c41]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). SCG 1995: 350-359 - [c40]Joonsoo Choi, Chee-Keng Yap:
Rectilinear Geodesics in 3-Space (Extended Abstract). SCG 1995: 380-389 - [c39]Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291 - 1994
- [c38]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Approximate Euclidean Shortest Path in 3-Space. SCG 1994: 41-48 - 1993
- [j38]Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993) - [j37]Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap:
Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993) - [c37]Chee Yap:
Low Level Issues in Computational Geometry. CCCG 1993: 405-419 - [c36]Dan Halperin, Chee-Keng Yap:
Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. SCG 1993: 29-37 - [c35]Thomas Dubé, Chee-Keng Yap:
The Geometry in Constraint Logic Programs. PPCP 1993: 44-50 - [c34]Diane L. Souvaine, Chee-Keng Yap:
Combinatorial Complexity of Signed Discs (Extended Abstract). WADS 1993: 577-588 - [e1]Chee Yap:
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993. ACM 1993, ISBN 0-89791-582-8 [contents] - 1992
- [j36]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992) - [j35]David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap:
Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discret. Comput. Geom. 7: 295-318 (1992) - [j34]Stephen Cameron, Chee-Keng Yap:
Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ACM Trans. Graph. 11(1): 12-39 (1992) - [c33]Chee-Keng Yap:
Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract). FOCS 1992: 437-446 - 1991
- [j33]James Cox, Chee-Keng Yap:
On-line Motion Planning: Case of a Planar Rod. Ann. Math. Artif. Intell. 3(1): 1-20 (1991) - [j32]Chee-Keng Yap:
A New Lower Bound Construction for Commutative Thue Systems with aApplications. J. Symb. Comput. 12(1): 1-28 (1991) - [j31]Kurt Mehlhorn, Chee-Keng Yap:
Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991) - [j30]Jianer Chen, Chee-Keng Yap:
Reversal Complexity. SIAM J. Comput. 20(4): 622-638 (1991) - [j29]Mark H. Overmars, Chee-Keng Yap:
New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991) - 1990
- [j28]Chee-Keng Yap:
Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Comput. Syst. Sci. 40(1): 2-18 (1990) - [j27]Chee-Keng Yap:
Symbolic Treatment of Geometric Degeneration. J. Symb. Comput. 10(3/4): 349-370 (1990) - [c32]Gert Vegter, Chee-Keng Yap:
Computational Complexity of Combinatorial Surfaces. SCG 1990: 102-111 - [c31]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes. SCG 1990: 216-224 - [c30]David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap:
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. STOC 1990: 341-351 - [p1]David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap:
Probing Convex Polytopes. Autonomous Robot Vehicles 1990: 328-341
1980 – 1989
- 1989
- [j26]Chee-Keng Yap:
Editor's Foreword: Special Issue on Computational Geometry. Algorithmica 4(1): 1-2 (1989) - [j25]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding Minimal Convex Nested Polygons. Inf. Comput. 83(1): 98-110 (1989) - [j24]Bud Mishra, Chee-Keng Yap:
Notes on Gröbner bases. Inf. Sci. 48(3): 219-252 (1989) - [c29]Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS 1989: 12-23 - [c28]Chee-Keng Yap, Helmut Alt:
Motion Planning in the CL-Environment (Extended Abstract). WADS 1989: 373-380 - 1988
- [j23]Chee-Keng Yap:
Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. Algorithmica 3: 279-288 (1988) - [j22]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry. Algorithmica 3: 293-327 (1988) - [j21]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - [j20]Derick Wood, Chee-Keng Yap:
The Orthogonal Convex Skull Problem. Discret. Comput. Geom. 3: 349-365 (1988) - [c27]L. W. Ericson, Chee-Keng Yap:
The Design of LINETOOL, a Geometric Editor. SCG 1988: 83-92 - [c26]Chee-Keng Yap:
A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. SCG 1988: 134-142 - [c25]Mark H. Overmars, Chee-Keng Yap:
New upper bounds in Klee's measure problem (extended abstract). FOCS 1988: 550-556 - [c24]Kurt Mehlhorn, Chee-Keng Yap:
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423 - [c23]Chee-Keng Yap:
Applications of a Symbolic Perturbation Scheme (Abstract). SWAT 1988: 138 - 1987
- [j19]Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2: 27-59 (1987) - [j18]Chee-Keng Yap:
Preface Special Issue on Robotics. Algorithmica 2: 363-365 (1987) - [j17]Chee-Keng Yap:
An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. Discret. Comput. Geom. 2: 365-393 (1987) - [j16]Richard Cole, Chee-Keng Yap:
Shape from Probing. J. Algorithms 8(1): 19-38 (1987) - [j15]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987) - [j14]Chee-Keng Yap:
How to move a chair through a door. IEEE J. Robotics Autom. 3(3): 172-181 (1987) - [c22]Jianer Chen, Chee-Keng Yap:
Reversal complexity. SCT 1987: 14-19 - [c21]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - [c20]Chee Yap:
How to move a chair through a door. ICRA 1987: 1320-1325 - [c19]Chee-Keng Yap:
What Can be Parallelized in Computational Geometry?. Parallel Algorithms and Architectures 1987: 184-195 - 1986
- [j13]Jyun-Sheng Chang, Chee-Keng Yap:
A Polynomial Solution for the Potato-peeling Problem. Discret. Comput. Geom. 1: 155-182 (1986) - [j12]Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap:
New Upper Bounds for Neighbor Searching. Inf. Control. 68(1-3): 105-124 (1986) - [c18]S. Maddila, Chee-Keng Yap:
Moving a Polygon Around the Corner in a Corridor. SCG 1986: 187-192 - [c17]Steven Fortune, Gordon T. Wilfong, Chee Yap:
Coordinated motion of two robot arms. ICRA 1986: 1216-1223 - [c16]David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap:
Probing Convex Polytopes. STOC 1986: 424-432 - 1985
- [j11]Richard Cole, Chee-Keng Yap:
A Parallel Median Algorithm. Inf. Process. Lett. 20(3): 137-139 (1985) - [j10]Colm Ó'Dúnlaing, Chee-Keng Yap:
A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6(1): 104-111 (1985) - [j9]Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap:
Minimum area circumscribing Polygons. Vis. Comput. 1(2): 112-117 (1985) - [c15]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding minimal convex nested polygons. SCG 1985: 296-304 - [c14]Derick Wood, Chee-Keng Yap:
Computing a convex skill of an orthogonal polygon. SCG 1985: 311-315 - [c13]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract). FOCS 1985: 468-477 - [c12]Dexter Kozen, Chee-Keng Yap:
Algebraic Cell Decomposition in NC (Preliminary Version). FOCS 1985: 515-521 - 1984
- [j8]Colm Ó'Dúnlaing, Chee-Keng Yap:
Counting digraphs and hypergraphs. Bull. EATCS 24: 85-87 (1984) - [j7]Richard Cole, Chee-Keng Yap:
Geometric Retrieval Problems. Inf. Control. 63(1/2): 39-57 (1984) - [j6]Paul G. Spirakis, Chee-Keng Yap:
Strong NP-Hardness of Moving Many Discs. Inf. Process. Lett. 19(1): 55-59 (1984) - [j5]Richard Hull, Chee-Keng Yap:
The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544 (1984) - [c11]Jyun-Sheng Chang, Chee-Keng Yap:
A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems. FOCS 1984: 408-416 - [c10]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-hulls and Related Problems. STOC 1984: 154-166 - 1983
- [j4]Chee-Keng Yap:
A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. Inf. Process. Lett. 16(4): 181-182 (1983) - [j3]Chee-Keng Yap:
Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci. 26: 287-300 (1983) - [c9]Richard Cole, Chee-Keng Yap:
Geometric Retrieval Problems. FOCS 1983: 112-121 - [c8]Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Retraction: A New Approach to Motion-Planning (Extended Abstract). STOC 1983: 207-220 - 1982
- [c7]Colm Ó'Dúnlaing, Chee-Keng Yap:
Generic Transformation of Data Structures. FOCS 1982: 186-195 - [c6]Richard Hull, Chee-Keng Yap:
The Format Model: A Theory of Database Organization. PODS 1982: 205-211 - 1980
- [j2]Raymond E. Miller, Chee-Keng Yap:
On Formulating Simultaneity for Studying Parallelism and Synchronization. J. Comput. Syst. Sci. 20(2): 203-218 (1980) - [c5]Chee-Keng Yap:
Space-time Tradeoffs and First Order Problems in a Model of Programs. STOC 1980: 318-325
1970 – 1979
- 1978
- [c4]Chee-Keng Yap:
On Lifted Problems (Preliminary Reports). FOCS 1978: 267-279 - [c3]Raymond E. Miller, Chee-Keng Yap:
On the formal specification and analysis for loosely connected processes. Mathematical Studies of Information Processing 1978: 33-66 - [c2]Raymond E. Miller, Chee-Keng Yap:
On Formulating Simultaneity for Studying Parallelism and Synchronization. STOC 1978: 105-113 - 1977
- [c1]Ronald V. Book, Chee-Keng Yap:
On the Computational Power of Reversal-Bounded Machines. ICALP 1977: 111-119 - 1976
- [j1]Chee-Keng Yap:
New Upper Bounds for Selection. Commun. ACM 19(9): 501-508 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
