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.68229MaRDI QIDQ5946381
Publication date: 11 September 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
COMPUTING THE DIAMETER OF A POINT SET, GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS, Algorithms for optimal outlier removal, A tight lower bound for computing the diameter of a 3D convex polytope, On Some Proximity Problems of Colored Sets