COMPUTING THE DIAMETER OF A POINT SET
From MaRDI portal
Recommendations
Cites work
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
- 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
Cited in
(12)- scientific article; zbMATH DE number 2087464 (Why is no real title available?)
- On some proximity problems of colored sets
- Fast algorithms for computing the diameter of a finite planar set
- A practical approach for computing the diameter of a point set
- Approximating the diameter of a set of points in the Euclidean space
- Maximum distance between two sets of points in Ed
- scientific article; zbMATH DE number 4041267 (Why is no real title available?)
- On computing the diameter of a point set in high dimensional Euclidean space.
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- A tight lower bound for computing the diameter of a 3D convex polytope
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Finding k points with minimum diameter and related problems
This page was built for publication: COMPUTING THE DIAMETER OF A POINT SET
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818574)