A complete implementation for computing general dimensional convex hulls

International Journal of Computational Geometry and Applications

Volumn 8, Issue 2, 1998, Pages 223-253

  Emiris, Ioannis Z ^a  

^a INRIA   (France)

Author keywords

Beneath beyond algorithm; Convex hull; General dimension; Infinitesimal perturbation; Modular arithmetic; Postprocessing; Randomization; Robustness

Indexed keywords

EID: 0032396697     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000126     Document Type: Article

References (49)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. N. Amenta, "Four-polytopes and a funeral (for my conjecture)," Proc. ACM Symp. on Computational Geometry, pages V1-V2, Philadelphia, 1996. Video session.
3. N. Amenta and S. Fortune, Personal Communication, 1996.
4. C.B. Barber, D.P. Dobkin, and H. Huhdanpaa, "The Quickhull algorithm for convex hull," Tech. Report GCG53, Geometry Center, Univ. of Minnesota, July 1993.
5. J.D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, "Applications of random sampling to on-line algorithms in computational geometry," Discr. and Comput. Geometry, 8:51-71, 1992.
6. J.L. Bentley, H.T. Kung, M. Schkolnick, and C.D. Thompson, "On the average number of maxima in a set of vectors," J. ACM, 25:536-543, 1978.
7. C. Burnikel, K. Mehlhorn, and S. Schirra, "On degeneracy in geometric computations," Proc. 5th ACM-SIAM Symp. on Discr. Algorithms, pages 16-23, 1994.
8. J. Canny and I. Emiris, "An efficient algorithm for the sparse mixed resultant," In G. Cohen, T. Mora, and O. Moreno, editors, Proc. Intern. Symp. on Applied Algebra, Algebraic Algor. and Error-Corr. Codes, Lect. Notes in Comp. Science 263, pages 89-104, Puerto Rico, 1993. Springer.
9. K.L. Clarkson, "Safe and effective determinant evaluation," Proc. IEEE Symp. Foundations of Comp. Sci., pages 387-395, 1992.
10. K.L. Clarkson, K. Mehlhorn, and R. Seidel, "Four results on randomized incremental constructions," Comp. Geom.: Theory and Applications, 3:185-121, 1993.
11. J. Canny and P. Pedersen, "An algorithm for the Newton resultant," Technical Report 1394, Comp. Science Dept., Cornell University, 1993.
12. K.L. Clarkson and P.W. Shor, "Applications of random sampling in computational geometry, II," Discr. and Comput. Geometry, 4:387-422, 1989.
13. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," J. Symbolic Computation, 9:251-280, 1990.
14. K. Dobrindt, K. Mehlhorn, and M. Yvinec, "A complete framework for the intersection of a general polyhedron with a convex one," Proc. 3rd Workshop Algorithms Data Struct., LNCS 709, pages 314-324. Springer, Berlin, 1993.
15. D. Dobkin and D. Silver, "Recipes for geometric and numerical analysis - part I: An empirical study," Proc. ACM Symp. on Computational Geometry, pages 93-105, 1988.
16. J.H. Davenport, Y. Siret, and E. Tournier, Computer Algebra, Academic Press, London, 1988.
17. H. Edelsbmnner, "Edge-skeletons in arrangements with applications," Algorithmica, 1:93-109, 1986.
18. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Heidelberg, 1987.
19. H. Edelsbrunner and L.J. Guibas, Topologically sweeping an arrangement," Proc. ACM Symp. Theory of Comp., pages 389-403, 1986.
20. 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.
21. H. Edelsbrunner and R. Waupotitsch, "Computing a ham-sandwich cut in two dimensions," J. Symbolic Comput., 2:171-178, 1986.
22. I.Z. Emiris, "Sparse Elimination and Applications in Kinematics," PhD thesis, Computer Science Division, Univ. of California at Berkeley, December 1994.
23. I.Z. Emiris, "A complete implementation for computing general dimensional convex hulls," Technical Report 2551, INRIA Sophia-Antipolis, France, 1995.
24. I. Emiris and J. Canny, "An efficient approach to removing geometric degeneracies," Proc. ACM Symp. on Computational Geometry, pages 74-82, Berlin, June 1992.
25. I.Z. Emiris and J.F. Canny, "Efficient incremental algorithms for the sparse resultant and the mixed volume," J. Symbolic Computation, 20(2):117-149, August 1995.
26. I.Z. Emiris and J.F. Canny, "A general approach to removing degeneracies," SIAM J. Computing, 24(3):650-664, 1995.
27. I.Z. Emiris, J.F. Canny, and R. Seidel, "Efficient perturbations for handling geometric degeneracies," Algorithmica, Special Issue on Computational Geometry in Manufacturing, 19(1/2):219-242, Sep./Oct. 1997.
28. S. Fortune and C.J. Van Wyk, "Efficient exact arithmetic for computational geometry," Proc. ACM Symp. on Computational Geometry, pages 163-172, 1993.
29. I.M. Gelfand, M.M. Kapranov, and A.V. Zelevinsky, Discriminants and Resultants. Birkhäuser, Boston, 1994.
30. B. Huber and B. Sturmfels, "A polyhedral method for solving sparse polynomial systems," Math. Comp., 64(212):1542-1555, 1995.
31. W. Keller-Gehrig, "Fast algorithms for the characteristic polynomial," Theor. Comp. Sci., 36:309-317, 1985.
32. M. Lauer, "Computing by homomorphic images," In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, pages 139-168. Springer, Wien, 2nd edition, 1982.
33. M.C. Lin, D. Manocha, and J. Canny, "Efficient contact determination for dynamic environments," Proc. IEEE Conf. Robotics and Automation, pages 602-608, 1994.
34. D. Manocha and J. Canny, "Multipolynomial resultant algorithms," J. Symbolic Computation, 15(2):99-122, 1993.
35. M. Mignotte, "Some useful bounds," In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, pages 259-263. Springer, Wien, 2nd edition, 1982.
36. E.P. Mücke, "A robust implementation for three-dimensional Delaunay triangulations," Int'l J. Computational Geometry & Applications, this issue.
37. W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes in C: the Art of Scientific Computing, Cambridge University Press, Cambridge, 1988.
38. A. Rege, "APU - Programming utilities for algebra and geometry," Manuscript. U.C. Berkeley, 1996.
39. P. Schorn, "Degeneracy in geometric computation and the perturbation approach," The Computer Journal, 37(1):35-42, 1994.
40. R. Seidel, "Small-dimensional linear programming and convex hulls made easy," Discr. and Comput. Geometry, 6:423-434, 1991.
41. R. Seidel, "The nature and meaning of perturbations in geometric computing," Proc. 11th Symp. Theoret. Aspects Computer Science, LNCS 775, pages 3-17. Springer, 1994.
42. R. Seidel, Personal Communication, 1996.
43. J. Verschelde, P. Verlinden, and R. Cools, "Homotopies exploiting Newton polytopes for solving sparse polynomial systems," SIAM J. Numerical Analysis, 31(3):915-930, 1994.
44. J. von zur Gathen, "Algebraic complexity theory," In J. Traub, editor, Annual Review of Computer Science, pages 317-347. Annual Reviews, Palo Alto, Cal., 1988.
45. J. Wilkinson, The Algebraic Eigenvalue Problem, Oxford Univ. Press, London, 1965.
46. J. Wiegley, A. Rao, and K. Goldberg, "Computing a statistical distribution of stable poses for a polyhedron," Proc. 30th Annual Allerton Conf. on Comm. Control and Computing, U.Ill. Urbana-Champaign, 1992.
47. C.-K. Yap, "A geometric consistency theorem for a symbolic perturbation scheme," J. Comp. Sys. Sci., 40:2-18, 1990.
48. C.-K. Yap, "Symbolic treatment of geometric degeneracies," J. Symbolic Comput., 10:349-370, 1990.
49. C.-K. Yap, "Low level issues in computational geometry," Proc. Canadian Conf. on Computational Geometry, pages 405-419, 1993.