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

DOI10.1145/1377676.1377693MaRDI QIDQ3602906zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(14)

• A fast implementation for the 2D/3D box placement problem
• An optimal speedup algorithm for the measure problem
• An in-place algorithm for Klee's measure problem in two dimensions
• Algorithms and hardness for multidimensional range updates and queries
• Stochastic convergence of random search methods to fixed size Pareto front approximations
• Computing the depth distribution of a set of boxes
• Faster combinatorial k-clique algorithms
• Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
• scientific article; zbMATH DE number 7250154 (Why is no real title available?)
• Fixed-parameter tractability and lower bounds for stabbing problems
• Approximation algorithms for finding maximum containing circle and sphere
• Computing data distribution from query selectivities
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
• Faster combinatorial \(k\)-clique algorithms

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

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