Abstract
In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.
Original language | English (US) |
---|---|
Pages (from-to) | 2-18 |
Number of pages | 17 |
Journal | Journal of Computer and System Sciences |
Volume | 40 |
Issue number | 1 |
DOIs | |
State | Published - Feb 1990 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics