An efficient algorithm for the 1D total visibility-index problem

DOI10.1137/1.9781611974768.18MaRDI QIDQ5232583zbMATH OpenOpenAlexFDO

Authors Peyman Afshani, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos P. Tsirogiannis, Mark de Berg

Publication date 12 September 2019

Published in 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974768.18

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient algorithm for the 1D total visibility-index problem and its parallelization
• Computing visibility on terrains in external memory
• Parallelizing an Algorithm for Visibility on Polyhedral Terrain
• REGION INTERVISIBILITY IN TERRAINS
• TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS

Cited in

(4)

• Computing visibility on terrains in external memory
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• An efficient algorithm for the 1D total visibility-index problem and its parallelization

This page was built for publication: An efficient algorithm for the 1D total visibility-index problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232583)