An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Handling degeneracies in exact boundary evaluation
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Point set stratification and Delaunay depth
Computational Statistics & Data Analysis
| Hi-index | 0.00 |
Algorithms modeled as algebraic branching programs, with inputs from an infinite ordered field, are studied. Direct perturbations on the input, so that an algorithm designed under the assumption of nondegeneracy can be applied to all inputs, are described. A deterministic method for algorithms with determinant tests and a randomized one for arbitrary test expressions are defined. They both incur extra complexity factors that are constant in several cases. Moreover, polynomial and exponential time algorithms always remain in the same complexity class while being enhanced with the power to execute on arbitrary inputs. Both methods are distinguished by their conceptual elegance and are significantly faster than previous ones.