Some chain visibility problems in a simple polygon

DOI10.1007/BF01840400zbMath0697.68042MaRDI QIDQ911765

Sang-Ho Lee, Kyung-Yong Chwa

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

linear time algorithmvisibilitycomputational geometrysimple polygon

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• A linear algorithm for finding the convex hull of a simple polygon
• Triangulating a simple polygon
• Visibility of a simple polygon
• On finding the convex hull of a simple polygon
• Triangulating Simple Polygons and Equivalent Problems
• A new triangulation-linear class of simple polygons
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon

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