Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

International Journal of Computational Geometry and Applications

Volumn 12, Issue 1-2, 2002, Pages 67-85

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Diameter; Geometric optimization; Roundness; Width

Indexed keywords

EID: 0036002803     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195902000748     Document Type: Conference Paper

References (41)

1. Approximation and exact algorithms for minimum-width annuli and shells
2. Line transversals of balls and smallest enclosing cylinders in three dimensions
3. Computing envelopes in four dimensions with applications
4. Farthest neighbors, maximum spanning trees and related problems in higher dimensions
5. Efficient randomized algorithms for some geometric optimization problems
6. Applications of parametric searching in geometric optimization
7. A lower bound for the volume of strictly convex bodies with many boundary lattice points
8. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
9. Computing constrained minimum-width annuli of point sets
10. An efficient algorithm for the three-dimensional diameter problem
11. Subquadratic approximation algorithms for clustering problems in high dimensional spaces
12. Fixed-dimensional linear programming queries made easy
13. Output-sensitive results on convex hulls, extreme points, and related problems
14. An optimal convex hull algorithm in any fixed dimension
15. Diameter, width, closest line pair and parametric searching
16. On linear-time deterministic algorithms for optimization problems in fixed dimension
17. Las Vegas algorithms for linear and integer programming when the dimension is small
18. Applications of random sampling in computational geometry, II
19. Evaluating the cylindricity of a nominally cylindrical point set
20. Efficient approximation and optimization algorithms for computational metrology
21. On a multidimensional search technique and its application to the Euclidean one-center problem
22. On computing the diameter of a point set in high dimensional Euclidean space
23. Fitting a set of points by a circle
24. Reductions among high dimensional proximity problems
25. Computational convexity
26. Computing the width of a set
27. On maintaining the width and diameter of a planar point-set online
28. Reporting points in halfspaces
29. Linear optimization queries
30. On ray shooting in convex polytopes
31. A deterministic algorithm for the three-dimensional diameter problem
32. Linear programming in linear time when the dimension is fixed
33. Construction of 1-d lower envelopes and applications
34. Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
35. Computing roundness is easy if the set is almost round
36. Smallest enclosing cylinders
37. Small-dimensional linear programming and convex hulls made easy
38. A combinatorial bound for linear programming and related problems
39. On constructing minimum spanning trees in k-dimensional spaces and related problems