New Upper Bounds in Klee’s Measure Problem
From MaRDI portal
Publication:3985807
DOI10.1137/0220065zbMath0737.68045OpenAlexW2151953637MaRDI QIDQ3985807
Mark H. Overmars, Chee-Keng Yap
Publication date: 27 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16614
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Iterated nearest neighbors and finding minimal polytopes, An in-place algorithm for Klee's measure problem in two dimensions, Generalized hidden surface removal, Algorithms for generalized halfspace range searching and other intersection searching problems, Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints, Getting around a lower bound for the minimum Hausdorff distance, Geometric pattern matching in d-dimensional space, Klee's measure problem made oblivious, Approximating the least hypervolume contributor: NP-hard in general, but fast in practice, A diversity metric for population-based metaheuristic algorithms, An improved algorithm for Klee's measure problem on fat boxes, Faster algorithms for largest empty rectangles and boxes, Efficient transformations for Klee's measure problem in the streaming model, Computing feasible toolpaths for 5-axis machines, On simplifying dot maps., Maximum-weight planar boxes in \(O(n^2)\) time (and better), Optimizing squares covering a set of points, Translating a convex polygon to contain a maximum number of points., Ectropy of diversity measures for populations in Euclidean space, Approximating the volume of unions and intersections of high-dimensional geometric objects, Unnamed Item, Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points, Computing coverage kernels under restricted settings, A fast implementation for the 2D/3D box placement problem, Efficient covariance matrix update for variable metric evolution strategies, Computing the depth distribution of a set of boxes, Optimal placement of convex polygons to maximize point containment, Optimization on directionally convex sets, Unnamed Item, A (slightly) faster algorithm for Klee's measure problem, One-way and round-trip center location problems, Fast stabbing of boxes in high dimensions, Algorithms for generalized halfspace range searching and other intersection searching problems, Computing Klee's measure of grounded boxes, Calculation of Discrepancy Measures and Applications, On constant factors in comparison-based geometric algorithms and data structures, Computing Shapley values in the plane
