COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
DOI10.1142/S0218195999000078zbMATH Open1020.52014MaRDI QIDQ4513233FDOQ4513233
Authors: Binay Bhattacharya, Godfried Toussaint, Asish Mukhopadhyay 
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- scientific article; zbMATH DE number 177566
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- scientific article; zbMATH DE number 3883623
- Weak visibility queries of line segments in simple polygons and polygonal domains
- Computing in linear time a chord from which a simple polygon is weakly internally visible
- An optimal algorithm for detecting weak visibility of a polygon
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- On common transversals
- Finding transversals for sets of simple geometric figures
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- Two counterexamples concerning transversals for convex subsets of the plane
- Computing shortest transversals
- A simple algorithm for determining the envelope of a set of lines
Cited In (5)
- Computing in linear time a chord from which a simple polygon is weakly internally visible
- Title not available (Why is that?)
- Computing external farthest neighbors for a simple polygon
- 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
This page was built for publication: COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513233)
