Computing the visibility graph of points within a polygon

DOI10.1145/997817.997825MaRDI QIDQ5361651zbMATH OpenOpenAlexFDO

Authors Boaz Ben-Moshe, O. Hall-Holt, 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

zbMATH Keywords

combinatorial complexitylines in spacevisibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing the \(k\)-visibility region of a point in a polygon
• Computing the visibility polygon from an edge
• Query point visibility computation in polygons with holes
• Computing the full visibility graph of a set of line segments
• scientific article; zbMATH DE number 5542506
• Visibility graphs of point sets in the plane
• Visibility graphs of point sets in the plane
• Computing the visibility polygon using few variables
• Computing the visibility polygon from a convex set and related problems
• Computing the \(k\)-crossing visibility region of a point in a polygon

Cited in

(23)

• Visibility of disjoint polygons
• Computing the full visibility graph of a set of line segments
• Computing simple paths from given points inside a polygon
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Computing homotopic line simplification
• On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
• Computing the visibility polygon from an edge
• Computing the Visibility Map of Fat Objects
• scientific article; zbMATH DE number 4090791 (Why is no real title available?)
• Computing a visibility polygon using few variables
• Computing Visibility Information in an Inaccurate Simple Polygon
• scientific article; zbMATH DE number 2077120 (Why is no real title available?)
• An efficient algorithm for the 1D total visibility-index problem and its parallelization
• Spiderman graph: visibility in urban regions
• scientific article; zbMATH DE number 1424307 (Why is no real title available?)
• Visibility Graphs of Anchor Polygons
• Computing Simple Paths on Points in Simple Polygons
• Peeling potatoes near-optimally in near-linear time
• Clique-based separators for geometric intersection graphs
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
• An optimal algorithm for finding the edge visibility polygon under limited visibility
• Near-linear algorithms for visibility graphs over a 1.5-dimensional terrain
• Visibility queries in a polygonal region

This page was built for publication: Computing the visibility graph of points within a polygon

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