The nature and meaning of perturbations in geometric computing

Discrete and Computational Geometry

Volumn 19, Issue 1, 1998, Pages 1-17

  Seidel, R ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032350154     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009330     Document Type: Article

References (21)

1. D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms? Comput. Geom. Theory Appl. To appear.
2. C. Burnikel, K. Mehlhorn, and S. Schirra. On degeneracy in geometric computations. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994.
3. J. Canny. Private communication.
4. J. Canny, I. Emiris, and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica. To appear.
5. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
6. K. Dobrindt. Algorithmen für Polyeder. Diplomarbeit, FB 14, Informatik, Universitat des Saarlandes, Saarbrücken, 1990.
7. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics 9(1) (1990), 67-104.
8. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies. Proc. 8th Annual ACM Symp. on Comput. Geom., 1991, pp. 74-82.
9. I. Emiris and J. Canny. A general approach to removing degeneracies. SIAM J. Compt. 24(3) (1995), 650-664.
10. A. Griewank and G. F. Corliss. Automatic Differentiation of Algorithms: Theory, Implementation, and Applications. SIAM, Philadelphia, PA, 1991.
11. L. J. Guibas and J. Stolfi. Primitives for manipulation of general subdivisions and computation of Voronoi diagrams. ACM Trans. Graphics 4(2) (1985), 74-123.
12. S. G. Krantz and H. R. Parks. A Primer of Real Analytic Functions. Birkhäuser-Verlag, Boston, 1992.
13. D. Michelucci. An ε-arithmetic for removing degeneracies. Proc. IEEE Symp. on Comput. Arithmetic, 1995.
14. C. Monma, M. Paterson, S. Suri, and F. Yao. Computing Euclidean maximum spanning trees. Proc. 4th Annual ACM Symp. on Comput. Geom., 1988, pp. 241-251.
15. F. P. Preparata and M. I. Shamos. Computational Geometry, An Introduction. Springer-Verlag, New York, 1985.
16. G. Rote. Private communication.
17. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27(4) (1980), 701-717.
18. R. Seidel. Output-size sensitive algorithms for constructive problems in computational geometry. Ph.D. thesis, Computer Science Department, Cornell University, 1986.
19. T. Thiele. Private communication.
20. C.-K. Yap. Symbolic treatment of geometric degeneracies, J. Symbolic Comput. 10 (1990), 349-370.
21. C.-K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. Systems Sci. 40 (1990), 2-18.