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
Book ChapterDOI
Load-Balancing for Parallel Delaunay Triangulations
TL;DR: In this paper, a divide-and-conquer Delaunay triangulation algorithm based on partitioning a small sample of the input points is presented, which achieves nearly perfectly balanced partitions and small border triangulations.
DissertationDOI
Geração e melhoramento de malhas adaptativas
TL;DR: An original polygonization method of isosurfaces obtained from point clouds is presented and an approach to improve tetrahedral meshes based on the application of the concept of virtual springs is presented to generate quality meshes for fluid flow simulations in human arteries.
TR-2008008: Schur Aggregation for Linear Systems and Determinants
TL;DR: This work combines the recent preconditioning techniques with the Sherman–Morrison–Woodbury formula, its new variations, aggregation, iterative refinement, and advanced algorithms that rapidly compute sums and products either error-free or with the desired high accuracy.
Journal ArticleDOI
Large-Scale Finite Difference Grid Generation and Visualization Method Based on Ray Casting Algorithm
Tie-chang Ma,Tian-bao Ma,Li Hao +2 more
TL;DR: The ray casting method is optimized and some special cases of algorithm are analyzed, which improved the efficiency and stability for large-scale grid generation and explosion simulation.
Posted Content
General Analysis Tool Box for Controlled Perturbation
TL;DR: This paper has thoroughly reworked the concept of controlled perturbation in order to include rational function based predicate into the theory; polynomial based predicates are included anyway.
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