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
Posted Content
Thingi10K: A Dataset of 10, 000 3D-Printing Models.
Qingnan Zhou,Alec Jacobson +1 more
TL;DR: This work presents a new dataset of 10,000 models collected from an online 3D printing model-sharing database and demonstrates that this dataset represents a more concise summary of real-world models used for3D printing compared to existing datasets.
Journal ArticleDOI
Accurate Floating-Point Summation Part I: Faithful Rounding
TL;DR: This paper presents an algorithm for calculating a faithful rounding of a vector of floating-point numbers, which adapts to the condition number of the sum, and proves certain constants used in the algorithm to be optimal.
Proceedings ArticleDOI
CGAL: the Computational Geometry Algorithms Library
Andreas Fabri,Sylvain Pion +1 more
TL;DR: In this paper, the authors present fundamental geometric data structures and algorithms offered by CGAL, the Computational Geometry Algorithms Library, which is used by application developers in medical imaging, VLSI, CAD/CAM, geophysics, computer graphics and last but not least GIS.
Journal ArticleDOI
Performance and accuracy of hardware-oriented native-, emulated-and mixed-precision solvers in FEM simulations
TL;DR: This survey paper compares native double precision solvers with emulated- and mixed-precision solvers of linear systems of equations as they typically arise in finite element discretisations and concludes that the mixed precision approach works very well with the parallel co-processors gaining speedup factors and area savings, while maintaining the same accuracy as a reference solver executing everything in double precision.
Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery.
TL;DR: This paper discusses the three-dimensional analogue, constrained Delaunay tetrahedralizations (also called CDTs), and their advantages in mesh generation; this approach has three advantages over other methods for boundary recovery: it usually requires fewer additional vertices to be inserted, it yields provably good bounds on edge lengths (i.e. edges are not made unnecessarily short), and it interacts well with provable good Delaunays refinement methods for Tetrahedral mesh generation.
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