https://github.com/kevinzg/visimerge

Algorithm to find the visible region from a set of line segments
https://github.com/kevinzg/visimerge

computational-geometry visibility

Last synced: 6 months ago
JSON representation

Algorithm to find the visible region from a set of line segments

• Host: GitHub
• URL: https://github.com/kevinzg/visimerge
• Owner: kevinzg
• License: mit
• Created: 2018-03-04T22:01:08.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2019-05-18T17:12:08.000Z (over 6 years ago)
• Last Synced: 2025-04-13T13:04:50.227Z (6 months ago)
• Topics: computational-geometry, visibility
• Language: Cuda
• Size: 485 KB
• Stars: 6
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Visibility Regions Merge

GPU parallel visibility algorithm to compute the visibility region of a point into a set of segments using [GPU Merge Path](http://www.cc.gatech.edu/~bader/papers/GPUMergePath-ICS2012.pdf).

![Visibility region example](./images/visibility_region.png)

The algorithm is inspired by mergesort. You can see a demonstration in [this jupyter notebook](../notebook/notebook/VisibilityRegionsMerge.ipynb).

The algorithm was first described in this paper: [Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms](https://epubs.siam.org/doi/abs/10.1137/0218035).

A paper about this algorithm has been published here: [GPU Parallel Visibility Algorithm for a Set of Segments Using Merge Path](https://www.sciencedirect.com/science/article/pii/S1571066119300052).