GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
From MaRDI portal
(Redirected from Publication:5470168)
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
- Approximating extent measures of points.
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Computing diameter in the streaming and sliding-window models
- Decomposable searching problems I. Static-to-dynamic transformation
- Efficient randomized algorithms for some geometric optimization problems
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Cited in
(6)
This page was built for publication: GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470168)