A parallel plane sweep algorithm for multi-core systems

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

Volumn , Issue , 2009, Pages 392-395

  McKenney, Mark ^a   McGuire, Tynan ^a  

^a TEXAS STATE UNIVERSITY   (United States)

Author keywords

Algorithms; H.2.8 database management : database applications Spatial databases and GIS; I.3.5 computer graphics : computational geometry and object modeling Geometric algorithms

Indexed keywords

COMPUTATIONAL GEOMETRY AND OBJECT MODELING; DATABASE APPLICATIONS; DATABASE MANAGEMENT; GEOMETRIC ALGORITHM; SPATIAL DATABASES AND GIS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; MICROPROCESSOR CHIPS;

PARALLEL PROCESSING SYSTEMS;

EID: 74049106511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1653771.1653827     Document Type: Conference Paper

References (6)

1. J. Bentley and T. Ottmann. Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. on Computers, C-28:643-647, 1979.
2. B. Chazelle and H. Edelsbrunner. An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM, 39(1):1-54, 1992.
3. M. Goodrich, J. Tsay, D. Vengroff, and J. Vitter. External-Memory Computational Geometry. In Foundations of Computer Science, pages 714-723, 1993.
4. 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.
5. H.-P. Kriegel, T. Brinkhoff, and R. Schneider. Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems. In International Symposium on Advances in Spatial Databases, pages 5-21, 1991.
6. M. Shamos and D. Hoey. Geometric Intersection Problems. In Foundations of Computer Science, 1976.