Pages that link to "Item:Q4314492"
From MaRDI portal
The following pages link to Applications of Parametric Searching in Geometric Optimization (Q4314492):
Displaying 33 items.
- Minimum-width rectangular annulus (Q388105) (← links)
- Minimum-width double-strip and parallelogram annulus (Q784485) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Minimum Width Rectangular Annulus (Q3004689) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE (Q4513237) (← links)
- COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT (Q4650089) (← links)
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- (Q5090454) (← links)
- Offset-polygon annulus placement problems (Q5096954) (← links)
- Computing constrained minimum-width annuli of point sets (Q5096955) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- Minimum-width annulus with outliers: circular, square, and rectangular cases (Q5915962) (← links)
- Maximum-width empty square and rectangular annulus (Q5918102) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
