For my studies I need to write an effective parallel program to find an object that not visible for the maximum number of other objects at the given moment within a matrix.
- MPI with 3 computers
- OpenMP to use 4 cores on each PC
- Optionally CUDA
- The Objects are placed in the matrix of size AxB.
- I have a large file with coordinates of the objects and their timestamps.
- The objects are flights, but velocity is constant.
If I draw a line from the center of the cell of one object (C1) to the center of the cell with another object (C3) and the line cross a cell with additional object (C2) this means:
- C1 do not see C3
- C3 do not see C1
Is there any known algorithm for similar problem (may be some problem in graphics), that I can look on the solution?
Thank you for any help.
Update: final solution https://github.com/anod/CriticalLevelCalculation