Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
- 1 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 300-309
- https://doi.org/10.1145/336154.336216
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Computing Envelopes in Four Dimensions with ApplicationsSIAM Journal on Computing, 1997
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed DimensionJournal of Algorithms, 1996
- A deterministic algorithm for the three-dimensional diameter problemComputational Geometry, 1996
- Las Vegas algorithms for linear and integer programming when the dimension is smallJournal of the ACM, 1995
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINEInternational Journal of Computational Geometry & Applications, 1993
- Linear Optimization QueriesJournal of Algorithms, 1993
- Reporting points in halfspacesComputational Geometry, 1992
- Farthest neighbors, maximum spanning trees and related problems in higher dimensionsComputational Geometry, 1992
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984