Robust Geometric Computation

[1]  Juan Xu,et al.  Complexity Analysis of Root Clustering for a Complex Polynomial , 2016, ISSAC.

[2]  Chee-Keng Yap,et al.  Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams , 2016, Comput. Graph. Forum.

[3]  C. Yap,et al.  Soft Subdivision Search in Motion Planning, II: Axiomatics , 2015, FAW.

[4]  Cong Wang,et al.  On soft predicates in subdivision motion planning , 2013, SoCG '13.

[5]  Jihun Yu,et al.  Non-local isotopic approximation of nonsingular surfaces , 2013, Comput. Aided Des..

[6]  Chee-Keng Yap,et al.  Towards exact numerical Voronoi diagrams , 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

[7]  Edmund M. Clarke,et al.  Delta-Decidability over the Reals , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[8]  Kurt Mehlhorn,et al.  A general approach to the analysis of controlled perturbation algorithms , 2011, Comput. Geom..

[9]  Chee-Keng Yap,et al.  Symbolic Treatment of Geometric Degeneracies , 2011 .

[10]  Jihun Yu,et al.  The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra , 2010, ICMS.

[11]  Bernard Mourrain,et al.  The DMM bound: multivariate (aggregate) separation bounds , 2010, ISSAC.

[12]  Dan Halperin,et al.  Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Poi , 2010, ESA 2010.

[13]  Chee-Keng Yap,et al.  Lower bounds for zero-dimensional projections , 2009, ISSAC '09.

[14]  Hazel Everett,et al.  The Voronoi diagram of three arbitrary lines in R3 , 2009 .

[15]  Michael Sagraloff,et al.  Exact geometric-topological analysis of algebraic surfaces , 2008, SCG '08.

[16]  Daniel Richardson,et al.  Zero Tests for Constants in Simple Scientific Computation , 2007, Math. Comput. Sci..

[17]  Michael Kerber,et al.  Fast and exact geometric analysis of real algebraic plane curves , 2007, ISSAC '07.

[18]  Hazel Everett,et al.  The Voronoi Diagram of Three Lines , 2007, SCG '07.

[19]  P. Zimmermann,et al.  MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

[20]  Ioannis Z. Emiris,et al.  The predicates for the Voronoi diagram of ellipses , 2006, SCG '06.

[21]  Chee-Keng Yap,et al.  Recent progress in exact geometric computation , 2005, J. Log. Algebraic Methods Program..

[22]  Kurt Mehlhorn,et al.  Structural filtering: A paradigm for efficient and exact geometric programs , 2005, CCCG.

[23]  K. Mehlhorn,et al.  Classroom Examples of Robustness Problems in Geometric Computations , 2004, ESA.

[24]  Gert Vegter,et al.  Isotopic approximation of implicit curves and surfaces , 2004, SGP '04.

[25]  Elmar Schömer,et al.  Complete, exact, and efficient computations with cubic curves , 2004, SCG '04.

[26]  Dan Halperin,et al.  Controlled perturbation for arrangements of circles , 2003, SCG '03.

[27]  Ron Wein,et al.  High-Level Filtering for Arrangements of Conic Arcs , 2002, ESA.

[28]  Kurt Mehlhorn,et al.  A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons , 2002, ESA.

[29]  José E. Moreira,et al.  Hypergeometric Functions in Exact Geometric Computation , 2002, CCA.

[30]  David G. Kirkpatrick,et al.  Pseudo Approximation Algorithms with Applications to Optimal Motion Planning , 2002, SCG '02.

[31]  Martin Held,et al.  FIST: Fast Industrial-Strength Triangulation of Polygons , 2001, Algorithmica.

[32]  Victor Y. Pan,et al.  Certification of Numerical Computation of the Sign of the Determinant of a Matrix , 2001, Algorithmica.

[33]  Michael Hoffmann,et al.  An adaptable and extensible geometry kernel , 2001, Comput. Geom..

[34]  Robert Sedgewick,et al.  Algorithms in c, part 5: graph algorithms, third edition , 2001 .

[35]  Elmar Schömer,et al.  Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! , 2001, SCG '01.

[36]  Dinesh Manocha,et al.  PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation , 2001, SCG '01.

[37]  Martin Held,et al.  VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments , 2001, Comput. Geom..

[38]  Chee-Keng Yap,et al.  A new constructive root bound for algebraic expressions , 2001, SODA '01.

[39]  Daniel Richardson,et al.  The Uniformity Conjecture , 2000, CCA.

[40]  Edward R. Scheinerman,et al.  When Close Enough Is Close Enough , 2000, Am. Math. Mon..

[41]  Kurt Mehlhorn,et al.  A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals , 2000, Algorithmica.

[42]  Bernd Gärtner,et al.  An efficient, exact, and generic quadratic programming solver for geometric optimization , 2000, SCG '00.

