登入選單
返回Google圖書搜尋
其他書名
Building Robust Algorithms from Imprecise Computations
出版Stanford University, 1991
URLhttp://books.google.com.hk/books?id=UM5EAQAAIAAJ&hl=&source=gbs_api
註釋Abstract: "This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate primitives. Epsilon Geometry is based on a very general model of imprecise computations, which includes floating-point and rounded-integer arithmetic as special cases. The algorithms in this framework produce exact solutions for perturbed versions of their input and return a bound on the size of these implicit perturbations. The thesis begins with a formal description of the Epsilon Geometry framework. It introduces the notions of an epsilon predicate, a geometric predicate that can be satisfied by a perturbed version of its arguments; and a critical distance, the size of the perturbation required to make an epsilon predicate true