A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

DOI10.1007/BFB0028280MaRDI QIDQ4037437zbMATH OpenFDO

Authors Binay Bhattacharya, Godfried Toussaint, Asish Mukhopadhyay

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

linear time algorithmshortest line segment from which a simple polygon is weakly externally visible

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• scientific article; zbMATH DE number 753969
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• scientific article; zbMATH DE number 4043246

Cited in

(11)

• Three-dimensional weak visibility: Complexity and applications
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• How to extend visibility polygons by mirrors to cover invisible segments
• scientific article; zbMATH DE number 3932438 (Why is no real title available?)
• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
• Finding all weakly-visible chords of a polygon in linear time
• Computing a shortest watchman path in a simple polygon in polynomial-time
• Three dimensional weak visibility: Complexity and applications

This page was built for publication: A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

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