Weak visibility counting in simple polygons

DOI10.1016/J.CAM.2015.04.018MaRDI QIDQ2351072zbMATH OpenOpenAlexFDO

Authors Mojtaba Nouri Bygi, Shervin Daneshpajouh, Sharareh Alipour, Mohammad Ghodsi

Publication date 22 June 2015

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2015.04.018

zbMATH Keywords

computational geometryvisibility countingweak visibility

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 3883623
• On the number of visibility graphs of simple polygons
• scientific article; zbMATH DE number 434872
• Weak visibility queries of line segments in simple polygons and polygonal domains
• An optimal algorithm for detecting weak visibility of a polygon
• scientific article; zbMATH DE number 4050998
• Characterizing and recognizing weak visibility polygons
• Vertex guarding in weak visibility polygons

Cites work

• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Cutting hyperplanes for divide-and-conquer
• Efficient visibility queries in simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Planar visibility, testing and counting
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Space searching for intersecting objects
• Space/query-time tradeoff for computing the visibility polygon
• Visibility Algorithms in the Plane
• Visibility and intersection problems in plane geometry
• Visibility testing and counting
• Weak visibility queries of line segments in simple polygons and polygonal domains

Cited in

(5)

• Randomized approximation algorithms for planar visibility counting problem
• Visibility testing and counting
• Weak visibility queries of line segments in simple polygons and polygonal domains
• Minimizing visible edges in polyhedra
• Near optimal line segment queries in simple polygons

This page was built for publication: Weak visibility counting in simple polygons

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