Geometric intersection problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1976-October, Issue , 1976, Pages 208-215

  Shamos, Michael Ian ^a   Hoey, Dan ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

GEOMETRIC OBJECTS; HALF-PLANES; INTERSECTION PROBLEM; LINE SEGMENT; OPTIMAL ALGORITHM; SIMPLEX METHODS; UPPER AND LOWER BOUNDS;

LINEAR PROGRAMMING;

EID: 85032346047     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1976.4567905     Document Type: Conference Paper

References (10)

1. Shamos, M. I.., and Hoey, D. Closest-Point Problems. Proc. Sixteenth Annual Symposium on Foundations of Computer Science (1975), 151-162.
2. Shamos, M. I. Geometric Complexity. Proc. Seventh Annual ACM SIGACT Symposium (1975), 224-233.
3. Dobkin, D. and Lipton, R. On the Complexity of Computations under Varying Sets of Primitives. Yale Computer Science Research Report # 42 (1975).
4. Reingold, E. M. On the Optimality of Some Set Algorithms. JACM 19, 4(1972), 649-659.
5. Aho, A. V., Hopcroft, J. E. and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley (1974), 470 pp.
6. Hoey, D. On Determining Whether Line Segments in the Plane are Disjoint. (1975) unpublished ms.
7. Sklansky, J. Measuring Concavity on a Rectangular Mosaic. IEEE Trans. Comp. C-21(1972), 1355-1364.
8. Shamos, M. I. Problems in Computational Geometry. Springer-Verlag, to appear.
9. Pavlidis, T. Analysis of Set Patterns. Pattern Recognition 1(1968), 165-178.
10. Pavlidis, T. Representation of Figures by Labeled Graphs. Pattern Recognition 4(1972), 5-17.