Pages that link to "Item:Q5946381"
From MaRDI portal
The following pages link to An optimal deterministic algorithm for computing the diameter of a three-dimensional point set (Q5946381):
Displayed 10 items.
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- COMPUTING THE DIAMETER OF A POINT SET (Q4818574) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS (Q5470168) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)