Optimally computing a shortest weakly visible line segment inside a simple polygon
From MaRDI portal
Publication:1614066
DOI10.1016/S0925-7721(01)00058-XzbMath1003.65013OpenAlexW2022832678MaRDI QIDQ1614066
Giri Narasimhan, Asish Kumar Mukhopadhyay, Gautam K. Das, Binay K. Bhattacharya
Publication date: 3 September 2002
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00058-x
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- LR-visibility in polygons
- Shortest watchman routes in simple polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- A simple algorithm for determining the envelope of a set of lines
- Watchman routes under limited visibility
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- External visibility
- A linear algorithm for computing the visibility polygon from a point
- THE TWO GUARDS PROBLEM
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Two-Guard Walkability of Simple Polygons
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- Computing a shortest watchman path in a simple polygon in polynomial-time
- COMPUTATIONAL GEOMETRY COLUMN 18
- An optimal algorithm for detecting weak visibility of a polygon
- Minimal Sets of Visibility
