Characterizing and recognizing weak visibility polygons

DOI10.1016/0925-7721(93)90010-4zbMath0777.68077OpenAlexW1989198581MaRDI QIDQ686142

Sudebkumar Prasant Pal, C. E. Veni Madhavan, Anil Maheshwari, Sanjeev Saluja, Subir Kumar Ghosh

Publication date: 1 November 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90010-4

zbMATH Keywords

shortest pathsconvex edgemaximum hidden vertex setvisibility chord

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

FO model checking on geometric graphs ⋮ An algorithm for recognizing palm polygons ⋮ Recognizing weakly convex visible polygons ⋮ Three dimensional weak visibility: Complexity and applications ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ On recognizing and characterizing visibility graphs of simple polygons ⋮ Characterizing LR-visibility polygons and related problems ⋮ Disproving a conjecture on planar visibility graphs ⋮ Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains ⋮ Unnamed Item ⋮ Three-dimensional weak visibility: Complexity and applications ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel ⋮ A constant-factor approximation algorithm for vertex guarding a WV-polygon ⋮ Approximability of guarding weak visibility polygons

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• An algorithmic approach to some problems in terrain navigation
• Hiding people in polygons
• Hybrid shadow testing scheme for ray tracing
• Triangulation and shape-complexity
• Shortest path solves edge-to-edge visibility in a polygon
• A combinational approach to polygon similarity
• Computing the visibility polygon from a convex set and related problems

This page was built for publication: Characterizing and recognizing weak visibility polygons