Efficient computation of query point visibility in polygons with holes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Alireza Zarei, Mohammad Ghodsi. Efficient computation of query point visibility in polygons with holes. In Joseph S. B. Mitchell, Günter Rote, editors, Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. pages 314-320, ACM, 2005. [doi]

The following publications are possibly variants of this publication:

Query point visibility computation in polygons with holesAlireza Zarei, Mohammad Ghodsi. comgeo, 39(2):78-90, 2008. [doi]

Query-point visibility constrained shortest paths in simple polygonsRamtin Khosravi, Mohammad Ghodsi. TCS, 389(1-2):1-11, 2007. [doi]

Weak Visibility Queries in Simple PolygonsMojtaba Nouri Bygi, Mohammad Ghodsi. cccg 2011: [doi]

runs on WebDSL