Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Topological relationships between complex spatial objects
ACM Transactions on Database Systems (TODS)
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Scalable Parallel Programming with CUDA
Queue - GPU Computing
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A parallel plane sweep algorithm for multi-core systems
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Some computer organizations and their effectiveness
IEEE Transactions on Computers
Hybrid MPI/GPU interpolation for grid DEM construction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Robust and efficient polygon overlay on parallel stream processors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
General purpose computing on graphics processing units provides a relatively low cost mechanism to achieve high computational throughput on desktop computers. However, the architecture of GPUs is fundamentally different than CPUs; thus, traditional algorithms cannot simply be run on a GPU. In this paper, we develop algorithms for the line segment intersection problem and the arrangement problem for GPU architectures.