A practical approach for computing the diameter of a point set
From MaRDI portal
Recommendations
Cited in
(18)- COMPUTING THE DIAMETER OF A POINT SET
- Lower Bounds for Geometric Diameter Problems
- scientific article; zbMATH DE number 2087464 (Why is no real title available?)
- Practical methods for shape fitting and kinetic data structures using coresets
- Fast algorithms for computing the diameter of a finite planar set
- New constructions of SSPDs and their applications
- On finding a large number of 3D points with a small diameter
- A practical approximation algorithm for the LMS line estimator
- Approximating the diameter of a set of points in the Euclidean space
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- 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.
- Optimal location of transportation devices
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- A tight lower bound for computing the diameter of a 3D convex polytope
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
- Approximating the Radii of Point Sets
- An efficient algorithm for the three-dimensional diameter problem
This page was built for publication: A practical approach for 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 Q5361575)