Computing Visibility Information in an Inaccurate Simple Polygon

DOI10.1142/S0218195997000326zbMath0887.68108OpenAlexW2108250208MaRDI QIDQ4375868

J. Mark Keil, Leizhen Cai

Publication date: 8 February 1998

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195997000326

zbMATH Keywords

visibility graphcollision-free pathvisibility skeleton

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Largest and smallest convex hulls for imprecise points ⋮ On additive spanners in weighted graphs with local error ⋮ Fréchet Distance for Uncertain Curves ⋮ Graph spanners: a tutorial review ⋮ Mixed-integer programming approaches for the tree \(t^*\)-spanner problem

This page was built for publication: Computing Visibility Information in an Inaccurate Simple Polygon