scientific article; zbMATH DE number 177566

zbMATH Open0764.68060MaRDI QIDQ4037437FDOQ4037437

Authors: Binay Bhattacharya, Godfried Toussaint, Asish Mukhopadhyay 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• 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
• Computing a shortest watchman path in a simple polygon in polynomial-time
• How to extend visibility polygons by mirrors to cover invisible segments
• Three dimensional weak visibility: Complexity and applications
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Title not available (Why is that?)
• Three-dimensional weak visibility: Complexity and applications
• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments

This page was built for publication:

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