Chee-Keng Yap

According to our database, Chee-Keng Yap authored at least 172 papers between 1976 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

An algorithmic approach to small limit cycles of nonlinear differential systems: The averaging method revisited.

Bo Huang, Chee Yap

J. Symb. Comput., 2023

Symbolic-Numeric Parameter Estimation Software Package in Julia.

Soo Go, Hoon Hong, Ilia Ilmer, Alexey Ovchinnikov, Pedro Soto, Chee Yap

CoRR, 2023

Range Functions of Any Convergence Order and Their Amortized Complexity Analysis.

Kai Hormann, Chee Yap, Ya Shi Zhang

Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022

Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition).

Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Clustering Complex Zeros of Triangular Systems of Polynomials.

Rémi Imbach, Marc Pouget, Chee Yap

Math. Comput. Sci., 2021

The D-plus Discriminant and Complexity of Root Clustering.

Jing Yang, Chee K. Yap

CoRR, 2021

Soft subdivision motion planning for complex planar robots.

Bo Zhou, Yi-Jen Chiang, Chee Yap

Comput. Geom., 2021

Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation.

Kai Hormann, Lucas Kania, Chee Yap

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Certified Approximation Algorithms for the Fermat Point and n-Ellipses.

Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Special Issue on Symbolic and Algebraic Computation: ISSAC 2017.

Mohab Safey El Din, Chee Yap

J. Symb. Comput., 2020

On mu-Symmetric Polynomials.

Jing Yang, Chee K. Yap

CoRR, 2020

2019

SIAN: a tool for assessing structural identifiability of parametric ODEs.

Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap

ACM Commun. Comput. Algebra, 2019

SIAN: software for structural identifiability analysis of ODE models.

Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap

Bioinform., 2019

Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis.

Juan Xu, Chee Yap

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method Revisited.

Bo Huang, Chee Yap

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Towards Soft Exact Computation (Invited Talk).

Chee Yap

Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

Root-Finding with Implicit Deflation.

Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias S. Kotsireas, Vitaly Zaderman

Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

2018

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap

J. Symb. Comput., 2018

An Approach for Certifying Homotopy Continuation Paths: Univariate Case.

Juan Xu, Michael A. Burr, Chee Yap

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

On \mu μ -Symmetric Polynomials and D-Plus.

Jing Yang, Chee K. Yap

Proceedings of the Mathematical Software - ICMS 2018, 2018

Implementation of a Near-Optimal Complex Root Clustering Algorithm.

Rémi Imbach, Victor Y. Pan, Chee Yap

Proceedings of the Mathematical Software - ICMS 2018, 2018

2017

Preface.

Jianxin Wang, Chee K. Yap

Theor. Comput. Sci., 2017

Certified computation of planar Morse-Smale complexes.

Amit Chattopadhyay, Gert Vegter, Chee K. Yap

J. Symb. Comput., 2017

Amortized analysis of smooth quadtrees in all dimensions.

Huck Bennett, Chee Yap

Comput. Geom., 2017

2016

Robust Geometric Computation.

Chee K. Yap, Vikram Sharma

Encyclopedia of Algorithms, 2016

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.

Huck Bennett, Evanthia Papadopoulou, Chee Yap

Comput. Graph. Forum, 2016

Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots.

Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu

Proceedings of the Algorithmic Foundations of Robotics XII, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Path Planning for Simple Robots using Soft Subdivision Search.

Ching-Hsiang Hsu, John Paul Ryan, Chee Yap

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap

CoRR, 2015

On soft predicates in subdivision motion planning.

Cong Wang, Yi-Jen Chiang, Chee-Keng Yap

Comput. Geom., 2015

Soft Subdivision Search in Motion Planning, II: Axiomatics.

Chee-Keng Yap

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

Proceedings of the 1st Workshop on Robotics Challenges and Vision (RCV2013).

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

CoRR, 2014

Resolution-Exact Algorithms for Link Robots.

Zhongdi Luo, Yi-Jen Chiang, Jyh-Ming Lien, Chee-Keng Yap

Proceedings of the Algorithmic Foundations of Robotics XI, 2014

Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.

Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap

Proceedings of the Mathematical Software - ICMS 2014, 2014

2013

Non-local isotopic approximation of nonsingular surfaces.

Long Lin, Chee Yap, Jihun Yu

Comput. Aided Des., 2013

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.

Chee Yap, Michael Sagraloff, Vikram Sharma

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves.

Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap

J. Symb. Comput., 2012

Explicit Mesh Surfaces for Particle Based Fluids.

Jihun Yu, Chris Wojtan, Greg Turk, Chee Yap

Comput. Graph. Forum, 2012

