Characterizing LR-visibility polygons and related problems

DOI10.1016/S0925-7721(00)00024-9MaRDI QIDQ5931367zbMATH OpenOpenAlexFDO

Authors Binay Bhattacharya, Subir Kumar Ghosh

Publication date 24 April 2001

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(00)00024-9

zbMATH Keywords

LR-visibility polygonshortest path tree

Mathematics Subject Classification ID

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

Recommendations

• Characterizing and recognizing LR-visibility polygons
• Simple Characterization of LR-visibility Polygons
• A characterization of link-2 LR-visibility polygons with applications
• LR-visibility in polygons
• Computing the visibility polygon from a convex set and related problems
• A characterization of visibility graphs for pseudo-polygons
• scientific article; zbMATH DE number 4085050
• On recognizing and characterizing visibility graphs of simple polygons
• Characterizing and recognizing weak visibility polygons
• scientific article; zbMATH DE number 434872

Cites work

• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An optimal visibility graph algorithm for triangulated simple polygons
• Characterizing and recognizing weak visibility polygons
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Finding all weakly-visible chords of a polygon in linear time
• scientific article; zbMATH DE number 1424307 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• LR-visibility in polygons
• Triangulating a simple polygon in linear time
• Two-Guard Walkability of Simple Polygons
• Visibility of a simple polygon

Cited in

(9)

• An efficient algorithm for the three-guard problem
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• Characterizing and recognizing LR-visibility polygons
• A unified and efficient solution to the room search problem
• Simple Characterization of LR-visibility Polygons
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Finding all door locations that make a room searchable
• Searching for mobile intruders in circular corridors by two 1-searchers
• LR-visibility in polygons

This page was built for publication: Characterizing LR-visibility polygons and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931367)