Weak visibility counting in simple polygons

DOI10.1016/j.cam.2015.04.018zbMath1329.68260OpenAlexW1986757987MaRDI QIDQ2351072

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

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 geometryweak visibilityvisibility counting

Mathematics Subject Classification ID

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

Related Items (1)

Minimizing visible edges in polyhedra

Cites Work

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

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