Terrain visibility graphs: persistence is not enough

DOI10.4230/LIPICS.SOCG.2020.6MaRDI QIDQ6059953zbMATH OpenFDO

Authors Erik Krohn, Qing Wang

Publication date 2 November 2023

Full work available at URL https://arxiv.org/abs/2004.00750

zbMATH Keywords

terrainsvisibility graph characterizationvisibility graph recognition

Mathematics Subject Classification ID

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

Recommendations

• On characterizing terrain visibility graphs
• scientific article; zbMATH DE number 4085050
• Some results on visibility graphs
• Recognizing Visibility Graphs of Triangulated Irregular Networks
• Negative results on characterizing visibility graphs

Cited in

(7)

• Persistent graphs and cyclic polytope triangulations
• A fast shortest path algorithm on terrain-like graphs
• Visibility maps of realistic terrains have linear smoothed complexity
• Terrain-like graphs and the median Genocchi numbers
• One-sided terrain guarding and chordal graphs
• Colouring polygon visibility graphs and their generalizations
• Compact representation of semilinear and terrain-like graphs

This page was built for publication: Terrain visibility graphs: persistence is not enough

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