Efficient perturbations for handling geometric degeneracies

Algorithmica (New York)

Volumn 19, Issue 1, 1997, Pages 219-242

  Emiris, I Z ^a   Canny, J F ^b   Seidel, R ^c  

^a INRIA   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

Algorithm implementation; Efficient perturbations; General dimensional convex hulls; Input degeneracy

Indexed keywords

EID: 0012042657     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00014417     Document Type: Article

References (39)

1. I.Z. Emiris and J.F. Canny. A general approach to removing degeneracies. SIAM J. Comput., 24(3):650-664, 1995.
2. 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):67-104, 1990.
3. C.-K. Yap. Symbolic treatment of geometric degeneracies. J. Symbolic Comput., 10:349-370, 1990.
4. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies. In Proc. ACM Symp. on Computational Geometry, pages 74-82, 1992.
5. R. Seidel. The nature and meaning of perturbations in geometric computing. In Proc. 11th Symp. on Theoretical Aspects Computer Science, pages 3-17. Lecture Notes in Computer Science, Vol. 775. Springer-Verlag, Berlin, 1994.
6. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
7. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
8. K. Dobrindt, K. Mehlhorn, and M. Yvinec. A complete framework for the intersection of a general polyhedron with a convex one. In Proc. 3rd Workshop on Algorithms and Data Structures, pages 314-324. Lecture Notes in Computer Science, Vol. 709. Springer-Verlag, Berlin, 1993.
9. C. Burnikel, K. Mehlhom, and S. Schirra. On degeneracy in geometric computations. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 16-23, 1994.
10. G.B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
11. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
12. C.-K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. System Sci., 40:2-18, 1990.
13. D. Michelucci. An epsilon-arithmetic for removing degeneracies. In Proc. IEEE Symp. on Computer Arithmetic, Bath, pages 230-237, July 1995.
14. I.Z. Emiris. A complete implementation for computing general dimensional convex hulls. Technical Report 2551, INRIA, Sophia-Antipolis, 1995. Final version to appear in Intern. J. Comp. Geometry & Applications.
15. D.E. Knuth. Axioms and Hulls. Lecture Notes in Computer Science, Vol. 606. Springer-Verlag, Berlin, 1992.
16. J.F. Canny. Computing roadmaps of semi-algebraic sets. In Proc. Internat. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, New Orleans, pages 94-107, 1991.
17. R. Zippel. Interpolating polynomials from their values. J. Symbolic Comput., 9:375-403, 1990.
18. G.E. Collins and R. Loos. Real zeros of polynomials. In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, 2nd edition, pages 83-94. Springer-Verlag, Wien, 1982.
19. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9:251-280, 1990.
20. D. Manocha and J. Canny. Multipolynomial resultants and linear algebra. In Proc. ACM Internat. Symp. on Symbolic and Algebraic Computation, pages 96-102, 1992.
21. I.Z. Emiris. Sparse Elimination and Applications in Kinematics. Ph.D. thesis, Computer Science Division, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, CA, December 1994.
22. I. Gohberg, P. Lancaster, and L. Rodman. Matrix Polynomials. Academic Press, New York, 1982.
23. J.H. Davenport, Y. Siret, and E. Tournier. Computer Algebra. Academic Press, London, 1988.
24. W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theoret. Comput. Sci., 36:309-317, 1985.
25. K.L. Clarkson. Safe and effective determinant evaluation. In Proc. IEEE Symp. on Foundations of Computer Science, pages 387-395, 1992.
26. J. von zur Gathen. Algebraic complexity theory. In J. Traub, editor, Annual Review of Computer Science, pages 317-347. Annual Reviews, Palo Alto, CA, 1988.
27. T. Thiele. Personal communication, 1993.
28. H. Edelsbrunner and R. Waupotitsch. Computing a ham-sandwich cut in two dimensions. J. Symbolic Comput., 2:171-178, 1986.
29. S. Teller and C.H. Séquin. Visibility preprocessing for interactive walkthroughs. Comput. Graphics, 25(4):61-69, 1991.
30. S. Teller, C. Fowler, T. Funkhouser, and P. Hanrahan. Partitioning and ordering large radiosity computations. Comput. Graphics, 28, 1994.
31. J. Wiegley, A. Rao, and K. Goldberg. Computing a statistical distribution of stable poses for a polyhedron. In Proc. 30th Ann. Allerton Conf. on Communication Control and Computing, University of Illinois, Urbana-Champaign, IL, 1992.
32. K. Goldberg and M.T. Mason. Bayesian grasping. In Proc. IEEE Conf. on Robotics and Automation, 1990.
33. M.C. Lin, D. Manocha, and J. Canny. Efficient contact determination for dynamic environments. In Proc. IEEE Conf. on Robotics and Automation, pages 602-608, 1994.
34. J.W. Boardman. Automated spectral unmixing of Aviris data using convex geometry concepts. In Proc. 4th Airborne Geoscience Workshop, Washington, DC, October 1993.
35. M.L. Connolly. Molecular interstitial skeleton. Comput. Chem., 15(1):37-45, 1991.
36. B. Huber and B. Sturmfels. A polyhedral method for solving sparse polynomial systems. Math. Comp., 64(212):1542-1555, 1995.
37. I. Emiris and J. Canny. A practical method for the sparse resultant. In Proc. ACM Internat. Symp. on Symbolic and Algebraic Computation, pages 183-192, Kiev, July 1993.
38. J.L. Bentley, H.T. Kung, M. Schkolnick, and C.D. Thompson. On the average number of maxima in a set of vectors. J. Assoc. Comput. Mach., 25:536-543, 1978.
39. P. Schorn. Degeneracy in geometric computation and the perturbation approach. Comput. J., 37(1):35-42, 1994.