Output-sensitive results on convex hulls, extreme points, and related problems

Discrete and Computational Geometry

Volumn 16, Issue 4, 1996, Pages 369-387

  Chan, T M ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030506452     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02712874     Document Type: Article

References (46)

1. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput., 22:794-806, 1993.
2. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.
3. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors. J. Assoc. Comput. Mach., 25:536-543, 1978.
4. J. L. Bentley and J. Saxe. Decomposable searching problems, I: static-to-dynamic transformations. J. Algorithms, 1:301-358, 1980.
5. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Proc. 11th ACM Symp. on Computational Geometry, pp. 10-19, 1995.
6. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom., this issue, pp. 361-368.
7. T. M. Chan, J. Snoeyink, and C.-K. Yap. Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 282-291, 1995.
8. D. R. Chand and S. S. Kapur. An algorithm for convex polytopes. J. Assoc. Comput. Mach., 17:78-86, 1970.
9. B. Chazelle. An optimal algorithm for computing convex layers. IEEE Trans. Inform. Theory, 31:509-517, 1985.
10. B. Chazelle. An optimal convex hull algorithm for point sets in any fixed dimension. Discrete Comput. Geom., 9:145-158, 1993.
11. B. Chazelle and J. Matoušek. Derandomizing an output-sensitive convex hull algorithm in three dimensions. Comput. Geom. Theory Appl., 5:27-32, 1995.
12. K. L. Clarkson. More output-sensitive geometric algorithms. Proc. 35th IEEE Symp. on Foundations of Computer Science, pp. 695-702, 1994.
13. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
14. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc. Comput. Mach., 34:200-208, 1987.
15. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27:241-253, 1983.
16. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
17. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics, 9:66-104, 1990.
18. 2 h ) time algorithm for the three-dimensional convex hull problem. SIAM J. Comput., 20:259-277, 1991.
19. H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15:271-284, 1986.
20. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies. Proc. 8th ACM Symp. on Computational Geometry, pp. 74-82, 1992.
21. D. Eppstein. Dynamic three-dimensional linear programming. Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 488-494, 1991.
22. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett., 1:132-133, 1972.
23. D. G. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm? SIAM J. Comput., 15:287-299, 1986.
24. J. Matoušek. Linear optimization queries. J. Algorithms, 14:432-448, 1993. Also with O. Schwarzkopf in Proc. 8th ACM Symp. on Computational Geometry, pp. 16-25, 1992.
25. J. Matoušek. Linear optimization queries. J. Algorithms, 14:432-448, 1993. Also with O. Schwarzkopf in Proc. 8th ACM Symp. on Computational Geometry, pp. 16-25, 1992.
26. J. Matoušek. On geometric optimization with few violated constraints. Proc. 10th ACM Symp. on Computational Geometry, pp. 312-321, 1994.
27. J. Matoušek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10:215-232, 1993.
28. P. McMullen. The maximal number of faces of a convex polytope. Mathematika, 17:179-184, 1970.
29. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach., 30:852-865, 1983.
30. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach.,
31. d of order 1 to k. Proc. 22nd ACM Symp. on Theory of Computing, pp. 322-330, 1990.
32. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
33. T. Ottmann, S. Schuierer, and S. Soundaralakshmi. Enumerating extreme points in higher dimensions. Proc. 12th Symp. on Theoretical Aspects of Computer Science, pp. 562-570. Lecture Notes in Computer Science, vol. 900. Springer-Verlag, Berlin, 1995.
34. J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994.
35. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. System Sci., 23:166-204, 1981.
36. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM, 20:87-93, 1977.
37. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
38. n. J. Appl. Probab., 7:35-48, 1970.
39. M. Reichling. On the detection of a common intersection of k convex objects in the plane. Inform. Process. Lett., 29:25-29, 1988.
40. M. Reichling. On the detection of a common intersection of k convex polyhedra. In H. Noltemeier (ed.), Computational Geometry and Its Applications, pp. 180-186. Lecture Notes in Computer Science, vol. 333. Spinger-Verlag, Berlin, 1988.
41. T. Rose and P. Widmayer. k-Violation linear programming. Inform. Process. Lett., 52:109-114, 1994.
42. R. Seidel. Constructing higher-dimensional convex hulls at logarithmic cost per face. Proc. 18th ACM Symp. on Theory of Computing, pp. 404-413, 1986.
43. R. Seidel. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom., 6:423-434, 1991.
44. M. Sharir and E. Welzl. A combinatorial bound for linear programming and related problems. Proc. 9th Symp. on Theoretical Aspects of Computer Science, pp. 569-579. Lecture Notes in Computer Science, vol. 577. Springer-Verlag, Berlin, 1992.
45. G. F. Swart. Finding the convex hull facet by facet. J. Algorithms, 6:17-48, 1985.
46. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer (ed.), New Results and New Trends in Computer Science, pp. 359-370. Lecture Notes in Computer Science, vol. 555. Springer-Verlag, Berlin, 1991.