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
Constructing Anisotropic Geometric Metrics using Octrees and Skeletons.
TL;DR: A three-dimensional anisotropic metric for geometry-based mesh adaptation is constructed from a triangulated domain definition using a Cartesian background octree refined according to not only boundary curvature but also a local separation criterion from digital topology theory.
Book ChapterDOI
How Reliable Are Practical Point-in-Polygon Strategies?
TL;DR: Experiments reveal that the tested code often fails for more challenging degenerate and also nearly degenerate queries.
Journal ArticleDOI
A fast semi-discrete optimal transport algorithm for a unique reconstruction of the early Universe
Bruno Levy,Roya Mohayaee,Sebastian von Hausegger,Sebastian von Hausegger,Sebastian von Hausegger +4 more
TL;DR: This work uses powerful mathematical tools stemming from optimal transport theory to transform them into an efficient algorithm to reconstruct the fluctuations of the primordial density field, built on solving the Monge-Amp\`ere-Kantorovich equation.
Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates.
TL;DR: This work proposes a new algorithm for vertex insertion, given a new vertex to be inserted into a CDT, that guarantees a new CDT including that vertex, and adds one or more Steiner points incrementally.
Journal ArticleDOI
Voxelized Minkowski sum computation on the GPU with robust culling
Wei Li,Sara McMains +1 more
TL;DR: A new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs) that avoids the large number of 3D Boolean operations needed in most existing algorithms and is easy to implement.
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