Pages that link to "Item:Q3985807"
From MaRDI portal
The following pages link to New Upper Bounds in Klee’s Measure Problem (Q3985807):
Displaying 40 items.
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
- An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
- Computing feasible toolpaths for 5-axis machines (Q443707) (← links)
- Ectropy of diversity measures for populations in Euclidean space (Q545352) (← links)
- An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
- Efficient transformations for Klee's measure problem in the streaming model (Q904110) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Efficient covariance matrix update for variable metric evolution strategies (Q1009335) (← links)
- Optimization on directionally convex sets (Q1022414) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Generalized hidden surface removal (Q1917036) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints (Q1931811) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Computing Klee's measure of grounded boxes (Q2346960) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- On Klee's measure problem for grounded boxes (Q2874573) (← links)
- (Q4427714) (← links)
- (Q5088947) (← links)
- (Q5136262) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- A fast implementation for the 2D/3D box placement problem (Q5963685) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q5970603) (← links)
- Geometric pattern matching in d-dimensional space (Q6102306) (← links)
- A diversity metric for population-based metaheuristic algorithms (Q6154454) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
- Decomposing the complement of the union of cubes and boxes in three dimensions (Q6624162) (← links)
- Approximation algorithms for finding maximum containing circle and sphere (Q6652433) (← links)
