LR-visibility in polygons

DOI10.1016/0925-7721(95)00042-9zbMATH0869.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

zbMATH Keywords

weak visibilityLR-visibilitypolygonal visibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Simple Characterization of LR-visibility Polygons
• Characterizing and recognizing LR-visibility polygons
• Characterizing LR-visibility polygons and related problems
• Some chain visibility problems in a simple polygon

Cites work

• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An Optimal Algorithm for Finding the Kernel of a Polygon
• An optimal algorithm for detecting weak visibility of a polygon
• Convex hulls of finite sets of points in two and three dimensions
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• THE TWO GUARDS PROBLEM
• Triangulating a simple polygon in linear time
• Two-Guard Walkability of Simple Polygons
• Visibility and intersection problems in plane geometry

Cited in

(14)

• Walking in streets with minimal sensing
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• A unified and efficient solution to the room search problem
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
• Characterizing and recognizing LR-visibility polygons
• Approximation algorithms for the watchman route and zookeeper's problems.
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Walking in Streets with Minimal Sensing
• Finding all door locations that make a room searchable
• Finding all weakly-visible chords of a polygon in linear time
• Simple Characterization of LR-visibility Polygons
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Characterizing LR-visibility polygons and related problems

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)