A practical approach for computing the diameter of a point set
From MaRDI portal
Publication:5361575
DOI10.1145/378583.378662zbMath1377.68281OpenAlexW2050386932MaRDI QIDQ5361575
Publication date: 29 September 2017
Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/378583.378662
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (6)
New constructions of SSPDs and their applications ⋮ A tight lower bound for computing the diameter of a 3D convex polytope ⋮ Optimal location of transportation devices ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ A practical approximation algorithm for the LMS line estimator
This page was built for publication: A practical approach for computing the diameter of a point set
