Characterizing and recognizing weak visibility polygons
DOI10.1016/0925-7721(93)90010-4zbMATH Open0777.68077OpenAlexW1989198581MaRDI QIDQ686142FDOQ686142
Authors: Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan, 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Computing the visibility polygon from a convex set and related problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulation and shape-complexity
- An optimal visibility graph algorithm for triangulated simple polygons
- Hiding people in polygons
- An algorithmic approach to some problems in terrain navigation
- Hybrid shadow testing scheme for ray tracing
- Shortest path solves edge-to-edge visibility in a polygon
- Title not available (Why is that?)
- A combinational approach to polygon similarity
Cited In (24)
- Finding all weakly-visible chords of a polygon in linear time
- Title not available (Why is that?)
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Computing the visibility polygon from a convex set and related problems
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Recognizing weakly convex visible polygons
- Approximability of guarding weak visibility polygons
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- PLANAR STRONG VISIBILITY
- FO model checking on geometric graphs
- Recognizing weakly simple polygons
- Weak visibility counting in simple polygons
- Visibility concepts in orthogonal polygon recognition
- Three dimensional weak visibility: Complexity and applications
- Computing the maximum clique in the visibility graph of a simple polygon
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Some chain visibility problems in a simple polygon
- An algorithm for recognizing palm polygons
- Characterizing LR-visibility polygons and related problems
- Disproving a conjecture on planar visibility graphs
- Optimal placement of base stations in border surveillance using limited capacity drones
- On recognizing and characterizing visibility graphs of simple polygons
- Three-dimensional weak visibility: Complexity and applications
- Title not available (Why is that?)
This page was built for publication: Characterizing and recognizing weak visibility polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686142)
