Pages that link to "Item:Q685180"
From MaRDI portal
The following pages link to Diameter, width, closest line pair, and parametric searching (Q685180):
Displaying 26 items.
- On enclosing k points by a circle (Q674185) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Computing grasp functions (Q1917051) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Linear approximation of simple objects (Q5890660) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
