LR-visibility in polygons
From MaRDI portal
Publication:676582
DOI10.1016/0925-7721(95)00042-9zbMATH Open0869.68106OpenAlexW1993450089MaRDI QIDQ676582FDOQ676582
Authors: Paul J. Heffernan, Giri Narasimhan, 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
Recommendations
Cites Work
- Triangulating a simple polygon in linear time
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Visibility and intersection problems in plane geometry
- Convex hulls of finite sets of points in two and three dimensions
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- THE TWO GUARDS PROBLEM
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- Two-Guard Walkability of Simple Polygons
- An optimal algorithm for detecting weak visibility of a polygon
Cited In (14)
- Finding all weakly-visible chords of a polygon in linear time
- A unified and efficient solution to the room search problem
- Simple Characterization of LR-visibility Polygons
- Finding all door locations that make a room searchable
- Walking in streets with minimal sensing
- Walking in Streets with Minimal Sensing
- Characterizing and recognizing LR-visibility polygons
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Approximation algorithms for the watchman route and zookeeper's problems.
- Characterizing LR-visibility polygons and related problems
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- On hamiltonian triangulations in simple polygons (Extended Abstract)
This page was built for publication: LR-visibility in polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676582)
