A deterministic algorithm for the three-dimensional diameter problem

DOI10.1145/167088.167217zbMath1310.68208OpenAlexW2151025705MaRDI QIDQ5248517

Otfried Schwarzkopf, Ji{ří} Matoušek

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167217

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Using sparsification for parametric minimum spanning tree problems ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Computing minimum-volume enclosing axis-aligned ellipsoids ⋮ Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ On computing the diameter of a point set in high dimensional Euclidean space.

This page was built for publication: A deterministic algorithm for the three-dimensional diameter problem