Approximating the diameter of a set of points in the Euclidean space

DOI10.1016/0020-0190(89)90045-8zbMath0677.68038OpenAlexW2022651886MaRDI QIDQ1123610

Ömer Eğecioğlu, Bahman Kalantari

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90045-8

zbMATH Keywords

approximation algorithmcomputational geometrydiameter computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Related Items (5)

Farthest neighbors, maximum spanning trees and related problems in higher dimensions ⋮ APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ On computing the diameter of a point set in high dimensional Euclidean space.

Cites Work

• Unnamed Item
• Approximation algorithms for convex hulls
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

This page was built for publication: Approximating the diameter of a set of points in the Euclidean space