Towards Exact Numerical Voronoi Diagrams.

Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

Near optimal tree size bounds on a simple real root isolation algorithm.

Vikram Sharma, Chee-Keng Yap

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach.

Long Lin, Chee Yap

Discret. Comput. Geom., 2011

A Real Elementary Approach to the Master Recurrence and Generalizations.

Chee Yap

Proceedings of the Theory and Applications of Models of Computation, 2011

Empirical study of an evaluation-based subdivision algorithm for complex root isolation.

Narayan Kamath, Irina Voiculescu, Chee K. Yap

Proceedings of the SNC 2011, 2011

A simple but exact and efficient algorithm for complex root isolation.

Chee-Keng Yap, Michael Sagraloff

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Foreword.

Gert Vegter, Chee-Keng Yap

Math. Comput. Sci., 2010

The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra.

Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann

Proceedings of the Mathematical Software, 2010

2009

Complete numerical isolation of real roots in zero-dimensional triangular systems.

Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap

J. Symb. Comput., 2009

Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique.

Michael A. Burr, Felix Krahmer, Chee Yap

Electron. Colloquium Comput. Complex., 2009

Foundations of Exact Rounding.

Chee-Keng Yap, Jihun Yu

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Exact numerical computation in algebra and geometry.

Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Lower bounds for zero-dimensional projections.

W. Dale Brownawell, Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach.

Long Lin, Chee-Keng Yap

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

In Praise of Numerical Computation.

Chee-Keng Yap

Proceedings of the Efficient Algorithms, 2009

2008

Robust Geometric Computation.

Chee-Keng Yap, Vikram Sharma

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Classroom examples of robustness problems in geometric computations.

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap

Comput. Geom., 2008

Theory of Real Computation According to EGC.

Chee-Keng Yap

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

2007

Foreword.

Chee-Keng Yap, Hoon Hong

Math. Comput. Sci., 2007

Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions.

Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap

Int. J. Comput. Geom. Appl., 2007

Complete numerical isolation of real zeros in zero-dimensional triangular systems.

Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Dynamic Map Labeling.

Ken Been, Eli Daiches, Chee-Keng Yap

IEEE Trans. Vis. Comput. Graph., 2006

Constructive root bound for k-ary rational input numbers.

Sylvain Pion, Chee-Keng Yap

Theor. Comput. Sci., 2006

Shortest Path amidst Disc Obstacles Is Computable.

Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap

Int. J. Comput. Geom. Appl., 2006

Special Issue on Robust Geometric Algorithms and their Implementations.

Chee-Keng Yap, Sylvain Pion

Comput. Geom., 2006

An Experimental Study of Weighted k-Link Shortest Path Algorithms.

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap

Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Almost tight recursion tree bounds for the Descartes method.

Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Reply to "Backward Error Analysis ...".

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap

Proceedings of the Computational Science and Its Applications, 2006

Complete subdivision algorithms, I: intersection of Bezier curves.

Chee-Keng Yap

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Recent progress in exact geometric computation.

Chen Li, Sylvain Pion, Chee-Keng Yap

J. Log. Algebraic Methods Program., 2005

<i>k</i>-Link Shortest Paths in Weighted Subdivisions.

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Robust Approximate Zeros.

Vikram Sharma, Zilin Du, Chee-Keng Yap

Proceedings of the Algorithms, 2005

2004

Robust geometric computation.

Chee K. Yap

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Pseudo Approximation Algorithms with Applications to Optimal Motion Planning.

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap

Discret. Comput. Geom., 2004

Shortest Paths for Disc Obstacles.

Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap

Proceedings of the Computational Science and Its Applications, 2004

2003

Competitive On-Line Scheduling with Level of Service.

Ee-Chien Chang, Chee-Keng Yap

J. Sched., 2003

Constructive root bound for <tt>k</tt>-ary rational input numbers.

Sylvain Pion, Chee-Keng Yap

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard.

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Hypergeometric Functions in Exact Geometric Computation.

Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap

Proceedings of the Computability and Complexity in Analysis, 2002

Different Manhattan project: automatic statistical model generation.

Chee-Keng Yap, Henning Biermann, Aaron Hertzmann, Chen Li, Jon Meyer, Hsing-Kuo Pao, Salvatore Paxia

Proceedings of the Visualization and Data Analysis 2002, 2002

Responsive scalable thinwire visualization: application to large geographic datasets.

Chee-Keng Yap, Kenneth Been, Zilin Du

Proceedings of the Visualization and Data Analysis 2002, 2002

2001

A new constructive root bound for algebraic expressions.

Chen Li, Chee-Keng Yap

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Competitive Online Scheduling with Level of Service.

