@inproceedings{cda2264757104c3aaec4f9ac293c89cb,

title = "A geometric consistency theorem for a symbolic perturbation scheme",

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.",

author = "Yap, {Chee Keng}",

note = "Funding Information: *This work was carried out at the Universitaet des Saarlandes with support from Deutsche Forschungs Gemeinschaft, SFB 124, TP B2. Supported in part by NSF grants ~DCR-84-01898 and ~CCR-8703458. Publisher Copyright: {\textcopyright} 1988 ACM.; 4th Annual Symposium on Computational Geometry, SCG 1988 ; Conference date: 06-06-1988 Through 08-06-1988",

year = "1988",

month = jan,

day = "6",

doi = "10.1145/73393.73407",

language = "English (US)",

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

publisher = "Association for Computing Machinery, Inc",

pages = "134--142",

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

}