Weak visibility queries of line segments in simple polygons and polygonal domains

DOI10.1080/00207160.2017.1296139zbMath1427.68332arXiv1310.7197OpenAlexW2964309476MaRDI QIDQ4641577

Mojtaba Nouri Bygi, Mohammad Ghodsi

Publication date: 17 May 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.7197

zbMATH Keywords

simple polygonsvisibilitycomputational geometryline segment visibility

Mathematics Subject Classification ID

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

Related Items (4)

Near optimal line segment queries in simple polygons ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Weak visibility queries of line segments in simple polygons ⋮ Weak visibility counting in simple polygons

Cites Work

• Near optimal line segment queries in simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• Weak visibility queries of line segments in simple polygons
• Query point visibility computation in polygons with holes
• Computing the Visibility Polygon of an Island in a Polygonal Domain
• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• Visibility Algorithms in the Plane

This page was built for publication: Weak visibility queries of line segments in simple polygons and polygonal domains