Ee-Chien Chang, Chee-Keng Yap

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Yet another look at fractional cascading: B-graphs with application to point location.

Chee Yap, Yunyue Zhu

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Precision-Sensitive Euclidean Shortest Path in 3-Space.

Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap

SIAM J. Comput., 2000

Smallest Enclosing Cylinders.

Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap

Algorithmica, 2000

A Simultaneous Search Problem.

Ee-Chien Chang, Chee-Keng Yap

Algorithmica, 2000

Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving.

Daniela Tulone, Chee-Keng Yap, Chen Li

Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000

Fundamental problems of algorithmic algebra.

Chee-Keng Yap

Oxford University Press, ISBN: 978-0-19-512516-0, 2000

1999

Emerging Challenges in Computational Topology

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

CoRR, 1999

A Core Library for Robust Numeric and Geometric Computation.

Vijay Karamcheti, Chen Li, Igor Pechtchanski, Chee-Keng Yap

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Combinatorial complexity of translating a box in polyhedral 3-space.

Dan Halperin, Chee-Keng Yap

Comput. Geom., 1998

1997

Approximate Euclidean Shortest Paths in 3-Space.

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap

Int. J. Comput. Geom. Appl., 1997

Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams.

Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap

Discret. Comput. Geom., 1997

Towards Exact Geometric Computation.

Chee-Keng Yap

Comput. Geom., 1997

A Complete Roundness Classification Procedure.

Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A Wavelet Approach to Foveating Images.

Ee-Chien Chang, Chee-Keng Yap

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

The Habicht Approch to Subresultants.

Chung-Jen Ho, Chee-Keng Yap

J. Symb. Comput., 1996

Monotonicity of Rectilinear Geodesics in <i>d</i>-Space (Extended Abstract).

Joonsoo Choi, Chee-Keng Yap

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

<i>d</i>₁-Optimal Motion for a Rod (Extended Abstract).

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Efficient Algorithms for the Smallest Enclosing Cylinder Problem.

Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space.

Ee-Chien Chang, Chee-Keng Yap

Inf. Process. Lett., 1995

Combinatorial Complexity of Signed Discs.

Diane L. Souvaine, Chee-Keng Yap

Comput. Geom., 1995

Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three.

Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Rectilinear Geodesics in 3-Space (Extended Abstract).

Joonsoo Choi, Chee-Keng Yap

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract).

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Approximate Euclidean Shortest Path in 3-Space.

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Shortest Paths for Line Segments.

Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1993

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap

Algorithmica, 1993

Combinatorial Complexity of Signed Discs (Extended Abstract).

Diane L. Souvaine, Chee-Keng Yap

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

The Geometry in Constraint Logic Programs.

Thomas Dubé, Chee-Keng Yap

Proceedings of the Principles and Practice of Constraint Programming, 1993

Low Level Issues in Computational Geometry.

Chee Yap

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Refinement Methods for Geometric Bounds in Constructive Solid Geometry.

Stephen Cameron, Chee-Keng Yap

ACM Trans. Graph., 1992

Quantitative Steinitz's Theorems Applications to Multifingered Grasping.

David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap

Discret. Comput. Geom., 1992

Simultaneous Inner and Outer Approximation of Shapes.

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1992

Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract)

Chee-Keng Yap

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

New Upper Bounds in Klee's Measure Problem.

Mark H. Overmars, Chee-Keng Yap

SIAM J. Comput., 1991

Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves.

Kurt Mehlhorn, Chee-Keng Yap

SIAM J. Comput., 1991

Reversal Complexity.

Jianer Chen, Chee-Keng Yap

SIAM J. Comput., 1991

A New Lower Bound Construction for Commutative Thue Systems with aApplications.

Chee-Keng Yap

J. Symb. Comput., 1991

On-line Motion Planning: Case of a Planar Rod.

James Cox, Chee-Keng Yap

Ann. Math. Artif. Intell., 1991

1990

Symbolic Treatment of Geometric Degeneration.

Chee-Keng Yap

J. Symb. Comput., 1990

Geometric Consistency Theorem for a Symbolic Perturbation Scheme.

Chee-Keng Yap

J. Comput. Syst. Sci., 1990

Computational Complexity of Combinatorial Surfaces.

Gert Vegter, Chee-Keng Yap

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Probing Convex Polytopes.

David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap

Proceedings of the Autonomous Robot Vehicles, 1990

1989

Finding Minimal Convex Nested Polygons

Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap

Inf. Comput., October, 1989

Notes on Gröbner bases.

Bud Mishra, Chee-Keng Yap

Inf. Sci., 1989

Editor's Foreword: Special Issue on Computational Geometry.

