Publication:5009560
From MaRDI portal
DOI10.4230/LIPIcs.ESA.2018.3MaRDI QIDQ5009560
Sunil Arya, David M. Mount, Guilherme Dias da Fonseca
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1807.00484
68Wxx: Algorithms in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Union of random Minkowski sums and network vulnerability analysis
- Fast detection of polyhedral intersection
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- On the exact maximum complexity of Minkowski sums of polytopes
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- The approximation of convex sets by polyhedra
- Finding the intersection of two convex polyhedra
- On the combinatorial complexity of approximating polytopes
- Metric entropy of some classes of sets with differentiable boundaries
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Approximating extent measures of points
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- Optimal Approximate Polytope Membership
- Approximate Polytope Membership Queries
- Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Optimal detection of intersections between convex polyhedra
- Accurate Minkowski sum approximation of polyhedral models
- Algebraic Statistics for Computational Biology
