Abstract Exact computer arithmetic has a variety of uses, including the robust implementation of geometric algorithms. Thisarticle has three purposes. The first is to offer fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values. The second is to propose a technique for adaptive precision arithmetic thatcan often speed these algorithms when one wishes to perform multiprecision calculations that do not always require exact arithmetic, but must satisfy some error bound. The third is to use these techniques to develop implementationsof several common geometric calculations whose required degree of accuracy depends on their inputs. These robust geometric predicates are adaptive; their ru...
In this paper we propose a new approach for the robust computation of the nearest integer lattice po...
The technical report describes floating precision problems in geometric calculations. First, practic...
This paper presents a technique for employing high-performance computing for accelerating the exact ...
Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementa...
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, a...
This archive contains source code, data and examples for the implementation of robust geometric pred...
Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triang...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangula...
Most existing implementations of multiple precision arithmetic demand that the user sets the precisi...
Reliable implementation of geometric algorithms is a notoriously difficult task. Algorithms are usua...
Most algorithms of computational geometry are designed for the Real-RAM and non-degenerate inputs. W...
Algorithms in Computational Geometry and Computer Aid-ed Design are often developed for the Real RAM...
This is a preliminary version of a chapter that will appear in the {\em Handbook on Computational Ge...
Most algorithms of computational geometry are designed for the Real-RAM and non-degenerate input. W...
In this paper we propose a new approach for the robust computation of the nearest integer lattice po...
The technical report describes floating precision problems in geometric calculations. First, practic...
This paper presents a technique for employing high-performance computing for accelerating the exact ...
Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementa...
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, a...
This archive contains source code, data and examples for the implementation of robust geometric pred...
Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triang...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangula...
Most existing implementations of multiple precision arithmetic demand that the user sets the precisi...
Reliable implementation of geometric algorithms is a notoriously difficult task. Algorithms are usua...
Most algorithms of computational geometry are designed for the Real-RAM and non-degenerate inputs. W...
Algorithms in Computational Geometry and Computer Aid-ed Design are often developed for the Real RAM...
This is a preliminary version of a chapter that will appear in the {\em Handbook on Computational Ge...
Most algorithms of computational geometry are designed for the Real-RAM and non-degenerate input. W...
In this paper we propose a new approach for the robust computation of the nearest integer lattice po...
The technical report describes floating precision problems in geometric calculations. First, practic...
This paper presents a technique for employing high-performance computing for accelerating the exact ...