A deterministic pseudorandom perturbation scheme for arbitrary polynomial predicates

Abstract

We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny’s simple randomized linear perturbation scheme with Yap’s multiple infinitesimal scheme for general predicates. Like the randomized scheme, our method accepts black box polynomial functions as input. For nonmaliciously… (More)

Topics

2 Figures and Tables

Slides referencing similar topics