Characterizing and recognizing weak visibility polygons

DOI10.1016/0925-7721(93)90010-4MaRDI QIDQ686142zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 4043246
• Recognizing weakly convex visible polygons
• scientific article; zbMATH DE number 753969
• Finding all weakly-visible chords of a polygon in linear time
• scientific article; zbMATH DE number 4050998

Cites work

• scientific article; zbMATH DE number 4050998 (Why is no real title available?)
• A combinational approach to polygon similarity
• An algorithmic approach to some problems in terrain navigation
• An optimal visibility graph algorithm for triangulated simple polygons
• Computing the visibility polygon from a convex set and related problems
• Hiding people in polygons
• Hybrid shadow testing scheme for ray tracing
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Shortest path solves edge-to-edge visibility in a polygon
• Triangulation and shape-complexity

Cited in

(24)

• Computing the maximum clique in the visibility graph of a simple polygon
• Three dimensional weak visibility: Complexity and applications
• A constant-factor approximation algorithm for vertex guarding a WV-polygon
• scientific article; zbMATH DE number 4043246 (Why is no real title available?)
• FO model checking on geometric graphs
• Recognizing weakly simple polygons
• Three-dimensional weak visibility: Complexity and applications
• Some chain visibility problems in a simple polygon
• Disproving a conjecture on planar visibility graphs
• Approximability of guarding weak visibility polygons
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Optimal placement of base stations in border surveillance using limited capacity drones
• FO model checking of geometric graphs
• Visibility concepts in orthogonal polygon recognition
• Recognizing weakly convex visible polygons
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• Finding all weakly-visible chords of a polygon in linear time
• An algorithm for recognizing palm polygons
• Computing the visibility polygon from a convex set and related problems
• Weak visibility counting in simple polygons
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
• Characterizing LR-visibility polygons and related problems
• PLANAR STRONG VISIBILITY
• On recognizing and characterizing visibility graphs of simple polygons

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)