Near optimal line segment queries in simple polygons
From MaRDI portal
Publication:891822
DOI10.1016/j.jda.2015.10.002zbMath1344.68261arXiv1309.7803OpenAlexW2186787857MaRDI QIDQ891822
Mohammad Ghodsi, Mojtaba Nouri Bygi
Publication date: 17 November 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7803
Related Items
Cites Work
- Visibility and intersection problems in plane geometry
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- Visibility queries and maintenance in simple polygons
- Efficient visibility queries in simple polygons
- Weak visibility queries of line segments in simple polygons
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
- Optimal Search in Planar Subdivisions
- Weak visibility queries of line segments in simple polygons and polygonal domains
- Visibility Algorithms in the Plane