swMATH11670MaRDI QIDQ23610FDOQ23610
Author name not available (Why is that?)
Official website: http://www.netlib.org/voronoi/hull.html
Cited In (86)
- Computational Science and Its Applications – ICCSA 2004
- On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix
- Homology and cohomology computation in finite element modeling
- Dynamic well-spaced point sets
- Degenerate convex hulls on-line in any fixed dimension
- Guaranteed and randomized methods for stability analysis of uncertain metabolic networks
- ARPIST: provably accurate and stable numerical integration over spherical triangles
- Markov incremental constructions
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- The quickhull algorithm for convex hulls
- Necessary and sufficient conditions for accurate and efficient rational function evaluation and factorizations of rational matrices
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
- Improved approximation algorithms for geometric set cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster geometric algorithms via dynamic determinant computation
- Faster geometric algorithms via dynamic determinant computation
- Randomized search trees
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes
- Abstract Voronoi diagrams from closed bisecting curves
- A robust algorithm for geometric predicate by error-free determinant transformation
- Accurate and efficient algorithms for floating point computation
- Algebraic and numerical techniques for the computation of matrix determinants
- Four results on randomized incremental constructions
- Randomized incremental construction of abstract Voronoi diagrams
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
- Geometric data structures for computer graphics.
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Efficient generation of densely packed convex polyhedra for 3D discrete and finite-discrete element methods
- Regular triangulations of dynamic sets of points
- A 2-D parallel convex hull algorithm with optimal communication phases
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
- Sign determination in residue number systems
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Dynamic data structures for fat objects and their applications
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Accurate and efficient expression evaluation and linear algebra
- An output-sensitive algorithm for computing projections of resultant polytopes
- Title not available (Why is that?)
- LEDA
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Title not available (Why is that?)
- Qhull
- Miniball
- GTS
- tess3
- PYTHIA
- Exact computations of the inertia symmetric integer matrices
- A conservative front tracking method in \(N\) dimensions
- triangulation
- 3D triangulations
- 2D triangulations
- MPFUN
- Random sampling with removal
- Efficient exact evaluation of signs of determinants
- Towards exact geometric computation
- From proximity to utility: a Voronoi partition of Pareto optima
- respol
- Voronoi
- Certification of numerical computation of the sign of the determinant of a matrix
- Range minima queries with respect to a random permutation, and approximate range counting
- Title not available (Why is that?)
- Certifying algorithms
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- A computational basis for higher-dimensional computational geometry and applications
- Checking geometric programs or verification of geometric structures
- Average-case analysis of the double description method and the beneath-beyond algorithm
- An introduction to randomization in computational geometry
- Parallelization alternatives and their performance for the convex hull problem
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries.
- Credal networks
- Robust Plane Sweep for Intersecting Segments
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Complete Implementation for Computing General Dimensional Convex Hulls
- How Tight is Hadamard's Bound?
- Efficient algorithms for line and curve segment intersection using restricted predicates
- Title not available (Why is that?)
- Efficient perturbations for handling geometric degeneracies
- Title not available (Why is that?)
- Evaluating signs of determinants using single-precision arithmetic
- Rational orthogonal approximations to orthogonal matrices
- Title not available (Why is that?)
This page was built for software: Hull
