Author:
McKenney Mark,Schneider Markus
Publisher
Springer International Publishing
Reference34 articles.
1. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Scalable sweeping-based spatial join. In: VLDB, vol. 98, pp. 570–581. Citeseer (1998)
2. Audet, S., Albertsson, C., Murase, M., Asahara, A.: Robust and efficient polygon overlay on parallel stream processors. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 304–313. ACM (2013)
3. Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the eleventh annual symposium on Computational geometry, pp. 211–219. ACM (1995)
4. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. Computers, IEEE Transactions on 100(9), 643–647 (1979)
5. Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. Journal of the ACM (JACM) 39(1), 1–54 (1992)