Computing the Visibility Polygon of an Island in a Polygonal Domain

DOI10.1007/978-3-642-31594-7_19zbMath1272.68408OpenAlexW188591245MaRDI QIDQ2843250

Haitao Wang, Danny Z. Chen

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_19

Mathematics Subject Classification ID

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

Related Items (4)

Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Weak visibility queries of line segments in simple polygons and polygonal domains ⋮ Computing the \(L_1\) geodesic diameter and center of a polygonal domain ⋮ Visibility and ray shooting queries in polygonal domains

This page was built for publication: Computing the Visibility Polygon of an Island in a Polygonal Domain