Adaptive precision floating-point arithmetic and fast robust geometric predicates
From MaRDI portal
Recommendations
Cited in
(77)- A counterexample to Payne's nodal line conjecture with few holes
- Some issues related to double rounding
- Fast grid-free surface tracking
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- Parallel multigrid solvers for 3D unstructured finite element problems in large deformation elasticity and plasticity
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
- Simple floating-point filters for the two-dimensional orientation problem
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- Master-field simulations of \(\mathrm{O}(a)\)-improved lattice QCD: algorithms, stability and exactness
- scientific article; zbMATH DE number 4078610 (Why is no real title available?)
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- A note on Dekker's FastTwoSum algorithm
- Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic
- Finite element analysis over tangled simplicial meshes: Theory and implementation
- Schur aggregation for linear systems and determinants
- Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
- The medial axis of a union of balls
- Fast algorithms for intersection of non-matching grids using Plücker coordinates
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- Formal verification of a floating-point expansion renormalization algorithm
- The factorability of symmetric matrices and some implications for statistical linear models
- Formally certified floating-point filters for homogeneous geometric predicates
- Constructive root bound for \(k\)-ary rational input numbers
- Algorithm for three-dimensional curved block cutting analysis in solid modeling
- Multimesh finite element methods: solving PDEs on multiple intersecting meshes
- Stochastic rounding and its probabilistic backward error analysis
- Convex-hull algorithms: implementation, testing, and experimentation
- Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations
- Stochastic arithmetic in multiprecision
- An adaptable and extensible geometry kernel
- Automatic generation of staged geometric predicates
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
- Extended finite element method for three-dimensional crack modelling
- Adaptive and efficient algorithm for 2D orientation problem
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
- Exact, robust, and efficient regularized Booleans on general 3D meshes
- A robust algorithm for geometric predicate by error-free determinant transformation
- Polyhedrization of an arbitrary 3D point set.
- Fast and accurate floating point summation with application to computational geometry
- Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations
- HCPO: an efficient insertion order for incremental Delaunay triangulation
- Additive preconditioning and aggregation in matrix computations
- Towards exact geometric computation
- High-precision arithmetic in mathematical physics
- Much Ado about Zero
- Geometrical aggregation of finite fuzzy sets
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- On design and implementation of a generic number type for real algebraic number computations based on expression dags
- Accelerated robust Boolean operations based on hybrid representations
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- Classroom examples of robustness problems in geometric computations
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
- Synthesis of Rigorous Floating-Point Predicates
- Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries.
- Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
- Floating-point arithmetic
- A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
- Fast floating-point filters for robust predicates
- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
- One machine, one minute, three billion tetrahedra
- Computing the Implicit Voronoi Diagram in Triple Precision
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Load-Balancing for Parallel Delaunay Triangulations
- Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\)
- Implicit tetrahedral and surface mesh generation for 3D reservoir structural modeling
- A quasi-static discontinuous Galerkin configurational force crack propagation method for brittle materials
- A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams
- scientific article; zbMATH DE number 1543309 (Why is no real title available?)
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
- Addressing discontinuous root-finding for subsequent differentiability in machine learning, inverse problems, and control
- Hybrid meshing using constrained Delaunay triangulation for viscous flow simulations
This page was built for publication: Adaptive precision floating-point arithmetic and fast robust geometric predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380822)
