Linear programming queries revisited
From MaRDI portal
Publication:5361528
DOI10.1145/336154.336198zbMath1377.68289OpenAlexW2052039890MaRDI QIDQ5361528
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/336154.336198
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (7)
Optimal partition trees ⋮ Approximate Polytope Membership Queries ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Economical Delone Sets for Approximating Convex Bodies ⋮ Unnamed Item ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ Enumerating a subset of the integer points inside a Minkowski sum
This page was built for publication: Linear programming queries revisited
