Line transversals of balls and smallest enclosing cylinders in three dimensions

Discrete and Computational Geometry

Volumn 21, Issue 3, 1999, Pages 373-388

  Agarwal, P K ^a   Aronov, B ^b   Sharir, M ^c,d  

^a Duke University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033441871     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009427     Document Type: Article

References (29)

1. P.K. Agarwal, On stabbing lines for convex polyhedra in three dimensions, Comput. Geom. Theory Appl. 4 (1994), 177-189.
2. P.K. Agarwal, B. Aronov, and M. Sharir, Computing lower envelopes in four dimensions with applications SIAM J. Comput. 26 (1997), 1714-1732.
3. P.K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of lower envelopes in 3-space and its applications, Discrete Comput. Geom. 15 (1996), 1-13.
4. P.K. Agarwal, M. Sharir, and S. Toledo, New applications of parametric searching in computational geometry, J. Algorithms 17 (1994), 292-318.
5. N. Amenta, Helly-type theorems and generalized linear programming, Discrete Comput. Geom. 12 (1994), 241-261.
6. D. Avis, J.-M. Robert, and R. Wenger, Lower bounds for line stabbing, Inform. Process. Lett. 33 (1989), 59-62.
7. D. Avis and R. Wenger, Polyhedral line transversals in space, Discrete Comput. Geom. 3 (1988), 257-265.
8. U. Babu, J. Raja, and R. Hocken, Sampling methods and substitute geometry algorithms for measuring cylinders in coordinate measuring machines, Proc. Annual Meeting of the ASPE, 1993.
9. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
10. A. Forbes, Generalized regression problems in metrology, Numer. Algorithms 5 (1993), 523-533.
11. J.E. Goodman, R. Pollack, and R. Wenger, Geometric transversal theory, in: New Trends in Discrete and Computational Geometry (J. Pach, ed.), Springer-Verlag, Heidelberg, 1993, pp. 163-198.
12. J.E. Goodman, R. Pollack, and R. Wenger, Bounding the number of geometric permutations induced by k-transversals, Proc. 10th ACM Symp. on Computational Geometry, 1994, pp. 192-197.
13. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1 (1986), 59-71.
14. J. Matoušek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, Algorithmica 16 (1996), 498-516.
15. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
16. 3 and related problems, SIAM J. Comput. 12 (1983), 759-776.
17. N. Megiddo, The weighted Euclidean 1-center problem. Math. Oper. Res. 8 (1983), 498-504.
18. N. Megiddo, On the ball spanned by balls, Discrete Comput. Geom. 4 (1989), 605-610.
19. M. Pellegrini, Stabbing and ray shooting in 3-dimensional space, Proc. 6th Ann. ACM Symp. on Computational Geometry, 1990, pp. 177-186.
20. M. Pellegrini, Ray shooting on triangles in 3-space, Algorithmica 9 (1993), 471-494.
21. M. Pellegrini, Lower bounds on stabbing lines in 3-space, Comput. Geom. Theory Appl. 3 (1993), 53-58.
22. M. Pellegrini and P. Shor, Finding stabbing lines in 3-space, Discrete Comput. Geom. 8 (1992), 191-208.
23. E. Schömer, J. Sellen, M. Teichmann, and C.K. Yap, Efficient algorithms for the smallest enclosing cylinder problem, Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 264-269.
24. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
25. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
26. V. Srinivasan, How tall is the pyramid of Cheops?. . .And other problems in computational metrology, SIAM News 29(3) (1996), 8-9.
27. K. Suresh and H. Völcker, New challenges in dimensional metrology: a case study based on "size," Manufacturing Rev. 7 (1994), 304-311.
28. R. Wenger, Upper bounds on geometric permutations for convex sets. Discrete Comput. Geom. 5 (1990), 27-33.
29. R. Wenger, Helly-type problems and geometric transversals, in CRC Handbook of Discrete and Computational Geometry (J. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, FL, 1997, pp. 63-82.