Computing in linear time a chord from which a simple polygon is weakly internally visible

DOI10.1007/BFB0015405MaRDI QIDQ6487941zbMATH OpenFDO

Authors Binay Bhattacharya, Asish Mukhopadhyay

Publication date 21 March 2023

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 753969
• Finding all weakly-visible chords of a polygon in linear time
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• scientific article; zbMATH DE number 4043246
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• A linear algorithm for computing the visibility polygon from a point
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Minimal Sets of Visibility
• Triangulating a simple polygon in linear time

Cited in

(4)

• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• Finding all weakly-visible chords of a polygon in linear time
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
• Optimally computing a shortest weakly visible line segment inside a simple polygon

This page was built for publication: Computing in linear time a chord from which a simple polygon is weakly internally visible

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