Chee-Keng Yap

Algorithmica, 1989

Motion Planning in the CL-Environment (Extended Abstract).

Chee-Keng Yap, Helmut Alt

Proceedings of the Algorithms and Data Structures, 1989

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the Algorithms and Data Structures, 1989

1988

The Orthogonal Convex Skull Problem.

Derick Wood, Chee-Keng Yap

Discret. Comput. Geom., 1988

Computing the Link Center of a Simple Polygon.

William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap

Discret. Comput. Geom., 1988

Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map.

Chee-Keng Yap

Algorithmica, 1988

Parallel Computational Geometry.

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Algorithmica, 1988

Applications of a Symbolic Perturbation Scheme (Abstract).

Chee-Keng Yap

Proceedings of the SWAT 88, 1988

Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves.

Kurt Mehlhorn, Chee-Keng Yap

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

New upper bounds in Klee's measure problem (extended abstract)

Mark H. Overmars, Chee-Keng Yap

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

The Design of LINETOOL, a Geometric Editor.

L. W. Ericson, Chee-Keng Yap

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

How to move a chair through a door.

Chee-Keng Yap

IEEE J. Robotics Autom., 1987

On k-Hulls and Related Problems.

Richard Cole, Micha Sharir, Chee-Keng Yap

SIAM J. Comput., 1987

Shape from Probing.

Richard Cole, Chee-Keng Yap

J. Algorithms, 1987

An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.

Chee-Keng Yap

Discret. Comput. Geom., 1987

Preface Special Issue on Robotics.

Chee-Keng Yap

Algorithmica, 1987

Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap

Algorithmica, 1987

What Can be Parallelized in Computational Geometry?.

Chee-Keng Yap

Proceedings of the Parallel Algorithms and Architectures, 1987

1986

New Upper Bounds for Neighbor Searching

Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap

Inf. Control., 1986

A Polynomial Solution for the Potato-peeling Problem.

Jyun-Sheng Chang, Chee-Keng Yap

Discret. Comput. Geom., 1986

Probing Convex Polytopes

David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Coordinated motion of two robot arms.

Steven Fortune, Gordon T. Wilfong, Chee Yap

Proceedings of the 1986 IEEE International Conference on Robotics and Automation, 1986

Moving a Polygon Around the Corner in a Corridor.

S. Maddila, Chee-Keng Yap

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Minimum area circumscribing Polygons.

Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap

Vis. Comput., 1985

A "Retraction" Method for Planning the Motion of a Disc.

Colm Ó'Dúnlaing, Chee-Keng Yap

J. Algorithms, 1985

A Parallel Median Algorithm.

Richard Cole, Chee-Keng Yap

Inf. Process. Lett., 1985

Algebraic Cell Decomposition in NC (Preliminary Version)

Dexter Kozen, Chee-Keng Yap

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Parallel Computational Geometry (Extended Abstract)

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Computing a convex skill of an orthogonal polygon.

Derick Wood, Chee-Keng Yap

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

The Format Model: A Theory of database Organization.

Richard Hull, Chee-Keng Yap

J. ACM, 1984

Strong NP-Hardness of Moving Many Discs.

Paul G. Spirakis, Chee-Keng Yap

Inf. Process. Lett., 1984

Geometric Retrieval Problems

Richard Cole, Chee-Keng Yap

Inf. Control., 1984

Counting digraphs and hypergraphs.

Colm Ó'Dúnlaing, Chee-Keng Yap

Bull. EATCS, 1984

A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems

Jyun-Sheng Chang, Chee-Keng Yap

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Some Consequences of Non-Uniform Conditions on Uniform Classes.

Chee-Keng Yap

Theor. Comput. Sci., 1983

A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs.

Chee-Keng Yap

Inf. Process. Lett., 1983

Retraction: A New Approach to Motion-Planning (Extended Abstract)

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

Generic Transformation of Data Structures

Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1980

On Formulating Simultaneity for Studying Parallelism and Synchronization.

Raymond E. Miller, Chee-Keng Yap

J. Comput. Syst. Sci., 1980

Space-time Tradeoffs and First Order Problems in a Model of Programs

Chee-Keng Yap

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978

On the formal specification and analysis for loosely connected processes.

Raymond E. Miller, Chee-Keng Yap

Proceedings of the Mathematical Studies of Information Processing, 1978

On Lifted Problems (Preliminary Reports)

Chee-Keng Yap

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

On the Computational Power of Reversal-Bounded Machines.

Ronald V. Book, Chee-Keng Yap

Proceedings of the Automata, 1977

1976

New Upper Bounds for Selection.

Chee-Keng Yap

Commun. ACM, 1976