An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
From MaRDI portal
Publication:5946381
DOI10.1007/S00454-001-0029-8zbMath0992.68229OpenAlexW1968215127MaRDI QIDQ5946381
Publication date: 11 September 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-001-0029-8
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Approximating Smallest Containers for Packing Three-Dimensional Convex Objects ⋮ COMPUTING THE DIAMETER OF A POINT SET ⋮ A tight lower bound for computing the diameter of a 3D convex polytope ⋮ GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS ⋮ Algorithms for optimal outlier removal ⋮ On the longest spanning tree with neighborhoods ⋮ Streaming algorithms for extent problems in high dimensions ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ On Some Proximity Problems of Colored Sets