Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- 3 January 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 9 (1) , 66-104
- https://doi.org/10.1145/77635.77639
Abstract
No abstract availableAll Related Versions
This publication has 10 references indexed in Scilit:
- An Algorithm to Calculate Optimal Homogeneous Systems of ParametersJournal of Symbolic Computation, 1999
- A geometric consistency theorem for a symbolic perturbation schemePublished by Association for Computing Machinery (ACM) ,1988
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Edge-skeletons in arrangements with applicationsAlgorithmica, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Multidimensional SortingSIAM Journal on Computing, 1983
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Linear Programming and ExtensionsPublished by Rand Corporation ,1963
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955