An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
From MaRDI portal
Publication:4555537
DOI10.1145/3209685zbMath1429.68313OpenAlexW2883926673MaRDI QIDQ4555537
Henri Casanova, Constantinos P. Tsirogiannis, Peyman Afshani, Nodari Sitchinava, Ben Karsin, Colin Lambrechts, Mark T. de Berg
Publication date: 20 November 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/178744242/An_efficient_algorithm_for_the_1D_total_visibility_index_problem_and_its_parallelization.pdf
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear space data structures for two types of range search
- Making data structures persistent
- Parallel algorithms for evaluating sequences of set-manipulation operations
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
- Computing the visibility graph of points within a polygon
- Computing visibility on terrains in external memory