Owens J D, Luebke D, Govindaraju N, et al. A Survey of General-purpose computation on graphics hardware[J]. Computer graphics forum, 2007,26(1):80-113.
[3]
张舒,褚艳利.GPU 高性能运算之CUDA[M].北京:中国 水利水电出版社,2009.
[4]
Shamos M I, Hoey D. Geometric intersection problems
[5]
[C]. 17th Annual Symposium on Foundations of Computer Science, IEEE, 1976:208-215.
[6]
Bentley J L, Ottmann T A. Algorithms for reporting and counting geometric intersection[J]. IEEE Transactions on Computers, 1979,100(9):643-647.
[7]
Bartuschka U, Mehlhorn K, N？her S. A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem[C]. Proceedings ofWorkshop on Algorithm Engineering, 1997.
[8]
Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane[J]. JACM, 1992,39:1-54.
[9]
Balaban I J. An optimal algorithm for finding segments intersections[C]. Proceedings of the eleventh annual symposium on Computational geometry, ACM, 1995:211-219.
[10]
Andrews D S, Snoeyink J, Boritz J, et al. Further comparison of algorithms for geometric intersection problems[C]. 6th International Symposium on Spatial Data Handling, 1994.
[11]
Aggarwal A, Chazelle B, Guibas L, et al. Parallel computational geometry[J]. Algorithmica, 1988,3(1-4):293-327.
[12]
Atallah M J, Goodrich M T. Efficient plane sweeping in parallel[C]. Proceedings of the second annual symposium on Computational geometry, ACM, 1986:216-225.
[13]
Goodrich M T, Ghouse M R, Bright J. Sweep methods for parallel computational geometry[J]. Algorithmica, 1996, 15(2):126-153.
[14]
Herring J. OpenGIS implementation standard for geographic information-simple feature access-part 1: Common architecture[R]. Wayland: Open Geospatial Consortium Inc, 2011.
[15]
Leutenegger S T, Lopez M A, Edgington J. STR: A simple and efficient algorithm for R-tree packing[C]. 13th International Conference on Data Engineering, IEEE, 1997: 497-506.
[16]
周伟明.多核计算与程序设计[M].武汉:华中科技大学出 版社,2009.
[17]
Samet H, Webber R E. Storing a collection of polygons using quadtrees[J]. ACM Transactions on Graphics (TOG), 1985,4(3):182-222.
[18]
Samet H, Webber R E. On encoding boundaries with quadtrees[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984(3):365-369.
[19]
Shneier M. Calculations of geometric properties using quadtrees[J]. Computer Graphics and Image Processing, 1981,16(3):296-302.
[20]
Shewchuk J R. Adaptive precision floating-point arithmetic and fast robust geometric predicates[J]. Discrete & Computational Geometry, 1997,18(3):305-363.
[21]
Brisebarre N, De Dinechin F, Jeannerod C P, et al. Handbook of floating-point arithmetic[M]. Boston: Birkh？user Boston Publisher, 2010.
Egenhofer M J, Herring J. Categorizing binary topological relations between regions, lines and points in geographic databases[R]. Orono: Department of Surveying Engineering, University of Maine, 1991.
