| Victor Joseph Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. PhD thesis, Carnegie--Mellon University, Pittsburg, Penn., 1988. |
....from NSERC, the Killam Foundation, and CIES. 23, 24, 26] and various floating point filters, both static and dynamic, have been experimentally tested [8, 15, 6] Second, researchers have investigated algorithms that give approximate results with provable properties and guarantees on efficiency [16, 20, 25]. Third, researchers have considered the computational requirements of the problems themselves and developed algorithms that use simpler predicates. Our notion of simpler is found in Section 2. It is this third branch that we follow in this paper. Following Boissonnat and Preparata [5] we ....
Victor Joseph Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. PhD thesis, Carnegie--Mellon University, Pittsburg, Penn., 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC