The following pages link to Hull (Q23610):
Displaying 50 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Certifying algorithms (Q465678) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- Towards exact geometric computation (Q676577) (← links)
- Rational orthogonal approximations to orthogonal matrices (Q676580) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- A robust algorithm for geometric predicate by error-free determinant transformation (Q714616) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- Average-case analysis of the double description method and the beneath-beyond algorithm (Q878061) (← links)
- Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes (Q945282) (← links)
- A perturbation scheme for spherical arrangements with application to molecular modeling (Q1265287) (← links)
- A computational basis for higher-dimensional computational geometry and applications (Q1265288) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- Checking geometric programs or verification of geometric structures (Q1286479) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Efficient perturbations for handling geometric degeneracies (Q1364354) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
- Adaptive precision floating-point arithmetic and fast robust geometric predicates (Q1380822) (← links)
- Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries. (Q1410891) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
- Credal networks (Q1575697) (← links)
- Regular triangulations of dynamic sets of points (Q1605465) (← links)
- 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 (Q1653536) (← links)
- Degenerate convex hulls on-line in any fixed dimension (Q1809510) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Randomized search trees (Q1923861) (← links)
- Dynamic well-spaced point sets (Q1947994) (← links)
- Dynamic data structures for fat objects and their applications (Q1975962) (← links)
- Efficient exact evaluation of signs of determinants (Q1977117) (← links)
- ARPIST: provably accurate and stable numerical integration over spherical triangles (Q2087523) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Random sampling with removal (Q2207595) (← links)
- Parallelization alternatives and their performance for the convex hull problem (Q2504444) (← links)
- A conservative front tracking method in \(N\) dimensions (Q2642691) (← links)
- How Tight is Hadamard's Bound? (Q2775761) (← links)
- (Q2779282) (← links)
- (Q2784760) (← links)
- Homology and Cohomology Computation in Finite Element Modeling (Q2870661) (← links)
- An output-sensitive algorithm for computing projections of resultant polytopes (Q2874580) (← links)
- Faster Geometric Algorithms via Dynamic Determinant Computation (Q2912863) (← links)
- Efficient generation of densely packed convex polyhedra for 3D discrete and finite-discrete element methods (Q2952225) (← links)
- (Q3086760) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
