Chee-Keng Yap

According to our database1, Chee-Keng Yap
  • authored at least 172 papers between 1976 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput., 2018

2017
Preface.
Theor. Comput. Sci., 2017

Certified computation of planar Morse-Smale complexes.
J. Symb. Comput., 2017

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

Amortized analysis of smooth quadtrees in all dimensions.
Comput. Geom., 2017

2016
Robust Geometric Computation.
Encyclopedia of Algorithms, 2016

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.
Comput. Graph. Forum, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Path Planning for Simple Robots using Soft Subdivision Search.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Certified Computation of planar Morse-Smale Complexes.
CoRR, 2015

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

On soft predicates in subdivision motion planning.
Comput. Geom., 2015

Soft Subdivision Search in Motion Planning, II: Axiomatics.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

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

Resolution-Exact Algorithms for Link Robots.
Proceedings of the Algorithmic Foundations of Robotics XI, 2014

Amortized Analysis of Smooth Quadtrees in All Dimensions.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Non-local isotopic approximation of nonsingular surfaces.
Computer-Aided Design, 2013

On soft predicates in subdivision motion planning.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves.
J. Symb. Comput., 2012

Explicit Mesh Surfaces for Particle Based Fluids.
Comput. Graph. Forum, 2012

Towards Exact Numerical Voronoi Diagrams.
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.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Certified computation of planar morse-smale complexes.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach.
Discrete & Computational Geometry, 2011

Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves
CoRR, 2011

A Real Elementary Approach to the Master Recurrence and Generalizations.
Proceedings of the Theory and Applications of Models of Computation, 2011

Empirical study of an evaluation-based subdivision algorithm for complex root isolation.
Proceedings of the SNC 2011, 2011

A simple but exact and efficient algorithm for complex root isolation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Foreword.
Mathematics in Computer Science, 2010

The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra.
Proceedings of the Mathematical Software, 2010

2009
Complete numerical isolation of real roots in zero-dimensional triangular systems.
J. Symb. Comput., 2009

Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Foundations of Exact Rounding.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Exact numerical computation in algebra and geometry.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Lower bounds for zero-dimensional projections.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

In Praise of Numerical Computation.
Proceedings of the Efficient Algorithms, 2009

2008
Robust Geometric Computation.
Proceedings of the Encyclopedia of Algorithms, 2008

Classroom examples of robustness problems in geometric computations.
Comput. Geom., 2008

Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Theory of Real Computation According to EGC.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

2007
Foreword.
Mathematics in Computer Science, 2007

Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions.
Int. J. Comput. Geometry Appl., 2007

Complete numerical isolation of real zeros in zero-dimensional triangular systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Dynamic Map Labeling.
IEEE Trans. Vis. Comput. Graph., 2006

Constructive root bound for k-ary rational input numbers.
Theor. Comput. Sci., 2006

Shortest Path amidst Disc Obstacles Is Computable.
Int. J. Comput. Geometry Appl., 2006

Special Issue on Robust Geometric Algorithms and their Implementations.
Comput. Geom., 2006

An Experimental Study of Weighted k-Link Shortest Path Algorithms.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Almost tight recursion tree bounds for the Descartes method.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Reply to "Backward Error Analysis ...".
Proceedings of the Computational Science and Its Applications, 2006

Complete subdivision algorithms, I: intersection of Bezier curves.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Recent progress in exact geometric computation.
J. Log. Algebr. Program., 2005

k-Link Shortest Paths in Weighted Subdivisions.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Robust Approximate Zeros.
Proceedings of the Algorithms, 2005

Shortest path amidst disc obstacles is computable.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

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

Pseudo Approximation Algorithms with Applications to Optimal Motion Planning.
Discrete & Computational Geometry, 2004

Shortest Paths for Disc Obstacles.
Proceedings of the Computational Science and Its Applications, 2004

Classroom Examples of Robustness Problems in Geometric Computations.
Proceedings of the Algorithms, 2004

2003
Competitive On-Line Scheduling with Level of Service.
J. Scheduling, 2003

Constructive root bound for k-ary rational input numbers.
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.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Hypergeometric Functions in Exact Geometric Computation.
Electr. Notes Theor. Comput. Sci., 2002

Different Manhattan project: automatic statistical model generation.
Proceedings of the Visualization and Data Analysis 2002, 2002

Responsive scalable thinwire visualization: application to large geographic datasets.
Proceedings of the Visualization and Data Analysis 2002, 2002

Pseudo approximation algorithms, with applications to optimal motion planning.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
A new constructive root bound for algebraic expressions.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Competitive Online Scheduling with Level of Service.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Yet another look at fractional cascading: B-graphs with application to point location.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Precision-Sensitive Euclidean Shortest Path in 3-Space.
SIAM J. Comput., 2000

Smallest Enclosing Cylinders.
Algorithmica, 2000

A Simultaneous Search Problem.
Algorithmica, 2000

Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000

Fundamental problems of algorithmic algebra.
Oxford University Press, ISBN: 978-0-19-512516-0, 2000

1999
Emerging Challenges in Computational Topology
CoRR, 1999

A Core Library for Robust Numeric and Geometric Computation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Combinatorial complexity of translating a box in polyhedral 3-space.
Comput. Geom., 1998

1997
Approximate Euclidean Shortest Paths in 3-Space.
Int. J. Comput. Geometry Appl., 1997

Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams.
Discrete & Computational Geometry, 1997

Towards Exact Geometric Computation.
Comput. Geom., 1997

