Computing Visibility Information in an Inaccurate Simple Polygon

DOI10.1142/S0218195997000326MaRDI QIDQ4375868zbMATH OpenOpenAlexFDO

Authors Leizhen Cai, J. Mark Keil

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

collision-free pathvisibility graphvisibility skeleton

Mathematics Subject Classification ID

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

Recommendations

• Computing the visibility graph of points within a polygon
• Efficient visibility queries in simple polygons
• scientific article; zbMATH DE number 4043246
• Visibility between two edges of a simple polygon
• Visibility of disjoint polygons

Cited in

(5)

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

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

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