[43]  Kokichi Sugihara,et al.  Topology-Oriented Implementation—An Approach to Robust Geometric Algorithms , 2000, Algorithmica.

[44]  Chee-Keng Yap,et al.  Precision-Sensitive Euclidean Shortest Path in 3-Space , 2000, SIAM J. Comput..

[45]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[46]  John D. Hobby,et al.  Practical segment intersection with finite precision output , 1999, Comput. Geom..

[47]  Jochen Comes,et al.  An Easy to Use Implementation of Linear Perturbations within CGAL , 1999, WAE.

[48]  Sigal Raab,et al.  Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes , 1999, SCG '99.

[49]  Chee-Keng Yap,et al.  A core library for robust numeric and geometric computation , 1999, SCG '99.

[50]  Jean-Daniel Boissonnat,et al.  Efficient algorithms for line and curve segment intersection using restricted predicates , 1999, SCG '99.

[51]  F. Preparata,et al.  Further results on arithmetic filters for geometric predicates , 1999, Comput. Geom..

[52]  Bernd Gärtner,et al.  Exact arithmetic at low cost—a case study in linear programming , 1999, SODA '98.

[53]  Emo Welzl,et al.  One Sided Error Predicates in Geometric Computing , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[54]  Stefan Funke,et al.  Exact geometric predicates using cascaded computation , 1998, SCG '98.

[55]  Steven Fortune,et al.  Vertex-Rounding a Three-Dimensional Polyhedral Subdivision , 1998, SCG '98.

[56]  Sylvain Pion,et al.  Interval arithmetic yields efficient dynamic filters for computational geometry , 1998, SCG '98.

[57]  Michael T. Goodrich,et al.  Efficiently Approximating Polygonal Paths in Three and Higher Dimensions , 1998, SCG '98.

[58]  T. Chow.  What is a Closed-Form Number? , 1998, math/9805045.

[59]  Daniel Richardson,et al.  How to Recognize Zero , 1997, J. Symb. Comput..

[60]  Raimund Seidel,et al.  Efficient Perturbations for Handling Geometric Degeneracies , 1997, Algorithmica.

[61]  Leonidas J. Guibas,et al.  Snap rounding line segments efficiently in two and three dimensions , 1997, SCG '97.

[62]  Giuseppe Liotta,et al.  Robust proximity queries: an illustration of degree-driven algorithm design , 1997, SCG '97.

[63]  M. Yvinec,et al.  Efficient Exact Evaluation of Signs of Determinants , 1997, SCG '97.

[64]  Dan Halperin,et al.  A perturbation scheme for spherical arrangements with application to molecular modeling , 1997, SCG '97.

[65]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[66]  Steven Fortune,et al.  Polyhedral modelling with multiprecision integer arithmetic , 1997, Comput. Aided Des..

[67]  Christopher J. Van Wyk,et al.  Static analysis yields efficient exact integer arithmetic for computational geometry , 1996, TOGS.

[68]  Jonathan Richard Shewchuk,et al.  Robust adaptive floating-point geometric predicates , 1996, SCG '96.

[69]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1996, SCG '96.

[70]  Kurt Mehlhorn,et al.  Exact geometric computation in LEDA , 1995, SCG '95.

[71]  D. Michelucci.  An epsilon-Arithmetic for Removing Degeneracies , 1995 .

[72]  Steven Fortune,et al.  Numerical stability of algorithms for 2-d Delaunay triangulations , 1995, Int. J. Comput. Geom. Appl..

[73]  Jerzy W. Jaromczyk,et al.  Computing Convex Hull in a Floating Point Arithmetic , 1994, Comput. Geom..

[74]  Kurt Mehlhorn,et al.  How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results , 1994, ESA.

[75]  Chee-Keng Yap,et al.  Approximate Euclidean shortest path in 3-space , 1994, SCG '94.

[76]  Raimund Seidel,et al.  The Nature and Meaning of Perturbations in Geometric Computing , 1994, STACS.

[77]  Kurt Mehlhorn,et al.  On degeneracy in geometric computations , 1994, SODA '94.

[78]  Christopher J. Van Wyk,et al.  Efficient exact arithmetic for computational geometry , 1993, SCG '93.

[79]  Kenneth L. Clarkson,et al.  Safe and effective determinant evaluation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[80]  M. Iri,et al.  Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.

[81]  Bruce Randall Donald,et al.  A rational rotation method for robust geometric algorithms , 1991, SCG '92.

[82]  John F. Canny,et al.  A general approach to removing degeneracies , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[83]  Victor J. Milenkovic,et al.  Numerical stability of algorithms for line arrangements , 1991, SCG '91.

[84]  Lee R. Nackman,et al.  Efficient Delaunay triangulation using rational arithmetic , 1991, TOGS.

