Unoriented ⊖-Maxima in the Plane: Complexity and Algorithms

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 278-296

  Avis, David ^a   Beresford Smith, Bryan ^b   Devroye, Luc ^a   Elgindy, Hossam ^b   Guévremont, Eric ^c   Hurtado, Ferran ^d   Zhuh, Binhai ^e,f  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c SIMON FRASER UNIVERSITY   (Canada)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^e LOS ALAMOS NATIONAL LABORATORY   (United States)

^f CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Expected complexity; Lower bound; Maxima; Plane sweep; Probabilistic analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

LINEAR EXPECTED TIME ALGORITHMS;

GRAPH THEORY;

EID: 0032057884     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794277871     Document Type: Article

References (27)

1. [AES85] D. AVIS, H. ELGINDY, AND R. SEIDEL, Simple on-line algorithms for convex polygons, in Computational Geometry, G.T. Toussaint, ed., North-Holland, Amsterdam, 1985, pp. 23-42.
2. [AH81] D. AVIS AND J. HORTON, Remarks on the sphere of influence graph, Ann. New York Acad. Sci., 1981, pp. 323-327.
3. [BCL90] J. L. BENTLEY, K. L. CLARKSON, AND D. B. LEVINE, Fast linear expected-time algorithms for computing maxima and convex hulls, in Proc. 1st Annual ACM - SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1990, pp. 179-187.
4. [BKST78] 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 (1978), pp. 536-543.
5. [BO79] J. L. BENTLEY AND T. A. OTTMANN, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput., C-28 (1979), pp. 643-647.
6. [BS78] J. L. BENTLEY AND M. I. SHAMOS, Divide and conquer for linear expected time, Inform. Process. Lett., 7 (1978), pp. 87-91.
7. [Bu89] C. BUCHTA, On the average number of maxima in a set of vectors, Inform. Process. Lett., 33 (1989), pp. 63-65.
8. [Ch52] H. CHERNOFF, A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations, Ann. Math. Stat., 23 (1952), pp. 493-507.
9. [Ch85] B. CHAZELLE, On the convex layers of a convex set, IEEE Trans. Inform. Theory, IT-31 (1985), pp. 509-517.
10. [CS88] K. L. CLARKSON AND P. W. SHOR, Algorithms for diametrical pairs and convex hulls that are optimal, randomized, and incremental, in Proc. 4th Symposium on Computational Geometry, ACM, New York, 1988, pp. 12-17.
11. [CS89] K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry II, Disc. Comput. Geom., 4 (1989), pp. 387-422.
12. [CSY87] R. COLE, M. SHARIR, AND C. K. YAP. On K-hulls and related problems, SIAM J. Comput., 16 (1987), pp. 61-77.
13. [De80] L. DEVROYE, A note on finding convex hulls via maximal vectors. Inform. Process. Lett., 11 (1980). pp. 53-56.
14. [De83] L. DEVROYE, Moment inequalities for random variables in computational geometry, Computing, 30 (1983), pp. 111-119.
15. [De85] L. DEVROYE, On the expected time required to construct the outer layer, Inform. Process. Lett., 20 (1985), pp. 255-257.
16. [De86] L. DEVROYE, Lecture Notes on Bucket Algorithms, Birkhäuser-Verlag, Boston, 1986.
17. [Dw90] R. A. DWYER. Kinder, gentler average-case analysis for convex hulls and maximal vectors, SIGACT News, 21 (1990), pp. 64-71.
18. [EKS83] H. EDELSBRUNNER, D. G. KIRKPATRICK, AND R. SEIDEL, On the shape of a set of points in the plane, IEEE Trans. Inform. Theory, IT-29 (1983), pp. 551-559.
19. [GBT84] H. N. GABOW, J. L. BENTLEY, AND R. E. TARJAN, Scaling and related techniques for geometry problems, in Proc. 16th Annual ACM Symposium on the Theory of Computing, 1984, pp. 135-143.
20. [Go94] M. J. GOLIN, A provably fast linear-expected-time maxima-finding algorithm finite planar set, Algorithmica, 11 (1994), pp. 501-524.
21. [Gr72] R. GRAHAM, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett., 1 (1972), pp. 132-133.
22. [KLP75] H. T. KUNG, F. Luccio, AND F. P. PREPARATA, On finding the maxima of a set of vectors, J. Assoc. Comput. Mach., 22 (1975), pp. 469-476.
23. [KS85] D. G. KIRKPATRICK AND R. SEIDEL, Output-sensitive algorithms for finding maximal vectors, in Proc. 2nd Annual Symposium on Computational Geometry, ACM, New York, 1985, pp. 89-96.
24. [Ma84] M. MACHII AND Y. IGARASHI, A Hashing Method of Finding the Maxima of a Set of Vectors, Technical Report CS-84-2, Department of Computer Science, Gunma University, Gunma, Japan, 1984.
25. [PS85] F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
26. [SH76] M. I. SHAMOS AND D. HOEY, Geometric intersection problems, in Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, 1976, pp. 208-215.
27. [Ya89] A. C. C. YAO, Lower bounds for algebraic computation trees with integer inputs, in Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 308-313.