Recent progress in exact geometric computation

Journal of Logic and Algebraic Programming

Volumn 64, Issue 1, 2005, Pages 85-111

  Li, C ^a   Pion, S ^b   Yap, C K ^a  

^a NEW YORK UNIVERSITY   (United States)

^b INRIA   (France)

Author keywords

Approximate expression evaluation; C++ libraries; Constructive zero bounds; Exact geometric computation; Interval arithmetic; Non robustness problems; Numerical filters; Precision driven computation; Robust algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAMMING LANGUAGES; DIGITAL ARITHMETIC; DIGITAL LIBRARIES; NUMERICAL ANALYSIS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SURVEYS;

APPROXIMATE EXPRESSION EVALUATION; C++ LIBRARIES; CONSTRUCTIVE ZERO BOUNDS; EXACT GEOMETRIC COMPUTATION (EGC); INTERVAL ARITHMETIC; NON-ROBUSTNESS PROBLEMS; NUMERICAL FILTERS; PRECISION-DRIVEN COMPUTATION; ROBUST ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 17644422204     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.07.006     Document Type: Article

References (103)

1. G. Alefeld, and J. Herzberger Introduction to Interval Computation 1983 Academic Press New York
2. T. Asano, D. Kirkpatrick, C. Yap, Pseudo approximation algorithms, with applications to optimal motion planning, in: 18th ACM Symp. on Comp. Geometry, Barcelona, Spain, 2002, ACM Press,pp. 170-178, 2002 (Special Conference Issue of J. Discrete Comp. Geom.)
3. E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K.M und E. Schmer, A computational basis for conic arcs and boolean operations on conic polygons, in: 10th European Symposium on Algorithms (ESA'02), Lecture Notes in CS, No. 2461, 2002, pp. 174-186
4. J. Blömer Computing sums of radicals in polynomial time IEEE Foundations Comput. Sci. 32 1991 670 677
5. J. Blömer, A probabilistic zero-test for expressions involving roots of rational numbers, in: Proc. Sixth Annual European Symp. Algorithms, LNCS 1461, 1998, pp. 151-162
6. J. Blömer, Simplifying Expressions Involving Radicals, Ph.D. Thesis, Free University Berlin, Department of Mathematics, October 1992
7. L. Blum, F. Cucker, M. Shub, and S. Smale Complexity and Real Computation 1997 Springer-Verlag New York
8. M. Blum, and S. Kannan Designing programs that check their work J. ACM 42 1 1995 269 291
9. M. Blum, M. Luby, and R. Rubinfeld Self-testing and self-correcting programs, with applications to numerical programs J. Computer System Sci. 47 1993 549 595
10. G. Bohlender, C. Ullrich, J.W. von Gudenberg, and L.B. Rall Pascal-SC, Perspectives in Computing, vol. 17 1990 Academic Press Boston-San Diego-New York
11. J.-D. Boissonnat, and M. Yvinec Algorithmic Geometry 1997 Cambridge University Press Translated by Hervé Brönnimann
12. H. Brönnimann, C. Burnikel, and S. Pion Interval arithmetic yields efficient dynamic filters for computational geometry Discrete Appl. Math. 109 2001 25 47
13. C. Burnikel, Exact Computation of Voronoi Diagrams and Line Segment Intersections, Ph.D. Thesis, Universität des Saarlandes, March 1996
14. C. Burnikel, R. Fleischer, K. Mehlhorn, S. Schirra, Exact geometric computation made easy, in: Proc. 15th ACM Symp. Comp. Geom., 1999
15. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra A strong and easily computable separation bound for arithmetic expressions involving radicals Algorithmica 27 2000 87 99
16. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, S. Schmitt, A separation bound for real algebraic expressions, in: Lecture Notes in Computer Science, 2001, pp. 254-265
17. C. Burnikel, S. Funke, and M. Seel Exact geometric computation using cascading IJCGA (Special issue) 11 3 2001 245 266
18. J.F. Canny, The complexity of robot motion planning, ACM Doctoral Dissertation Award Series, Ph.D. Thesis, M.I.T., The MIT Press, 1988
19. J.F. Canny, Some algebraic and geometric configurations in PSPACE, in: Proc. 20th Annual ACM Symp. Theory Comput., 1988, pp. 460-467
20. B. Chazelle et al., Application challenges to computational geometry, in: Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, AMS, 1999, pp. 407-463. The Computational Geometry Impact Task Force Report (1996)
21. C. Clenshaw, F. Olver, and P. Turner Level-index arithmetic: an introductory survey P. Turner Numerical Analysis and Parallel Processing Lecture Notes in Mathematics vol. 1397 1987 Springer-Verlag 95 168
22. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag Berlin
23. O. Devillers, S. Pion, Efficient exact geometric predicates for Delaunay triangulations, in: Proc. 5th Workshop Algorithm Eng. Exper., January 2003, pp. 37-44
24. O. Devillers, and F.P. Preparata A probabilistic analysis of the power of arithmetic filters Discrete Comput. Geom. 20 1998 523 547
25. Z. Du, M. Eleftheriou, J. Moreira, C. Yap, Hypergeometric functions in exact geometric computation, in: V. Brattka, M. Schoeder, K. Weihrauch (Eds.), Proc. 5th Workshop on Computability and Complexity in Analysis, 2002, Malaga, Spain, July 12-13, 2002, pp. 55-66. in: Electronic Notes in Theoretical Computer Science 66:1 (2002). http://www.elsevier.nl/locate/entcs/volume66.html
26. Z. Du, M. Eleftheriou, J. Moreira, C. Yap, Hypergeometric functions in exact geometric computation, in: V. Brattka, M. Schoeder, K. Weihrauch (Eds.), Proc. 5th Workshop on Computability and Complexity in Analysis, 2002, Malaga, Spain, July 12-13, 2002, pp. 55-66. in: Electronic Notes in Theoretical Computer Science 66:1 (2002). http://www.elsevier.nl/locate/entcs/volume66.html
27. T. Dubé, C.K. Yap, A basis for implementing exact geometric algorithms (extended abstract), September 1993. Paper from URL http://www.cs.nyu.edu/cs/faculty/yap
28. H. Edelsbrunner Algorithms in Combinatorial Geometry 1987 Springer-Verlag
29. I.Z. Emiris, A.V. Kakargias, S. Pion, M. Teillaud, E.P. Tsigaridas, Towards an open curved kernel, in: Proc. 20th Annual ACM Symp. Comput. Geom., ACM Press, New York, 2004, pp. 438-446
30. A.R. Forrest Computational geometry and software engineering: towards a geometric computing environment D.F. Rogers R.A. Earnshaw Techniques for Computer Graphics 1987 Springer-Verlag 23 37
31. S. Fortune Special Issue on Implementation of Geometric Algorithms, volume 27:1 of Algorithmica 2000 Springer-Verlag
32. S.J. Fortune Stable maintenance of point-set triangulations in two dimensions IEEE Foundations Computer Sci. 30 1989 494 499
33. S.J. Fortune, C.J. van Wyk, Efficient exact arithmetic for computational geometry, in: Proc. 9th ACM Symp. Computational Geom., 1993, pp. 163-172
34. S.J. Fortune, and C.J. van Wyk Static analysis yields efficient exact integer arithmetic for computational geometry ACM Trans. Graphics 15 3 1996 223 248
35. S. Funke, Exact arithmetic using cascaded computation, Master's Thesis, Max Planck Institute for Computer Science, Saarbrücken, Germany, 1997
36. S. Funke, K. Mehlhorn, S. Näher, Structural filtering: a paradigm for efficient and exact geometric programs, in: Proc. 11th Canadian Conference on Computational Geometry, 1999
37. D. Goldberg What every computer scientist should know about floating-point arithmetic ACM Comput. Surveys 23 1 1991 5 48
38. J.E. Goodman J. O'Rourke Handbook of Discrete and Computational Geometry 1997 CRC Press LLC Second edition expected in 2003
39. M. Goodrich, L. Guibas, J. Hershberger, P. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, in: Proc. 13th ACM Symp. Computational Geom., 1997, pp. 284-293
40. P. Gowland, D. Lester, A survey of exact arithmetic implementations, In: J. Blank, V. Brattka, P. Hertling (Eds.), Computability and Complexity in Analysis, Springer, 2000, pp. 30-47. 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, Lecture Notes in Computer Science, No. 2064
41. D.H. Greene, and F.F. Yao Finite-resolution computational geometry IEEE Foundations Computer Sci. 27 1986 143 152
42. L. Guibas, D. Marimont, Rounding arrangements dynamically, in: Proc. 11th ACM Symp. Computational Geom., 1995, pp. 190-199
43. L. Guibas, D. Salesin, and J. Stolfi Epsilon geometry: building robust algorithms from imprecise computations ACM Symp. Comp. Geom. 5 1989 208 217
44. J.D. Hobby Practical segment intersection with finite precision output Comput. Geom. Theory Appl. 13 4 1999 199 214
45. C. Hoffmann, J. Hopcroft, and M. Karasick Towards implementing robust geometric computations ACM Symp. Comput. Geom. 4 1988 106 117
46. C.M. Hoffmann The problems of accuracy and robustness in geometric computation IEEE Computer 22 3 1989 31 40
47. The CGAL Homepage, Computational Geometry Algorithms Library (CGAL) Project. URL http://www.cgal.org/
48. The CORE Project Homepage, URL http://www.cs.nyu.edu/exact/
49. The LEDA Homepage, URL http://www.mpi-sb.mpg.de/LEDA/
50. G. Horng, M.D. Huang, Simplifying nested radicals and solving polynomials by radicals in minimum depth, in: Proc. 31st Symp. Foundations of Computer Science, 1990, pp. 847-854
51. T. Hull, M. Cohen, Toward an ideal computer arithmetic, in: Proc. 8th Symposium on Computer Arithmetic, IEEE, 1987, pp. 5-48
52. V. Karamcheti, C. Li, I. Pechtchanski, C. Yap, A Core Library for robust numeric and geometric computation, in: Proc. 15th ACM Symp. Comput. Geometry, June 1999, pp. 351-359
53. M. Karasick, D. Lieber, and L.R. Nackman Efficient Delaunay triangulation using rational arithmetic ACM Trans. Graphics 10 1991 71 91
54. M.I. Karavelas, I.Z. Emiris, Root comparison techniques applied to computing the additively weighted Voronoi diagram, in: Proc. 14th ACM-SIAM Symp. Discrete Algorithms (SODA), 2003, pp. 320-329
55. L. Kettner, E. Welzl, One sided error predicates in geometric computing, in: K. Mehlhorn (Ed.), Proc. 15th IFIP World Computer Congress, Fundamentals-Foundations of Computer Science, 1998, pp. 13-26
56. S. Landau Simplification of nested radicals SIAM J. Comput. 21 1 1992 85 110
57. C. Li, Exact Geometric Computation: Theory and Applications, Ph.D. Thesis, Department of Computer Science, New York University, January 2001. Download http://cs.nyu.edu/exact/doc/
58. C. Li, C. Yap, A new constructive root bound for algebraic expressions, in: Proc. Twelfth ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), January 2001, pp. 496-505
59. M.C. Lin, D. Manocha (Eds.), Proc. First ACM Workshop on Applied Computational Geometry, 1996
60. M. Marden The Geometry of the Zeros of a Polynomial in a Complex Variable 1949 American Mathematical Society
61. S. Matsui, and M. Iri An overflow/underflow-free floating-point representation of numbers J. Inform. Process. 4 3 1981 123 133
62. K. Mehlhorn, S. Näher, T. Schilz, R. Seidel, M. Seel, C. Uhrig, Checking geometric programs or verification of geometric structures, in: Proc. 12th ACM Symp. Computational Geom., Association for Computing Machinery, May 1996, pp. 159-165
63. M. Mignotte, and D. Ştefǎnescu Polynomials: An Algorithmic Approach 1999 Springer-Verlag
64. V. Milenkovic, and L. Nackman Finding compact coordinate representations for polygons and polyhedra ACM Symp. Comp. Geom. 6 1990 244 252
65. V.J. Milenkovic Verifiable implementations of geometric algorithms using finite precision arithmetic Artificial Intelligence 37 1988 377 401
66. R.E. Moore Interval Analysis 1966 Prentice Hall Englewood Cliffs, NJ
67. K. Mulmuley Computational Geometry: an Introduction through Randomized Algorithms 1994 Prentice-Hall Inc. Englewood Cliffs, New Jersey
68. A. Nanevski, G. Blelloch, R. Harper, Automatic generation of staged geometric predicates, in: International Conference on Functional Programming, Florence, Italy, 2001. Also Carnegie Mellon CS Tech Report CMU-CS-01-141
69. J. O'Rourke Computational Geometry in C Second ed. 1998 Cambridge University Press
70. T. Ottmann, G. Thiemt, C. Ullrich, Numerical stability of geometric algorithms, in: Proc. 3rd ACM Symp. Comput. Geom., 1987, pp. 119-125
71. K. Ouchi, Real/Expr: Implementation of an Exact Computation Package, Master's Thesis, New York University, Department of Computer Science, Courant Institute, January 1997. URL http://www.cs.nyu.edu/exact/doc/
72. V.Y. Pan, and Y. Yu Certification of numerical computation of the sign of the determinant of a matrix Algorithmica 2001 708 724
73. N.M. Patrikalakis, W. Cho, C.-Y. Hu, T. Maekawa, E.C. Sherbrooke, J. Zhou, Towards robust geometric modellers, 1994 progress report, in: Proc. 1995 NSF Design and Manufacturing Grantees Conf., 1995, pp. 139-140
74. S. Pion, De la géométrie algorithmique au calcul géométrique, Thèse de doctorat en sciences, Université de Nice-Sophia Antipolis, France, 1999. TU-0619
75. S. Pion, Interval arithmetic: An efficient implementation and an application to computational geometry, in: Workshop on Applications of Interval Analysis to Systems and Control, 1999, pp. 99-110
76. S. Pion, C. Yap, Constructive root bound method for k-ary rational input numbers, in: Proc. 19th Annu. ACM Sympos. Comput. Geom., 2003, pp. 256-263
77. F.P. Preparata, and M.I. Shamos Computational Geometry 1985 Springer-Verlag
78. D. Richardson How to recognize zero J. Symbol. Comput. 24 1997 627 645
79. E.R. Scheinerman When close enough is close enough Amer. Math. Monthly 107 2000 489 499
80. S. Schirra Robustness and precision issues in geometric computation J.-R. Sack J. Urrutia Handbook of Computational Geometry 2000 Elsevier Science Publishers B.V., North-Holland Amsterdam 597 632 Chapter 14
81. P. Schorn An axiomatic approach to robust geometric programs J. Symbol. Comput. 16 1993 155 165
82. M.G. Segal, C.H. Sequin, Consistent calculations for solids modelling, in: Proc. 1st ACM Symp. Comput. Geom., 1985, pp. 29-38
83. H. Sekigawa Using interval computation with the Mahler measure for zero determination of algebraic numbers Josai Inform. Sci. Res. 9 1 1998 83 99
84. J. Sellen, J. Choi, and C. Yap Precision-sensitive Euclidean shortest path in 3-space SIAM J. Comput. 29 5 2000 1577 1595 Also: 11th ACM Symp. on Comp. Geom., 1995, pp. 350-359
85. S.A. Seshia, G.E. Blelloch, R.W. Harper, A performance comparison of interval arithmetic and error analysis in geometric predicates, Technical Report CMU-CS-00-172, School of Computer Science, Carnegie-Mellon University, 2000
86. J.R. Shewchuk, Robust adaptive floating-point geometric predicates, in: Proc. 12th ACM Symp. Computational Geom., May 1996, pp. 141-150
87. K. Sugihara, and M. Iri A solid modeling system free from topological inconsistency J. Inform. Process. Inform. Process. Soc. Jpn. 12 4 1989 380 393
88. K. Sugihara, and M. Iri Two design principles of geometric algorithms in finite precision arithmetic Appl. Math. Lett. 2 1989 203 206
89. K. Sugihara, and M. Iri Construction of the Voronoi diagram for 'one million' generat ors in single-precision arithmetic Proc. IEEE 80 9 1992 1471 1484
90. K. Sugihara, M. Iri, An approach to the problem of numerical errors in geometric algorithms, in: Proc. 37th Convention of the Information Processing Society of Japan, Kyoto, September 12-14, 1988, pp. 1665-1666
91. K. Sugihara, M. Iri, Geometric algorithms in finite-precision arithmetic, Research Memorandum RMI 88-10, Dept. of Math. Engineering and Instrumentation Physics, Faculty of Engineering, University of Tokyo, September, 1988, 13th International Symposium on Mathematical Programming, Tokyo, August 29-September 2, 1988
92. K. Sugihara, M. Iri, H. Inagaki, and T. Imai Topology-oriented implementation - an approach to robust geometric algorithms Algorithmica 27 2000 5 20
93. R. Tamassia Strategic directions in computational geometry ACM Comput. Surveys 28 4 1996
94. The Institute of Electrical and Electronic Engineers, Inc., IEEE Standard 754-1985 for binary floating-point arithmetic, ANSI/IEEE Std 754-1985. Reprinted in SIGPLAN 22(2) (1985) 9-25
95. D. Tulone, C. Yap, C. Li, Randomized zero testing of radical expressions and elementary geometry theorem proving, in: J. Richter-Gebert, D. Wang (Eds.), Proc. 3rd Int'l. Workshop on Automated Deduction in Geometry (ADG'00), Lecture Notes in Artificial Intelligence, vol. 2061, Springer, Zurich, Switzerland, 2001, pp. 58-82
96. K. Weihrauch Computable Analysis 2000 Springer Berlin
97. C. Yap, A new number core for robust numerical and geometric libraries, in: 3rd CGC Workshop on Geometric Computing, 1998. Invited Talk. Brown University, October 11-12, 1998. For abstracts, see http://www.cs.brown.edu/cgc/ cgc98/home.html
98. C.K. Yap Towards exact geometric computation Comput. Geom. Theory Appl. 7 1997 3 23 Invited talk, Proc. 5th Canadian Conference on Comp. Geometry, Waterloo, August 5-9, 1993
99. C.K. Yap Fundamental Problems in Algorithmic Algebra 2000 Oxford Univ. Press
100. C.K. Yap, On guaranteed accuracy computation, in: F. Chen, D. Wang, (Eds.), Geometric Computation, World Scientific Publishing Co., Singapore, to appear
101. C.K. Yap Robust geometric computation J.E. Goodman J. O'Rourke Handbook of Discrete and Computational Geometry second ed. 2004 CRC Press LLC Boca Raton, FL 927 952 Chapter 41
102. C.K. Yap, and T. Dubé The exact computation paradigm D.-Z. Du F.K. Hwang Computing in Euclidean Geometry 1995 World Scientific Press 452 486
103. J. Yu, Exact Arithmetic Solid Modeling. Ph.D. dissertation, Department of Computer Science, Purdue University, West Lafayette, IN 47907, June 1992. Technical Report No. CSD-TR-92-037