[85]  Christian P. Ullrich,et al.  Computer Arithmetic and Self-Validating Numerical Methods , 1990, Notes and reports in mathematics in science and engineering.

[86]  Mark Segal,et al.  Using tolerances to guarantee valid polyhedral modeling results , 1990, SIGGRAPH.

[87]  Victor J. Milenkovic,et al.  Finding compact coordinate representations for polygons and polyhedra , 1990, SCG '90.

[88]  Kokichi Sugihara,et al.  A solid modelling system free from topological inconsistency , 1990 .

[89]  Ernst P. Mücke,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1990, TOGS.

[90]  Steven Fortune,et al.  Stable maintenance of point set triangulations in two dimensions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[91]  Victor J. Milenkovic,et al.  Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[92]  Kokichi Sugihara,et al.  On Finite-Precision Representations of Geometric Objects , 1989, J. Comput. Syst. Sci..

[93]  Leonidas J. Guibas,et al.  Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.

[94]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[95]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[96]  Chee-Keng Yap,et al.  A geometric consistency theorem for a symbolic perturbation scheme , 1988, SCG '88.

[97]  David P. Dobkin,et al.  Recipes for geometry and numerical analysis - Part I: an empirical study , 1988, SCG '88.

[98]  John E. Hopcroft,et al.  Towards implementing robust geometric computations , 1988, SCG '88.

[99]  Thomas Ottmann,et al.  Numerical stability of geometric algorithms , 1987, SCG '87.

[100]  F. Frances Yao,et al.  Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[101]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[102]  Carlo H. Séquin,et al.  Consistent calculations for solids modeling , 1985, SCG '85.

[103]  Maurice Mignotte,et al.  Identification of Algebraic Numbers , 1982, J. Algorithms.

[104]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[105]  L. Čížková,et al.  Numerical Linear Algebra , 1966, Canadian Mathematical Bulletin.

[106]  Chee-Keng Yap,et al.  A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration , 2015, ArXiv.

[107]  Chee-Keng Yap,et al.  Resolution-Exact Algorithms for Link Robots , 2014, WAFR.

[108]  Chee-Keng Yap,et al.  Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach , 2011, Discret. Comput. Geom..

[109]  K. Sugihara.  Robust geometric computation based on the principle of independence , 2011 .

[110]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.

[111]  Daniel Richardson,et al.  Counterexamples to the uniformity conjecture , 2006, Comput. Geom..

[112]  K. Weihrauch.  Computable Analysis , 2005, CiE.

[113]  Kurt Mehlhorn,et al.  Controlled Perturbation for Voronoi Diagrams , 2004 .

[114]  Sylvain Pion,et al.  Constructive root bound method for k-aray rational input numbers , 2003 .

[115]  Michael Seel,et al.  Planar Nef polyhedra and generic higher-dimensional geometry , 2001 .

[116]  Stefan Schirra,et al.  Robustness and Precision Issues in Geometric Computation , 2000, Handbook of Computational Geometry.

[117]  C. Yap,et al.  Smallest Enclosing Cylinders , 2000, Algorithmica.

[118]  Kurt Mehlhorn,et al.  Exact geometric computation made easy , 1999 .

[119]  Chee Yap,et al.  A new number core for robust numerical and geometric libraries (invited talk) , 1998 .

[120]  Chee-Keng Yap,et al.  Towards Exact Geometric Computation , 1997, Comput. Geom..

[121]  Angus Macintyre,et al.  On the decidability of the real exponential field , 1996 .

[122]  Christoph Burnikel,et al.  Exact computation of Voronoi diagrams and line segment intersections , 1996 .

[123]  Klaus Weihrauch,et al.  Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms , 1994, CCCG.

[124]  R. K. Walker,et al.  THE EXACT COMPUTATION PARADIGM 1 , 1994 .

[125]  Peter Schorn,et al.  Degeneracy in Geometric Computation and the Perturbation Approach , 1994, Comput. J..

[126]  Chee-Keng Yapy.  A Basis for Implementing Exact Geometric Algorithms , 1993 .

[127]  Victor J. Milenkovic,et al.  Rational Orthogonal Approximations to Orthogonal Matrices , 1993, Comput. Geom..

[128]  Victor J. Milenkovic,et al.  An Experiment Using LN for Exact Geometric Computations , 1993, CCCG.

[129]  Jiaxun Yu.  Exact arithmetic solid modeling , 1992 .

[130]  M. Iri,et al.  Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic , 1989 .

[131]  D. Marimont,et al.  International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Rounding Arrangements Dynamically , 2022 .

[132]  Kurt Mehlhorn,et al.  Algorithms for Complex Shapes with Certified Numerics and Topology Controlled Perturbation for Delaunay Triangulations , 2022 .

[133]  «« Blockinøøú Óñôùøøøøóòòð Óññøöý Óö Ùöú× Òò Ëùööö Blockin Blockin× , 2022 .