Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates,
Reads0
Chats0
TLDR
This article offers fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values and proposes a technique for adaptive precision arithmetic that can often speed these algorithms when they are used to perform multiprecision calculations that do not always require exact arithmetic, but must satisfy some error bound.Abstract:
Exact computer arithmetic has a variety of uses, including the robust implementation of geometric algorithms. This article 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 that can often speed these algorithms when they are used 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 implementations of several common geometric calculations whose required degree of accuracy depends on their inputs. These robust geometric predicates are adaptive; their running time depends on the degree of uncertainty of the result, and is usually small.read more
Citations
More filters
Finite element mesh generation for subsurface simulation models Antonio Carlos de Oliveira MirandaWilliam Wagner Matos Lira • Ricardo Cavalcanti MarquesAndre Maues Brabo Pereira • Joaquim B. Cavalcante-NetoLuiz Fernando Martha
TL;DR: This paper describes four important modeling capabilitiesthat are implemented in a subsurface simulation modeler: surface re-triangulation, surface intersection, automaticvolume recognition, and tetrahedral mesh generation.
Posted Content
Twofold arithmetic
TL;DR: In this article, the authors define fast arithmetic (based on Dekker [1971]) over twofold approximations of floating-point accuracy, such that $z_0$ is standard result and $z-1$ assesses inaccuracy.
Journal ArticleDOI
Fast quadruple-double floating point format
Naoya Yamanaka,Shin'ichi Oishi +1 more
TL;DR: An efficient format and fast algorithms of basic operations for 4-fold working precision are proposed and it is shown that the proposed algorithms are efficient.
Book ChapterDOI
Extending the Precision
Jean-Michel Muller,Nicolas Brisebarre,Florent de Dinechin,Claude-Pierre Jeannerod,Vincent Lefèvre,Guillaume Melquiond,Nathalie Revol,Damien Stehlé,Serge Torres +8 more
TL;DR: Though very useful in many situations, the fixed-precision floating-point formats that are available in hardware or software in the authors' computers may sometimes prove insufficient.
Classroom Examples of Robustness Problems in Geometric Computations (Extended Abstract)
TL;DR: Mehlhorn et al. as mentioned in this paper studied a simple incremental algorithm for planar convex hulls and gave examples which make the algorithm fail in all pos- sible ways, and discussed the geometry of the floating point implementation of the orientation predicate.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book ChapterDOI
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
TL;DR: Triangle as discussed by the authors is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunayer refinement algorithm for quality mesh generation, and it is shown that the problem of triangulating a planar straight line graph (PSLG) without introducing new small angles is impossible for some PSLGs.
Related Papers (5)
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Primitives for the manipulation of general subdivisions and the computation of Voronoi
Leonidas J. Guibas,Jorge Stolfi +1 more