Linear programming queries revisited

DOI10.1145/336154.336198MaRDI QIDQ5361528zbMATH OpenOpenAlexFDO

Authors Edgar A. Ramos

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

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Linear programming (90C05)

Cited in

(7)

• Enumerating a subset of the integer points inside a Minkowski sum
• Optimal partition trees
• Approximate polytope membership queries
• Simplex Range Searching and Its Variants: A Review
• Economical Delone sets for approximating convex bodies
• Polytope approximation and the Mahler volume
• Optimal algorithms for geometric centers and depth

This page was built for publication: Linear programming queries revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361528)