Chee-Keng Yap

Publication Activity (10 Years)

Years Active: 1976-2015
Publications (10 Years): 4

Top Venues

CoRR

SCG

ISVD

ISSAC

Publications

Amit Chattopadhyay, Gert Vegter, Chee-Keng Yap
Certified Computation of planar Morse-Smale Complexes. CoRR (2015)
Cong Wang, Yi-Jen Chiang, Chee-Keng Yap
On soft predicates in subdivision motion planning. Comput. Geom. 48 (8) (2015)
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 (2015)
Chee-Keng Yap
Soft Subdivision Search in Motion Planning, II: Axiomatics. FAW (2015)
Zhongdi Luo, Yi-Jen Chiang, Jyh-Ming Lien, Chee-Keng Yap
Resolution-Exact Algorithms for Link Robots. WAFR (2014)
Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap
Certified computation of planar morse-smale complexes. SCG (2012)
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) (2012)
Vikram Sharma, Chee-Keng Yap
Near optimal tree size bounds on a simple real root isolation algorithm. ISSAC (2012)
Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien
Towards Exact Numerical Voronoi Diagrams. ISVD (2012)
Chee-Keng Yap, Michael Sagraloff
A simple but exact and efficient algorithm for complex root isolation. ISSAC (2011)
Gert Vegter, Chee-Keng Yap
Foreword. Math. Comput. Sci. 4 (4) (2010)
Long Lin, Chee-Keng Yap
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. SCG (2009)
Chee-Keng Yap, Jihun Yu
Foundations of Exact Rounding. WALCOM (2009)
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) (2009)
Chee-Keng Yap
Exact numerical computation in algebra and geometry. ISSAC (2009)
W. Dale Brownawell, Chee-Keng Yap
Lower bounds for zero-dimensional projections. ISSAC (2009)
Chee-Keng Yap
In Praise of Numerical Computation. Efficient Algorithms (2009)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
Classroom examples of robustness problems in geometric computations. Comput. Geom. 40 (1) (2008)
Chee-Keng Yap
Theory of Real Computation According to EGC. Reliable Implementation of Real Number Algorithms (2008)
Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC (2008)
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) (2007)
Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap
Complete numerical isolation of real zeros in zero-dimensional triangular systems. ISSAC (2007)
Chee-Keng Yap, Hoon Hong
Foreword. Math. Comput. Sci. 1 (1) (2007)
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)
Chee-Keng Yap, Sylvain Pion
Special Issue on Robust Geometric Algorithms and their Implementations. Comput. Geom. 33 (1-2) (2006)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
Reply to "Backward Error Analysis ...". ICCSA (1) (2006)
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) (2006)
Ken Been, Eli Daiches, Chee-Keng Yap
Dynamic Map Labeling. IEEE Trans. Vis. Comput. Graph. 12 (5) (2006)
Chee-Keng Yap
Complete subdivision algorithms, I: intersection of Bezier curves. SCG (2006)
Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
Almost tight recursion tree bounds for the Descartes method. ISSAC (2006)
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)
Sylvain Pion, Chee-Keng Yap
Constructive root bound for k-ary rational input numbers. Theor. Comput. Sci. 369 (1-3) (2006)
Chen Li, Sylvain Pion, Chee-Keng Yap
Recent progress in exact geometric computation. J. Log. Algebraic Methods Program. 64 (1) (2005)
Vikram Sharma, Zilin Du, Chee-Keng Yap
Robust Approximate Zeros. ESA (2005)
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap
Shortest path amidst disc obstacles is computable. SCG (2005)
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
-Link Shortest Paths in Weighted Subdivisions. WADS (2005)
Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap
Shortest Paths for Disc Obstacles. ICCSA (3) (2004)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
Classroom Examples of Robustness Problems in Geometric Computations. ESA (2004)
Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. 31 (1) (2004)
Ee-Chien Chang, Chee-Keng Yap
Competitive On-Line Scheduling with Level of Service. J. Sched. 6 (3) (2003)
Sylvain Pion, Chee-Keng Yap
-ary rational input numbers. SCG (2003)
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)
Chee-Keng Yap, Kenneth Been, Zilin Du
Responsive scalable thinwire visualization: application to large geographic datasets. Visualization and Data Analysis (2002)
Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
Pseudo approximation algorithms, with applications to optimal motion planning. SCG (2002)
Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap
Hypergeometric Functions in Exact Geometric Computation. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
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)
Chen Li, Chee-Keng Yap
A new constructive root bound for algebraic expressions. SODA (2001)
Ee-Chien Chang, Chee-Keng Yap
Competitive Online Scheduling with Level of Service. COCOON (2001)
Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
Smallest Enclosing Cylinders. Algorithmica 27 (2) (2000)
Ee-Chien Chang, Chee-Keng Yap
A Simultaneous Search Problem. Algorithmica 26 (2) (2000)
Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29 (5) (2000)
Daniela Tulone, Chee-Keng Yap, Chen Li
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. Automated Deduction in Geometry (2000)
Vijay Karamcheti, Chen Li, Igor Pechtchanski, Chee-Keng Yap
A Core Library for Robust Numeric and Geometric Computation. SCG (1999)
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 (1999)
Dan Halperin, Chee-Keng Yap
Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9 (3) (1998)
Chee-Keng Yap
Towards Exact Geometric Computation. Comput. Geom. 7 (1997)
Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
A Complete Roundness Classification Procedure. SCG (1997)
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) (1997)
Ee-Chien Chang, Chee-Keng Yap
A Wavelet Approach to Foveating Images. SCG (1997)
Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
Approximate Euclidean Shortest Paths in 3-Space. Int. J. Comput. Geom. Appl. 7 (4) (1997)
Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
Efficient Algorithms for the Smallest Enclosing Cylinder Problem. CCCG (1996)
Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
Smallest Enclosing Cylinders. SCG (1996)
Chung-Jen Ho, Chee-Keng Yap
The Habicht Approch to Subresultants. J. Symb. Comput. 21 (1) (1996)
Joonsoo Choi, Chee-Keng Yap
-Space (Extended Abstract). SCG (1996)
Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
-Optimal Motion for a Rod (Extended Abstract). SCG (1996)
Ee-Chien Chang, Chee-Keng Yap
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Inf. Process. Lett. 55 (3) (1995)
Diane L. Souvaine, Chee-Keng Yap
Combinatorial Complexity of Signed Discs. Comput. Geom. 5 (1995)
Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA (1995)
Joonsoo Choi, Chee-Keng Yap
Rectilinear Geodesics in 3-Space (Extended Abstract). SCG (1995)
Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). SCG (1995)
Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
Approximate Euclidean Shortest Path in 3-Space. SCG (1994)
Thomas Dubé, Chee-Keng Yap
The Geometry in Constraint Logic Programs. PPCP (1993)
Diane L. Souvaine, Chee-Keng Yap
Combinatorial Complexity of Signed Discs (Extended Abstract). WADS (1993)
Dan Halperin, Chee-Keng Yap
Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. SCG (1993)
Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
Shortest Paths for Line Segments. Algorithmica 10 (2-4) (1993)
Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9 (2) (1993)
Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8 (5&6) (1992)
David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discret. Comput. Geom. 7 (1992)
Stephen Cameron, Chee-Keng Yap
Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ACM Trans. Graph. 11 (1) (1992)
Chee-Keng Yap
Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) FOCS (1992)
Kurt Mehlhorn, Chee-Keng Yap
Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20 (4) (1991)
Mark H. Overmars, Chee-Keng Yap
New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20 (6) (1991)
Jianer Chen, Chee-Keng Yap
Reversal Complexity. SIAM J. Comput. 20 (4) (1991)
Chee-Keng Yap
A New Lower Bound Construction for Commutative Thue Systems with aApplications. J. Symb. Comput. 12 (1) (1991)
James Cox, Chee-Keng Yap
On-line Motion Planning: Case of a Planar Rod. Ann. Math. Artif. Intell. 3 (1) (1991)
David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping STOC (1990)
Chee-Keng Yap
Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Comput. Syst. Sci. 40 (1) (1990)
Chee-Keng Yap
Symbolic Treatment of Geometric Degeneration. J. Symb. Comput. 10 (3/4) (1990)
Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
On Simultaneous Inner and Outer Approximation of Shapes. SCG (1990)
Gert Vegter, Chee-Keng Yap
Computational Complexity of Combinatorial Surfaces. SCG (1990)
Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
Finding Minimal Convex Nested Polygons Inf. Comput. 83 (1) (1989)
Bud Mishra, Chee-Keng Yap
Notes on Gröbner bases. Inf. Sci. 48 (3) (1989)
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)
Chee-Keng Yap, Helmut Alt
Motion Planning in the CL-Environment (Extended Abstract). WADS (1989)
Chee-Keng Yap
Editor's Foreword: Special Issue on Computational Geometry. Algorithmica 4 (1) (1989)
William 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 (1988)
Chee-Keng Yap
Applications of a Symbolic Perturbation Scheme (Abstract). SWAT (1988)
Chee-Keng Yap
A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. SCG (1988)
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
Parallel Computational Geometry. Algorithmica 3 (1988)
Mark H. Overmars, Chee-Keng Yap
New upper bounds in Klee's measure problem (extended abstract) FOCS (1988)

Chee-Keng Yap.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Chee-Keng Yap