Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry

ACM Transactions on Graphics

Volumn 15, Issue 3, 1996, Pages 223-248

  Fortune, Steven ^a   Van Wyk, Christopher J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DREW UNIVERSITY   (United States)

Author keywords

D.3.4 Programming Languages : Processors Preprocessors; G.4 Mathematics of Computing : Mathematical Software Efficiency, reliability and robustness

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; DIGITAL ARITHMETIC; INTEGER PROGRAMMING;

GEOMETRIC ALGORITHMS; GEOMETRIC PRIMITIVES; INTEGER ARITHMETIC;

COMPUTER GRAPHICS;

EID: 0030188659     PISSN: 07300301     EISSN: None     Source Type: Journal    
DOI: 10.1145/231731.231735     Document Type: Article

References (36)

1. AVNAIM, F., BOISSONAT, J.-D., DEVILLERS, O., PREPARATA, F. P., AND YVINEC, M. 1995. Evaluation of a method to compute the sign of determinants. In Proceedings of the Eleventh Annual Symposium on Computational Geometry (Vancouver, B.C., June 5-7), C16-C17.
2. BRENT, R. P. 1978. Algorithm 524: MP, a Fortran multiple-precision arithmetic. ACM Trans. Math. Softw. 4, 71-81.
3. BURNIKEL, C., MEHLHORN, K., AND SCHIRRA, S. 1994. How to compute the Voronoi diagram of line segments: theoretical and experimental results. In Proceedings of the 2nd European Symposium on Algorithms (ESA 94). Springer-Verlag Lecture Notes in Computer Science, vol. 855, 227-239.
4. BENOUAMER, M. O., JAILLON, P., MICHELUCCI, D., AND MOREAU, J.-M. 1993. A "lazy" solution to imprecision in computational geometry. In Proceedings of the Fifth Canadian Conference on Computational Geometry (Waterloo, Ontario, Aug. 5-9), 73-78.
5. BENOUAMER, M. O., MICHELUCCI, D., AND PEROCHE, B. 1994. Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation. Comput.-Aided Des. 26, 6, 403-416.
6. BENTLEY, J. L. AND OTTMANN, T. A. 1979. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 28, 9 (Sept.), 643-647.
7. CARGILL, T. 1992. C++ Programming Style, Addison-Wesley, Reading, MA.
8. CHANG, J. AND MILENKOVIC, V. 1993. An experiment using LN for exact geometric computations. In Proceedings of the 5th Canadian Conference on Computational Geometry (Waterloo, Ontario, Aug. 5-9), 67-72.
9. CLARKSON, K. L. 1992. Safe and effective determinant evaluation. In the 33th Symposium on Foundations of Computer Science (Pittsburgh, PA, Oct. 24-27), 387-395.
10. DUBE, T. AND YAP, C. K. 1994. A basis for implementing exact geometric algorithms. Manuscript.
11. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, New York.
12. FORTUNE, S. 1993. Progress in computational geometry, Ch. 3. In Directions in Geometric Computing, R. Martin, Ed., Information Geometers Ltd, 81-128.
13. FORTUNE, S. AND VAN WYK, C. 1993. Efficient exact arithmetic for computational geometry. In Proceedings of the Ninth Annual Symposium on Computational Geometry (San Diego, CA, May 19-21), 163-172.
14. FORTUNE, S. AND VAN WYK, C. 1993. LN users manual. Manuscript, AT&T Bell Laboratories.
15. FORTUNE, S. 1995a. Polyhedral modelling with exact arithmetic. In Proceedings of the Third Symposium on Solid Modelling and Applications (Salt Lake City, UT, May 17-19), 225-234.
16. FORTUNE, S. 1995b. Numerical stability of algorithms for 2D Delaunay triangulations, Int. J. Comput. Geom. Appl. 5, 1, 2, 193-213.
17. GREENE, D. AND YAO, F. 1986. Finite-resolution computational geometry. In Proceedings of the 27th Annual Symposium on the Foundations of Computer Science, (Toronto, Ontario, Oct. 27-29), 143-152.
18. GUIBAS, L. J. AND STOLFI, J. 1985. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graph. 4, 2, 74-123.
19. HOBBY, J. 1993. Practical segment intersection with finite precision output. Submitted.
20. HOFFMANN, C. 1989. Geometric and Solid Modelling: An Introduction. Morgan Kaufmann, San Mateo, CA.
21. IEEE. 1987. IEEE standard for radix-independent floating point arithmetic, ANSI/IEEE std 854-1987, IEEE, New York.
22. JAILLON, P. 1993. Proposition d'une arithmétique rationnelle paresseuse et d'un outil d'aide à la saisie d'objets en synthèse d'images, Thèse, Ecole Nationale Supérieure des Mines de Saint-Etienne. URL: http://www.emse.fr/pub/papers/LAZY/thesePJ.ps.Z.
23. KARASICK, M., LIEBER, D., AND NACKMAN, L. 1990. Efficient Delaunay triangulation using rational arithmetic, ACM Trans. Graph. 10, 1, 71-91.
24. LI, Z. AND MILENKOVIC, V. 1990. Constructing strongly convex hulls using exact or rounded arithmetic. In Proceedings of the Sixth Annual Symposium on Computational Geometry (Berkeley, CA, June 6-8), 235-243.
25. MEHLHORN, K. AND NAHER, S. 1994. Implementation of a sweepline algorithm for the straight line segment intersection problem. Manuscript.
26. MILENKOVIC, V. 1989. Rounding face lattices in the plane. In First Canadian Conference on Computational Geometry (Montreal, Quebec, Aug. 21-25).
27. NAHER, S. 1995. The LEDA User Manual. Ver. 3.1, Jan. 16, LEDA is available by anonymous FTP from ftp.mpi-sb.mpg.de in directory /pub/LEDA.
28. PRIEST, D. M. 1993. On properties of floating point arithmetics: Numerical stability and the cost of accurate computations. Ph.D. dissertation, U. C. Berkeley.
29. SERPETTE, B., VUILLEMIN, J., AND HERVE, J. C. 1989. BigNum: a portable and efficient package for arbitrary-precision arithmetic. Res. Rep. 2, Digital Paris Research Laboratory, May.
30. SHEWCHUK, J. R. 1995. Adaptive precision floating-point arithmetic and fast robust geometric predicates in C. Res. Rep., Carnegie-Mellon Univ., Dec.
31. SUGIHARA, K. AND IRI, M. 1989. Construction of the Voronoi diagram for one million generators in single precision arithmetic. In First Canadian Conference on Computational Geometry (Montreal, Quebec, Aug. 21-25).
32. SUGIHARA, K. AND IRI, M. 1989. A solid modeling system free from topological inconsistency. J. Inf. Proc., Inf. Proc. Soc. Japan 12, 4, 380-393.
33. VAN WYK, C. 1994. Plane sweep with efficient exact arithmetic. Manuscript.
34. VAN WYK, C. 1995. Missing real numbers. Am. Math. Monthly 105, 260-265.
35. YAP, C. 1993. Towards exact geometric computation. In Proceedings of the Fifth Canadian Conference on Computational Geometry (Waterloo, Ontario, Aug. 5-9), 405-419.
36. YAP, C. AND DUBE T. 1995. The exact computation paradigm. In Computing in Euclidean Geometry. D. Z. Du, F. Hwang, Eds, World Scientific, 2nd ed., 452-492.