Point location in fat subdivisions
Information Processing Letters
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
A Hybrid Approach to Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
A sort-based DDM matching algorithm for HLA
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Offloading Data Distribution Management to Network Processors in HLA-Based Distributed Simulations
IEEE Transactions on Parallel and Distributed Systems
An Approach for Parallel Interest Matching in Distributed Virtual Environments
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
Real-time collision culling of a million bodies on graphics processing units
ACM SIGGRAPH Asia 2010 papers
XMalloc: A Scalable Lock-free Dynamic Memory Allocator for Many-core Machines
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
Finding Rectangle Intersections by Divide-and-Conquer
IEEE Transactions on Computers
A dynamic sort-based DDM matching algorithm for HLA applications
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Parallel Rectangle Intersection Algorithm on GPU+CPU
CCGRID '11 Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
A Parallel Interest Matching Algorithm for Distributed-Memory Systems
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
Box intersection checking is a common task used in many large-scale simulations. Traditional methods cannot provide fast box intersection checking with large-scale datasets. This article presents a parallel algorithm to perform Pairwise Box Intersection checking on Graphics processing units (PBIG). The PBIG algorithm consists of three phases: planning, mapping and checking. The planning phase partitions the space into small cells, the sizes of which are determined to optimize performance. The mapping phase maps the boxes into the cells. The checking phase examines the box intersections in the same cell. Several performance optimizations, including load-balancing, output data compression/encoding, and pipelined execution, are presented for the PBIG algorithm. The experimental results show that the PBIG algorithm can process large-scale datasets and outperforms three well-performing algorithms.