Some chain visibility problems in a simple polygon

DOI10.1007/BF01840400MaRDI QIDQ911765zbMATH OpenFDO

Authors Sang-Ho Lee, Kyung-Yong Chwa

Publication date 1990

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01840400

zbMATH Keywords

computational geometrylinear time algorithmsimple polygonvisibility

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2077120
• Characterizing and recognizing weak visibility polygons
• Visibility between two edges of a simple polygon
• Visibility of a simple polygon
• Computing the visibility polygon from a convex set and related problems

Cites work

• A linear algorithm for computing the visibility polygon from a point
• A linear algorithm for finding the convex hull of a simple polygon
• A new triangulation-linear class of simple polygons
• An Optimal Algorithm for Finding the Kernel of a Polygon
• scientific article; zbMATH DE number 3932438 (Why is no real title available?)
• scientific article; zbMATH DE number 4050998 (Why is no real title available?)
• On finding the convex hull of a simple polygon
• Triangulating a simple polygon
• Triangulating Simple Polygons and Equivalent Problems
• Visibility and intersection problems in plane geometry
• Visibility of a simple polygon

Cited in

(3)

• scientific article; zbMATH DE number 2077120 (Why is no real title available?)
• Computing the visibility polygon from a convex set and related problems
• LR-visibility in polygons

This page was built for publication: Some chain visibility problems in a simple polygon

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