Smallest enclosing cylinders

Algorithmica (New York)

Volumn 27, Issue 2, 2000, Pages 170-186

  Schomer E ^c   Sellen, J ^a,c   Teichmann, M ^b,d   Yap, Chee ^e  

^a ESG ELEKTRONIKSYSTEM UND LOGISTIK GMBH   (Germany)

^b NEW YORK UNIVERSITY   (United States)

^c SAARLAND UNIVERSITY   (Germany)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e NEW YORK UNIVERSITY   (United States)

Author keywords

Best fit line; Geometric optimization; Parametric search; Smallest enclosing cylinder; approximation algorithms

Indexed keywords

EID: 0000023717     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010011     Document Type: Article

References (21)

1. [AAS] P. K. Agarwal, B. Aronov, M. Sharir, Line transversals of balls and smallest enclosing cylinders in three dimensions, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 483-492.
2. [AGR] N. Amato, M. Goodrich, E. Ramos, Parallel algorithms for higher-dimensional convex hulls, IEEE FOCS, 1994, pp. 683-694.
3. [AM] P. K. Agarwal, J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom., 11, 1994, 393-418.
4. [AST] P. Agarwal, M. Sharir, S. Toledo, Applications of parametric searching in geometric optimization, J. Algorithms, 17, 1994, 292-318.
5. [Asme] ASME Y14.5M-1994, Dimensioning and tolerancing, American Society of Mechanical Engineers, New York, 1994.
6. [Ca] J. Canny, The Complexity of Robot Motion Planning, MIT Press, Cambridge, MA, 1987.
7. [Ch] B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom., 10, 1993, 377-409.
8. [F] F. Follert, Maxmin location of an anchored ray in 3-space and related problems, Proc. 7th Canadian Conf. on Computational Geometry, Quebec, 1995, pp. 7-12.
9. n, Electronic Colloquium on Computational Complexity Report TR95-014, 1995.
10. [FSS] F. Follert, E. Schömer, J. Sellen, Subquadratic algorithms for the weighted maximin facility location problem, Proc. 7th Canadian Conf. on Computational Geometry, Quebec, 1995, pp. 1-6.
11. 2) problems in computational geometry, Comput. Geom. Theory Appl., 5, 1995, 165-185.
12. [GK] P. Gritzmann, V. Klee, Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces, Math. Programming, 59, 1993, 163-213.
13. [M] N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mech., 30, 1983, 852-865.
14. [P] J. Pach, unpublished notes.
15. [PTVF] W. Press, S. Teukolsky, W. Vetterling, B. Flannery, Numerical Recipes in C, Cambridge University Press, Cambridge, 1988.
16. [R] J. Renegar, Recent progress on the complexity of the decision problem for the reals, Discrete and Computational Geometry: Papers from the DIMACS Special Year, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6, American Mathematical Society, Providence, RI, 1991, pp. 287-308.
17. [S] M. Streng, Chebyshev approximation of finite sets by curves and linear manifolds, Ph.D. thesis, University of Twente, 1993.
18. [ST] E. Schomer, Ch. Thiel, Efficient collision detection for moving polyhedra, Proc. 11th ACM Symp. on Computational Geometry, Vancouver, 1995, pp. 51-60.
19. [SV] V. Srinivasan, H. B. Voelcker. Dimensional Tolerancing and Metrology, CRTD, Vol. 27, The American Society of Mechanical Engineers, New York, 1993.
20. [YY] A. C. Yao, F. F. Yao, A general approach to D-dimensional geometric queries, Proc. 17th Ann. ACM Symp. on Theory of Computing, 1985, pp. 163-168.
21. [Ya] C. Yap, Exact computational geometry and tolerancing metrology, in Snapshots of Computational and Discrete Geometry, Vol. 3, eds. D. Avis and J. Bose, McGill School of Computer Science, Tech. Rep. No. SOCS-94.50, A volume dedicated to Godfried Toussaint, 1994, pp. 34-48.