Towards exact geometric computation

Computational Geometry: Theory and Applications

Volumn 7, Issue 1-2, 1997, Pages 3-23

  Yap, Chee Keng ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002125694     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00040-2     Document Type: Article

References (44)

1. D.H. Bailey, MPFUN: a portable high performance multiprecision package, Technical Report RNR-90-022, NASA Ames Research Center, 1990.
2. P. Bertin, D. Roncin and J. Vuillemin, Introduction to programmable active memories, Research Report 3, Digital Paris Research Laboratory, June, 1989.
3. R.P. Brent, A Fortran multiple-precision arithmetic package, ACM Trans. Math. Software 4 (1978) 57-70.
4. J. Canny, Some algebraic and geometric configurations in PSPACE, in: Proc. 20th ACM Symp. Theory Comput. (1988) 460-467.
5. J. Canny and J.H. Reif, New lower bound techniques for robot motion planning problems, IEEE Found. Comput. Sci. 28 (1987) 49-60.
6. K.L. Clarkson, Safe and effective determinant evaluation, IEEE Found. Comput. Sci. 33 (1992) 387-395.
7. C.W. Clenshaw, F.W.J. Olver and P.R. Turner, Level-index arithmetic: an introductory survey, in: P.R. Turner, ed., Numerical Analysis and Parallel Processing, Lecture Notes in Mathematics 1397 (Springer, Berlin, 1987) 95-168.
8. G.E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in: 2nd GI Conf. on Automata Theory and Formal Languages, Lecture Notes in Computer Science 33 (Springer, Berlin, 1975) 134-183.
9. J.H. Davenport, Y. Siret and E. Tournier, Computer Algebra: Systems and Algorithms for Algebraic Computation (Academic Press, New York, 1988).
10. D. Dobkin and D. Silver, Recipes for geometry and numerical analysis, I: an empirical study, ACM Symp. Comput. Geom. 4 (1988) 93-105.
11. T. Dubé and C. Yap, A basis for implementing exact geometric algorithms, September, 1993, Extended Abstract.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, Berlin, 1987).
13. H. Edelsbrunner and E.P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Symp. Comput. Geom. 4 (1988) 118-133.
14. A. Feldstein and P.R. Turner, Overflow, underflow, and severe loss of significance in floating-point addition and subtraction, IMA J. Numer. Anal. 6 (1986) 241-251.
15. M.J. Fischer and M.O. Rabin, Superexponential complexity of presburger arithmetic, in: R.M. Karp, ed., Complexity of Computations, Vol. 7 (1974), Proceedings SIAM-AMS Symp. on Applied Mathematics.
16. S. Fortune, Numerical stability of algorithms for 2-d Delaunay triangulations and Voronoi diagrams, in: Proc. 8th ACM Symp. Comput. Geom. (1992) 83-92.
17. S. Fortune, Progress in Computational Geometry, in: R. Martin, ed., Information Geometers, 1993, Chapter 3, 81-127.
18. S. Fortune and C. van Wyk, Efficient exact arithmetic for computational geometry, ACM Symp. Comput. Geom. 9 (1993) 163-172.
19. C.M. Hoffman, Geometric and Solid Modeling: An Introduction (Morgan Kaufmann, San Mateo, 1989).
20. T.E. Hull, A. Abraham, M.S. Cohen, A.F.X. Curley, C.B. Hall, D.A. Penny and J.T.M. Sawchuk, Numerical Turing, ACM SIGNUM Newsletter 20(3) (July 1985) 26-34.
21. T.E. Hull, M.S. Cohen, J.T.M. Sawchuk and D.B. Wortman, Exception handling in scientific computing, ACM Trans. Math. Software 14(3) (1988) 201-217.
22. M. Karasick, D. Lieber and L.R. Nackman, Efficient Delaunay triangulation using rational arithmetic, ACM Trans. Graphics 10 (1991) 71-91.
23. V. Milenkovic, Robust polygon modeling, Computer-Aided Design, to appear, fall 1993. (Special issue on Uncertainties in Geometric Computations.)
24. V. Milenkovic and L. Nackman, Finding compact coordinate representations for polygons and polyhedra, ACM Symp. Comput. Geom. 6 (1990) 244-252.
25. C.H. Papadimitriou, An algorithm for shortest-path motion in three dimensions, Inform. Process. Lett. 20 (1985) 259-263.
26. D.A. Patterson and J.L. Hennessy, Computer Architecture: A Quantitative Approach (Morgan Kaufmann, San Mateo, CA, 1990) (with an appendix on Computer Arithmetic by D. Goldberg).
27. D.A. Patterson and J.L. Hennessy, Computer Organization and Design: The Hardware/Software Interface (Morgan Kaufmann, San Mateo, CA, 1994).
28. F.P. Preparata and M.I. Shamos, Computational Geometry (Springer, New York, 1985).
29. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity (1985).
30. J.T. Schwartz and M. Sharir, On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds, Adv. Appl. Math. 4 (1983) 298-351.
31. B. Serpette, J. Vuillemin and J.C. Hervé, BigNum: a portable and efficient package for arbitrary-precision arithmetic, Research Report 2, Digital Paris Research Laboratory, May 1989.
32. M. Shand, P. Bertin and J. Vuillemin, Hardware speedups in long integer multiplication, 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, 1990.
33. M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, SIAM J. Comput. 15 (1986) 193-215.
34. K. Sugihara and M. Iri, Two design principles of geometric algorithms in finite precision arithmetic, Appl. Math. Lett. 2 (1989) 203-206.
35. K. Sugihara and 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 (29 August-2 September 1988).
36. K. Sugihara and 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 (29 August-2 September 1988).
37. K. Sugihara and M. Iri, A numerically stable method for Voronoi diagram construction, Proc. 1988 Fall Conference of the Operations Research Society of Japan, Tokyo (28-29 September 1988) 20-21.
38. K. Sugihara, Robust gift-wrapping for the three-dimensional convex hull, J. Comput. System Sci., 1993, to appear.
39. C.K. Yap, Fundamental Problems in Algorithmic Algebra (Princeton University Press, Princeton, NJ), to appear. Available on request from author and from the URL ftp://cs.nyu.edu/pub/local/yap/Algebra.
40. C.K. Yap, A geometric consistency theorem for a symbolic perturbation scheme, J. Comput. System Sci. 40(1) (1990) 2-18.
41. C.K. Yap, Symbolic treatment of geometric degeneracies, J. Symbolic Comput. 10 (1990) 349-370; Proc. International IFIPS Conference on System Modelling and Optimization, Tokyo (1987), Lecture Notes in Control and Information Science 113 348-358.
42. C.K. Yap, Symbolic treatment of geometric degeneracies, J. Symbolic Comput. 10 (1990) 349-370; Proc. International IFIPS Conference on System Modelling and Optimization, Tokyo (1987), Lecture Notes in Control and Information Science 113 348-358.
43. 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.
44. 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.