GPU parallel visibility algorithm to compute the visibility region of a point into a set of segments using GPU Merge Path.
The algorithm is inspired by mergesort. You can see a demonstration in this jupyter notebook.
The algorithm was first described in this paper: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms.
A paper about this algorithm has been published here: GPU Parallel Visibility Algorithm for a Set of Segments Using Merge Path.