A Complete Roundness Classification Procedure.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A Wavelet Approach to Foveating Images.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
The Habicht Approch to Subresultants.
J. Symb. Comput., 1996

Smallest Enclosing Cylinders.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract).
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

d1-Optimal Motion for a Rod (Extended Abstract).
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Efficient Algorithms for the Smallest Enclosing Cylinder Problem.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space.
Inf. Process. Lett., 1995

Combinatorial Complexity of Signed Discs.
Comput. Geom., 1995

Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Rectilinear Geodesics in 3-Space (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Approximate Euclidean Shortest Path in 3-Space.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Shortest Paths for Line Segments.
Algorithmica, 1993

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

Combinatorial Complexity of Signed Discs (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

The Geometry in Constraint Logic Programs.
PPCP, 1993

Combinatorial Complexity of Translating a Box in Polyhedral 3-Space.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Low Level Issues in Computational Geometry.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Refinement Methods for Geometric Bounds in Constructive Solid Geometry.
ACM Trans. Graph., 1992

Quantitative Steinitz's Theorems Applications to Multifingered Grasping.
Discrete & Computational Geometry, 1992

Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica, 1992

Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
New Upper Bounds in Klee's Measure Problem.
SIAM J. Comput., 1991

Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves.
SIAM J. Comput., 1991

Reversal Complexity.
SIAM J. Comput., 1991

A New Lower Bound Construction for Commutative Thue Systems with aApplications.
J. Symb. Comput., 1991

On-line Motion Planning: Case of a Planar Rod.
Ann. Math. Artif. Intell., 1991

1990
Symbolic Treatment of Geometric Degeneration.
J. Symb. Comput., 1990

Geometric Consistency Theorem for a Symbolic Perturbation Scheme.
J. Comput. Syst. Sci., 1990

Quantitative Steinitz's Theorems with Applications to Multifingered Grasping
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Computational Complexity of Combinatorial Surfaces.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

On Simultaneous Inner and Outer Approximation of Shapes.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Finding Minimal Convex Nested Polygons
Inf. Comput., October, 1989

Notes on Gröbner bases.
Inf. Sci., 1989

Editor's Foreword: Special Issue on Computational Geometry.
Algorithmica, 1989

Motion Planning in the CL-Environment (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989

1988
The Orthogonal Convex Skull Problem.
Discrete & Computational Geometry, 1988

Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1988

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

Parallel Computational Geometry.
Algorithmica, 1988

Applications of a Symbolic Perturbation Scheme (Abstract).
Proceedings of the SWAT 88, 1988

Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

New upper bounds in Klee's measure problem (extended abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

A Geometric Consistency Theorem for a Symbolic Perturbation Scheme.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

The Design of LINETOOL, a Geometric Editor.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
How to move a chair through a door.
IEEE J. Robotics and Automation, 1987

On k-Hulls and Related Problems.
SIAM J. Comput., 1987

Shape from Probing.
J. Algorithms, 1987

An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
Discrete & Computational Geometry, 1987

Preface Special Issue on Robotics.
Algorithmica, 1987

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

What Can be Parallelized in Computational Geometry?.
Proceedings of the Parallel Algorithms and Architectures, 1987

How to move a chair through a door.
Proceedings of the 1987 IEEE International Conference on Robotics and Automation, Raleigh, North Carolina, USA, March 31, 1987

Computing the Link Center of a Simple Polygon.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Reversal complexity.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986
New Upper Bounds for Neighbor Searching
Information and Control, 1986

A Polynomial Solution for the Potato-peeling Problem.
Discrete & Computational Geometry, 1986

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

Coordinated motion of two robot arms.
Proceedings of the 1986 IEEE International Conference on Robotics and Automation, 1986

Moving a Polygon Around the Corner in a Corridor.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Minimum area circumscribing Polygons.
The Visual Computer, 1985

A "Retraction" Method for Planning the Motion of a Disc.
J. Algorithms, 1985

A Parallel Median Algorithm.
Inf. Process. Lett., 1985

Algebraic Cell Decomposition in NC (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Parallel Computational Geometry (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Computing a convex skill of an orthogonal polygon.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

Finding minimal convex nested polygons.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
The Format Model: A Theory of database Organization.
J. ACM, 1984

Strong NP-Hardness of Moving Many Discs.
Inf. Process. Lett., 1984

Geometric Retrieval Problems
Information and Control, 1984

Counting digraphs and hypergraphs.
Bulletin of the EATCS, 1984

On k-hulls and Related Problems
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Some Consequences of Non-Uniform Conditions on Uniform Classes.
Theor. Comput. Sci., 1983

A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs.
Inf. Process. Lett., 1983

Retraction: A New Approach to Motion-Planning (Extended Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Geometric Retrieval Problems
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
The Format Model: A Theory of Database Organization.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Generic Transformation of Data Structures
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1980
On Formulating Simultaneity for Studying Parallelism and Synchronization.
J. Comput. Syst. Sci., 1980

Space-time Tradeoffs and First Order Problems in a Model of Programs
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978
On Formulating Simultaneity for Studying Parallelism and Synchronization
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

On the formal specification and analysis for loosely connected processes.
Proceedings of the Mathematical Studies of Information Processing, 1978

On Lifted Problems (Preliminary Reports)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
On the Computational Power of Reversal-Bounded Machines.
Proceedings of the Automata, 1977

1976
New Upper Bounds for Selection.
Commun. ACM, 1976


  Loading...