Geospatial overlay computation on the GPU

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2011, Pages 473-476

  McKenney, Mark ^a   De Luna, Gabriel ^b   Hill, Schiller ^a   Lowell, Logan ^a  

^a TEXAS STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS   (United States)

Author keywords

algorithms; GPU; parallel algorithms; spatial operations

Indexed keywords

GENERAL-PURPOSE COMPUTING; GEO-SPATIAL; GPU; GRAPHICS PROCESSING UNIT; LINE SEGMENT INTERSECTION; LOW COSTS; SPATIAL OPERATIONS;

ALGORITHMS; INFORMATION SYSTEMS; PARALLEL ALGORITHMS; PERSONAL COMPUTERS; PROGRAM PROCESSORS;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 84856481626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2093973.2094051     Document Type: Conference Paper

References (14)

1. NVIDIA CUDA C Programming Guide 4.0. Nvidia Corporation, 2011.
2. I. J. Balaban. An Optimal Algorithm for Finding Segments Intersections. In ACM Annual Symp. on Computational Geometry, pages 211-219, 1995.
3. J. Bentley and T. Ottmann. Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. on Computers, C-28:643-647, 1979. (Pubitemid 10420519)
4. B. Chazelle and H. Edelsbrunner. An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM, 39(1):1-54, 1992. (Pubitemid 23600416)
5. M. Flynn. Some Computer Organizations and Their Effectiveness. IEEE Transactions on Computers, C-21(9):948-960, 1972.
6. M. Goodrich, M. Ghouse, and J. Bright. Generalized Sweep Methods for Parallel Computational Geometry. In SPAA '90: Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, pages 280-289, New York, NY, USA, 1990. ACM.
7. M. Goodrich, J. Tsay, D. Vengroff, and J. Vitter. External-Memory Computational Geometry. In Foundations of Computer Science, pages 714-723, 1993.
8. M. T. Goodrich. Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. In ACM Symposium on Parallel Algorithms and Architectures, pages 127-137, 1989.
9. E. Lindholm, J. Nickolls, S. Oberman, and J. Montrym. NVIDIA Tesla: A Unified Graphics and Computing Architecture. IEEE Micro, 28(2):39 -55, 2008.
10. M. McKenney and T. McGuire. A Parallel Plane Sweep Algorithm for Multi-Core Systems. In ACM SIGSPATIAL International Symposium on Geographic Information Systems, 2009.
11. J. Nickolls, I. Buck, M. Garland, and K. Skadron. Scalable Parallel Programming with CUDA. ACM Queue, 6:40-53, 2008.
12. J. Nievergelt and F. P. Preparata. Plane-Sweep Algorithms for Intersecting Geometric Figures. Communications of the ACM, 25:739-747, 1982.
13. M. Schneider and T. Behr. Topological Relationships between Complex Spatial Objects. ACM Trans. on Database Systems (TODS), 31(1):39-81, 2006.
14. M. Shamos and D. Hoey. Geometric Intersection Problems. In Foundations of Computer Science, 1976.