Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
From MaRDI portal
Publication:5883715
DOI10.1145/3516520OpenAlexW4220670571WikidataQ113309843 ScholiaQ113309843MaRDI QIDQ5883715
Publication date: 22 March 2023
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3516520
Related Items (3)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ Algorithm 1024 ⋮ First-order methods for the convex hull membership problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Robust vertex enumeration for convex hulls in high dimensions
- Geometric algorithms and combinatorial optimization.
- An algorithmic separating hyperplane theorem and its applications
- A characterization theorem and an algorithm for a convex hull problem
- Covering spheres with spheres
- Optimal core-sets for balls
- Two Algorithms for the Minimum Enclosing Ball Problem
- Approximate clustering via core-sets
- Polynomial algorithms in linear programming
- Diagonal Matrix Scaling and Linear Programming
- The quickhull algorithm for convex hulls
- Sparse Approximation via Generating Point Sets
- The Domination Heuristic for LP-type Problems
- Computation of Minimum-Volume Covering Ellipsoids
- Coresets for polytope distance
- Approximate minimum enclosing balls in high dimensions using core-sets
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- On the spherical surface of smallest radius enclosing a bounded subset of 𝑛-dimensional euclidean space
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
This page was built for publication: Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
