LR-visibility in polygons
From MaRDI portal
Publication:676582
DOI10.1016/0925-7721(95)00042-9zbMath0869.68106OpenAlexW1993450089MaRDI QIDQ676582
Giri Narasimhan, Paul J. Heffernan, Gautam K. Das
Publication date: 4 September 1997
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00042-9
Related Items (13)
Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Finding all weakly-visible chords of a polygon in linear time ⋮ A linear-time 2-approximation algorithm for the watchman route problem for simple polygons ⋮ On hamiltonian triangulations in simple polygons (Extended Abstract) ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Approximation algorithms for the watchman route and zookeeper's problems. ⋮ Characterizing and recognizing LR-visibility polygons ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ A unified and efficient solution to the room search problem ⋮ Characterizing LR-visibility polygons and related problems ⋮ ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS ⋮ Walking in Streets with Minimal Sensing ⋮ Walking in streets with minimal sensing
Cites Work
- Visibility and intersection problems in plane geometry
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- THE TWO GUARDS PROBLEM
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- Convex hulls of finite sets of points in two and three dimensions
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Two-Guard Walkability of Simple Polygons
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- An optimal algorithm for detecting weak visibility of a polygon
This page was built for publication: LR-visibility in polygons
