Efficient algorithms for counting and reporting pairwise intersections between convex polygons

Information Processing Letters

Volumn 69, Issue 1, 1999, Pages 7-13

  Gupta, Prosenjit ^c   Janardan, Ravi ^a   Smid, Michiel ^b,c  

^a University of Minnesota   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Computational geometry; Data structures

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

CONVEX POLYGONS;

DATA PROCESSING;

EID: 0032785120     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00187-2     Document Type: Article

References (12)

1. P.K. Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements, Cambridge University Press, New York, 1991.
2. P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, TR-CS-1997-11, Duke University, 1997; also in: B. Chazelle, J. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Amer. Math. Soc., Providence, RI, 1998.
3. P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, TR-CS-1997-11, Duke University, 1997; also in: B. Chazelle, J. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Amer. Math. Soc., Providence, RI, 1998.
4. B. Chazelle, D.P. Dobkin, Intersection of convex objects in two and three dimensions, J. ACM 34 (1) (1987) 1-27.
5. B. Chazelle, H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. ACM 39 (1) (1992) 1-54.
6. B. Chazelle, M. Sharir, E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Algorithmica 8 (1992) 407-429.
7. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
8. F. Gómez, S. Ramaswami, G. Toussaint, On removing non-degeneracy assumptions in computational geometry, in: Proc. Third Italian Conference on Algorithms, Rome, Italy, 1997, pp. 52-63.
9. P. Gupta, R. Janardan, M. Smid, Efficient algorithms for counting and reporting pairwise intersections between convex polygons, in: Proc. 8th Canadian Conference on Computational Geometry, Ottawa, Ontario, 1996, pp. 8-13.
10. J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992) 315-334.
11. K. Rosen, Discrete Mathematics and its Applications, McGraw-Hill, New York, 1998.
12. M. van Kreveld, New results on data structures in computational geometry, Ph.D. Thesis, Department of Computer Science, University of Utrecht, Utrecht, Netherlands, 1992.