Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

Volumn , Issue , 1988, Pages 118-133

  Edelsbrunner, Herbert ^a   Mücke, Ernst Peter ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

DEGENERATE CASE; GENERAL PURPOSE PROGRAMMING; GEOMETRIC ALGORITHM; INPUT DATAS; STANDARD TOOLS;

GEOMETRY;

EID: 85031946402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73406     Document Type: Conference Paper

References (24)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. F. Aurenhammer and H. Imai. Geometric relations among Voronoi diagrams. Technical Report 228, Institute für Informationsverarbeitung, Technische Universität Graz, Austria, 1986.
3. A. Charnes. Optimality and degeneracy in linear programming. Econometrica, 20(2):160-170,1952.
4. V. Chvátal. Linear Programming. W. H. Freeman and Company, New York, 1983.
5. V. Chvátal and G. Klincsek. Finding largest convex subsets. In Proceedings 11th Southeastern Conference on Combinatorics, Graph Theory and Computing, pages 453-460,1980.
6. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.
7. G. B. Dantzig, A. Orden, and P. Wolfe. The generalized simplex method for minimizing a linear form under linear inequality restrictions. Pacific Journal of Mathematics, 5:183-195, 1955.
8. H. Edelsbrunner. Edge-skeletons in arrangements with applications. Algorithmica, 1:93-109, 1986.
9. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Heidelberg, Germany, 1987.
10. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. In Proceedings 18th Annual ACM Symposium on Theory of Computation, pages 389-403, 1986.
11. H. Edelsbrunner and R. Waupotitsch. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation, 2:171-178, 1986.
12. A. R. Forrest. Computational geometry in practice. In E. A. Earnshaw, editor, Fundamental Algorithms for Computer Graphics, pages 707-724, Springer Verlag, Berlin, Heidelberg, Germany, 1985.
13. J. E. Goodman and R. Pollack. Multidimensional sorting. SIAM Journal on Computing, 12:484-507, 1983.
14. L. J. Guibas and J. Stolfi. Primitives for manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4:74-123, 1985.
15. G. H. Golub. and Ch. F. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, Maryland, 1983.
16. D. E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 1969.
17. E. P. Mücke. Ein Modell zur Elimination degenerierter Fälle in geometrischen Algorithmen. Graduating thesis, Institute für Informationsverarbeitung Technische Universität Graz, Austria, 1985.
18. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM, 20:87-93, 1977.
19. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer Verlag, New York, 1985.
20. R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Technical Report 81-14, Department of Computer Science, University of British Columbia, Vancouver, British Columbia, 1981.
21. R. Seidel. On the size of closest-point Voronoi diagrams. Technical Report F94, Institute für Informationsverarbeitung, Technische Universität Graz, Austria, 1982.
22. R. Seidel. Constructing higher-dimensional convex hulls in logarithmic cost per face. In Proceedings 18th Annual ACM Symposium on Theory of Computing, pages 484-507, 1986.
23. Chee Keng Yap. Symbolic treatment of geometric degeneracies. In Proceedings 13th IFIP Conference on System Modelling and Optimization, Chuo University, Tokyo, 1987.
24. Chee Keng Yap. A geometric consistency theorem for a symbolic perturbation scheme. In Proceedings 4th ACM Symposium on Computational Geometry, Urbana, Illinois, 1988.