Computing the visibility graph of points within a polygon
From MaRDI portal
Publication:5361651
DOI10.1145/997817.997825zbMath1373.68424OpenAlexW2109416368MaRDI QIDQ5361651
O. Hall-Holt, Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997825
Related Items
Computing simple paths from given points inside a polygon ⋮ Computing Simple Paths on Points in Simple Polygons ⋮ An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ On Voronoi visibility maps of 1.5D terrains with multiple viewpoints ⋮ Clique-based separators for geometric intersection graphs ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles ⋮ Computing homotopic line simplification
This page was built for publication: Computing the visibility graph of points within a polygon
