A (slightly) faster algorithm for klee's measure problem

DOI10.1145/1377676.1377693zbMath1221.65059OpenAlexW2204501044MaRDI QIDQ3602906

Timothy M. Chan

Publication date: 12 February 2009

Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1377676.1377693

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ A fast implementation for the 2D/3D box placement problem ⋮ Computing the depth distribution of a set of boxes ⋮ Unnamed Item

This page was built for publication: A (slightly) faster algorithm for klee's measure problem