Characterizing LR-visibility polygons and related problems

DOI10.1016/S0925-7721(00)00024-9zbMath0976.68159OpenAlexW1555683046MaRDI QIDQ5931367

Binay K. 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)

Related Items (7)

A linear-time 2-approximation algorithm for the watchman route problem for simple polygons ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Searching for mobile intruders in circular corridors by two 1-searchers ⋮ 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 ⋮ An efficient algorithm for the three-guard problem

Cites Work

• Unnamed Item
• LR-visibility in polygons
• Characterizing and recognizing weak visibility polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• Triangulating a simple polygon in linear time
• Visibility of a simple polygon
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• Two-Guard Walkability of Simple Polygons
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Finding all weakly-visible chords of a polygon in linear time

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