COMPUTING THE DIAMETER OF A POINT SET
From MaRDI portal
Publication:4818574
DOI10.1142/S0218195902001006zbMath1152.68673MaRDI QIDQ4818574
Jean-Daniel Boissonnat, Grégoire Malandain
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
A tight lower bound for computing the diameter of a 3D convex polytope, Faster core-set constructions and data-stream algorithms in fixed dimensions, On Some Proximity Problems of Colored Sets
Cites Work
- Applications of random sampling in computational geometry. II
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set