On Klee's measure problem for grounded boxes
From MaRDI portal
Publication:2874573
DOI10.1145/2261250.2261267zbMath1293.68302OpenAlexW2003356218MaRDI QIDQ2874573
Publication date: 7 August 2014
Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2261250.2261267
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Speeding up many-objective optimization by Monte Carlo approximations ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Computing the depth distribution of a set of boxes
This page was built for publication: On Klee's measure problem for grounded boxes