Chee-Keng Yap - RankMe

144 papers A* 19A 2B 11C 3Misc 5Journal 65Unranked 37

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
2015	J	`jnl`	Certified Computation of planar Morse-Smale Complexes. CoRR Amit Chattopadhyay, Gert Vegter, Chee-Keng Yap
2015	Misc	`ed.`	Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings FAW Jianxin Wang, Chee-Keng Yap
2015	J	`jnl`	On soft predicates in subdivision motion planning. Comput. Geom. Cong Wang, Yi-Jen Chiang, Chee-Keng Yap
2015	Misc	`conf`	Soft Subdivision Search in Motion Planning, II: Axiomatics. FAW Chee-Keng Yap
2014	C	`conf`	Resolution-Exact Algorithms for Link Robots. WAFR Zhongdi Luo, Yi-Jen Chiang, Jyh-Ming Lien, Chee-Keng Yap
2012	—	`conf`	Certified computation of planar morse-smale complexes. SCG Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap
2012	J	`jnl`	Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symb. Comput. Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap
2012	B	`conf`	Near optimal tree size bounds on a simple real root isolation algorithm. ISSAC Vikram Sharma, Chee-Keng Yap
2012	—	`conf`	Towards Exact Numerical Voronoi Diagrams. ISVD Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien
2011	B	`conf`	A simple but exact and efficient algorithm for complex root isolation. ISSAC Chee-Keng Yap, Michael Sagraloff
2010	J	`jnl`	Foreword. Math. Comput. Sci. Gert Vegter, Chee-Keng Yap
2009	—	`conf`	Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. SCG Long Lin, Chee-Keng Yap
2009	J	`jnl`	Complete numerical isolation of real roots in zero-dimensional triangular systems. J. Symb. Comput. Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap
2009	B	`conf`	Exact numerical computation in algebra and geometry. ISSAC Chee-Keng Yap
2009	B	`conf`	Foundations of Exact Rounding. WALCOM Chee-Keng Yap, Jihun Yu
2009	—	`conf`	In Praise of Numerical Computation. Efficient Algorithms Chee-Keng Yap
2009	B	`conf`	Lower bounds for zero-dimensional projections. ISSAC W. Dale Brownawell, Chee-Keng Yap
2008	J	`jnl`	Classroom examples of robustness problems in geometric computations. Comput. Geom. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2008	B	`conf`	Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap
2008	—	`ch.`	Robust Geometric Computation. Encyclopedia of Algorithms Chee-Keng Yap, Vikram Sharma
2008	—	`conf`	Theory of Real Computation According to EGC. Reliable Implementation of Real Number Algorithms Chee-Keng Yap
2007	B	`conf`	Complete numerical isolation of real zeros in zero-dimensional triangular systems. ISSAC Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap
2007	J	`jnl`	Foreword. Math. Comput. Sci. Chee-Keng Yap, Hoon Hong
2007	J	`jnl`	Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. Int. J. Comput. Geom. Appl. Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap
2006	B	`conf`	Almost tight recursion tree bounds for the Descartes method. ISSAC Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
2006	C	`conf`	An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
2006	—	`conf`	Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. SCG Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
2006	—	`conf`	Complete subdivision algorithms, I: intersection of Bezier curves. SCG Chee-Keng Yap
2006	J	`jnl`	Constructive root bound for k-ary rational input numbers. Theor. Comput. Sci. Sylvain Pion, Chee-Keng Yap
2006	J	`jnl`	Dynamic Map Labeling. IEEE Trans. Vis. Comput. Graph. Ken Been, Eli Daiches, Chee-Keng Yap
2006	—	`conf`	Reply to "Backward Error Analysis ...". ICCSA (1) Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2006	J	`jnl`	Shortest Path amidst Disc Obstacles Is Computable. Int. J. Comput. Geom. Appl. Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap
2006	J	`jnl`	Special Issue on Robust Geometric Algorithms and their Implementations. Comput. Geom. Chee-Keng Yap, Sylvain Pion
2005	J	`jnl`	Recent progress in exact geometric computation. J. Log. Algebraic Methods Program. Chen Li, Sylvain Pion, Chee-Keng Yap
2005	A	`conf`	Robust Approximate Zeros. ESA Vikram Sharma, Zilin Du, Chee-Keng Yap
2005	—	`conf`	Shortest path amidst disc obstacles is computable. SCG Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap
2004	A	`conf`	Classroom Examples of Robustness Problems in Geometric Computations. ESA Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2004	J	`jnl`	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2004	—	`conf`	Shortest Paths for Disc Obstacles. ICCSA (3) Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap
2003	J	`jnl`	Competitive On-Line Scheduling with Level of Service. J. Sched. Ee-Chien Chang, Chee-Keng Yap
2003	—	`conf`	Constructive root bound for SCG Sylvain Pion, Chee-Keng Yap
2003	—	`conf`	Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2002	Misc	`conf`	Different Manhattan project: automatic statistical model generation. Visualization and Data Analysis Chee-Keng Yap, Henning Biermann, Aaron Hertzmann, Chen Li, Jon Meyer, Hsing-Kuo Pao, Salvatore Paxia
2002	C	`conf`	Hypergeometric Functions in Exact Geometric Computation. CCA Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap
2002	—	`conf`	Pseudo approximation algorithms, with applications to optimal motion planning. SCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2002	Misc	`conf`	Responsive scalable thinwire visualization: application to large geographic datasets. Visualization and Data Analysis Chee-Keng Yap, Kenneth Been, Zilin Du
2001	A*	`conf`	A new constructive root bound for algebraic expressions. SODA Chen Li, Chee-Keng Yap
2001	Misc	`conf`	Competitive Online Scheduling with Level of Service. COCOON Ee-Chien Chang, Chee-Keng Yap
2000	J	`jnl`	A Simultaneous Search Problem. Algorithmica Ee-Chien Chang, Chee-Keng Yap
2000	—	`book`	Fundamental problems of algorithmic algebra. Chee-Keng Yap
2000	J	`jnl`	Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
2000	—	`conf`	Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. Automated Deduction in Geometry Daniela Tulone, Chee-Keng Yap, Chen Li
2000	J	`jnl`	Smallest Enclosing Cylinders. Algorithmica Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
1999	—	`conf`	A Core Library for Robust Numeric and Geometric Computation. SCG Vijay Karamcheti, Chen Li, Igor Pechtchanski, Chee-Keng Yap
1999	J	`jnl`	Emerging Challenges in Computational Topology CoRR 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
1998	J	`jnl`	Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. Dan Halperin, Chee-Keng Yap
1997	—	`conf`	A Complete Roundness Classification Procedure. SCG Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
1997	—	`conf`	A Wavelet Approach to Foveating Images. SCG Ee-Chien Chang, Chee-Keng Yap
1997	J	`jnl`	Approximate Euclidean Shortest Paths in 3-Space. Int. J. Comput. Geom. Appl. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
1997	J	`jnl`	Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discret. Comput. Geom. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1997	J	`jnl`	Towards Exact Geometric Computation. Comput. Geom. Chee-Keng Yap
1996	—	`conf`	Efficient Algorithms for the Smallest Enclosing Cylinder Problem. CCCG Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
1996	—	`conf`	Monotonicity of Rectilinear Geodesics in SCG Joonsoo Choi, Chee-Keng Yap
1996	—	`conf`	Smallest Enclosing Cylinders. SCG Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
1996	J	`jnl`	The Habicht Approch to Subresultants. J. Symb. Comput. Chung-Jen Ho, Chee-Keng Yap
1995	J	`jnl`	A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Inf. Process. Lett. Ee-Chien Chang, Chee-Keng Yap
1995	J	`jnl`	Combinatorial Complexity of Signed Discs. Comput. Geom. Diane L. Souvaine, Chee-Keng Yap
1995	A*	`conf`	Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1995	—	`conf`	Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). SCG Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
1995	—	`conf`	Rectilinear Geodesics in 3-Space (Extended Abstract). SCG Joonsoo Choi, Chee-Keng Yap
1994	—	`conf`	Approximate Euclidean Shortest Path in 3-Space. SCG Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
1993	B	`conf`	Combinatorial Complexity of Signed Discs (Extended Abstract). WADS Diane L. Souvaine, Chee-Keng Yap
1993	—	`conf`	Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. SCG Dan Halperin, Chee-Keng Yap
1993	J	`jnl`	Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1993	J	`jnl`	Shortest Paths for Line Segments. Algorithmica Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
1993	—	`conf`	The Geometry in Constraint Logic Programs. PPCP Thomas Dubé, Chee-Keng Yap
1992	A*	`conf`	Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) FOCS Chee-Keng Yap
1992	J	`jnl`	Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discret. Comput. Geom. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
1992	J	`jnl`	Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ACM Trans. Graph. Stephen Cameron, Chee-Keng Yap
1992	J	`jnl`	Simultaneous Inner and Outer Approximation of Shapes. Algorithmica Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1991	J	`jnl`	A New Lower Bound Construction for Commutative Thue Systems with aApplications. J. Symb. Comput. Chee-Keng Yap
1991	J	`jnl`	Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. Kurt Mehlhorn, Chee-Keng Yap
1991	J	`jnl`	New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. Mark H. Overmars, Chee-Keng Yap
1991	J	`jnl`	On-line Motion Planning: Case of a Planar Rod. Ann. Math. Artif. Intell. James Cox, Chee-Keng Yap
1991	J	`jnl`	Reversal Complexity. SIAM J. Comput. Jianer Chen, Chee-Keng Yap
1990	—	`conf`	Computational Complexity of Combinatorial Surfaces. SCG Gert Vegter, Chee-Keng Yap
1990	J	`jnl`	Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Comput. Syst. Sci. Chee-Keng Yap
1990	—	`conf`	On Simultaneous Inner and Outer Approximation of Shapes. SCG Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1990	A*	`conf`	Quantitative Steinitz's Theorems with Applications to Multifingered Grasping STOC David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
1990	J	`jnl`	Symbolic Treatment of Geometric Degeneration. J. Symb. Comput. Chee-Keng Yap
1989	B	`conf`	Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1989	J	`jnl`	Editor's Foreword: Special Issue on Computational Geometry. Algorithmica Chee-Keng Yap
1989	J	`jnl`	Finding Minimal Convex Nested Polygons Inf. Comput. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
1989	B	`conf`	Motion Planning in the CL-Environment (Extended Abstract). WADS Chee-Keng Yap, Helmut Alt
1989	J	`jnl`	Notes on Gröbner bases. Inf. Sci. Bud Mishra, Chee-Keng Yap
1988	—	`conf`	A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. SCG Chee-Keng Yap
1988	—	`conf`	Applications of a Symbolic Perturbation Scheme (Abstract). SWAT Chee-Keng Yap
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1988	A*	`conf`	Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP Kurt Mehlhorn, Chee-Keng Yap
1988	A*	`conf`	New upper bounds in Klee's measure problem (extended abstract) FOCS Mark H. Overmars, Chee-Keng Yap
1988	J	`jnl`	Parallel Computational Geometry. Algorithmica Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1988	J	`jnl`	Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. Algorithmica Chee-Keng Yap
1988	—	`conf`	The Design of LINETOOL, a Geometric Editor. SCG L. W. Ericson, Chee-Keng Yap
1988	J	`jnl`	The Orthogonal Convex Skull Problem. Discret. Comput. Geom. Derick Wood, Chee-Keng Yap
1987	J	`jnl`	An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. Discret. Comput. Geom. Chee-Keng Yap
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	J	`jnl`	Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1987	J	`jnl`	How to move a chair through a door. IEEE J. Robotics Autom. Chee-Keng Yap
1987	J	`jnl`	On k-Hulls and Related Problems. SIAM J. Comput. Richard Cole, Micha Sharir, Chee-Keng Yap
1987	J	`jnl`	Preface Special Issue on Robotics. Algorithmica Chee-Keng Yap
1987	—	`conf`	Reversal complexity. SCT Jianer Chen, Chee-Keng Yap
1987	J	`jnl`	Shape from Probing. J. Algorithms Richard Cole, Chee-Keng Yap
1987	—	`conf`	What Can be Parallelized in Computational Geometry?. Parallel Algorithms and Architectures Chee-Keng Yap
1986	J	`jnl`	A Polynomial Solution for the Potato-peeling Problem. Discret. Comput. Geom. Jyun-Sheng Chang, Chee-Keng Yap
1986	—	`conf`	Moving a Polygon Around the Corner in a Corridor. SCG S. Maddila, Chee-Keng Yap
1986	J	`jnl`	New Upper Bounds for Neighbor Searching Inf. Control. Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap
1986	A*	`conf`	Probing Convex Polytopes STOC David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap
1985	J	`jnl`	A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms Colm Ó'Dúnlaing, Chee-Keng Yap
1985	J	`jnl`	A Parallel Median Algorithm. Inf. Process. Lett. Richard Cole, Chee-Keng Yap
1985	A*	`conf`	Algebraic Cell Decomposition in NC (Preliminary Version) FOCS Dexter Kozen, Chee-Keng Yap
1985	—	`conf`	Computing a convex skill of an orthogonal polygon. SCG Derick Wood, Chee-Keng Yap
1985	—	`conf`	Finding minimal convex nested polygons. SCG Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
1985	J	`jnl`	Minimum area circumscribing Polygons. Vis. Comput. Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap
1985	A*	`conf`	Parallel Computational Geometry (Extended Abstract) FOCS Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1984	A*	`conf`	A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems FOCS Jyun-Sheng Chang, Chee-Keng Yap
1984	J	`jnl`	Counting digraphs and hypergraphs. Bull. EATCS Colm Ó'Dúnlaing, Chee-Keng Yap
1984	J	`jnl`	Geometric Retrieval Problems Inf. Control. Richard Cole, Chee-Keng Yap
1984	A*	`conf`	On k-hulls and Related Problems STOC Richard Cole, Micha Sharir, Chee-Keng Yap
1984	J	`jnl`	Strong NP-Hardness of Moving Many Discs. Inf. Process. Lett. Paul G. Spirakis, Chee-Keng Yap
1984	J	`jnl`	The Format Model: A Theory of database Organization. J. ACM Richard Hull, Chee-Keng Yap
1983	J	`jnl`	A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. Inf. Process. Lett. Chee-Keng Yap
1983	A*	`conf`	Geometric Retrieval Problems FOCS Richard Cole, Chee-Keng Yap
1983	A*	`conf`	Retraction: A New Approach to Motion-Planning (Extended Abstract) STOC Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1983	J	`jnl`	Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci. Chee-Keng Yap
1982	A*	`conf`	Generic Transformation of Data Structures FOCS Colm Ó'Dúnlaing, Chee-Keng Yap
1982	A*	`conf`	The Format Model: A Theory of Database Organization. PODS Richard Hull, Chee-Keng Yap
1980	J	`jnl`	On Formulating Simultaneity for Studying Parallelism and Synchronization. J. Comput. Syst. Sci. Raymond E. Miller, Chee-Keng Yap
1980	A*	`conf`	Space-time Tradeoffs and First Order Problems in a Model of Programs STOC Chee-Keng Yap
1978	A*	`conf`	On Formulating Simultaneity for Studying Parallelism and Synchronization STOC Raymond E. Miller, Chee-Keng Yap
1978	A*	`conf`	On Lifted Problems (Preliminary Reports) FOCS Chee-Keng Yap
1978	—	`conf`	On the formal specification and analysis for loosely connected processes. Mathematical Studies of Information Processing Raymond E. Miller, Chee-Keng Yap
1977	A*	`conf`	On the Computational Power of Reversal-Bounded Machines. ICALP Ronald V. Book, Chee-Keng Yap
1976	J	`jnl`	New Upper Bounds for Selection. Commun. ACM Chee-Keng Yap