Computing the k-crossing visibility region of a point in a polygon

DOI10.1007/978-3-030-25005-8_2MaRDI QIDQ2301732zbMATH OpenOpenAlexFDO

Authors Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_2

zbMATH Keywords

computational geometryvisibilityradial decomposition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing the \(k\)-visibility region of a point in a polygon
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
• Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
• Visibility queries in a polygonal region
• Visibility queries and maintenance in simple polygons

Cited in

(3)

• Computing the visibility graph of points within a polygon
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
• Computing the \(k\)-visibility region of a point in a polygon

This page was built for publication: Computing the \(k\)-crossing visibility region of a point in a polygon

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