The fastest way to view a query point in simple polygons - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ramtin Khosravi, Mohammad Ghodsi. The fastest way to view a query point in simple polygons. In (Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. pages 187-190, Technische Universiteit Eindhoven, 2005. [doi]

The following publications are possibly variants of this publication:

Visiting a Polygon on the Optimal Way to a Query PointRamtin Khosravi, Mohammad Ghodsi. faw 2008: 245-251 [doi]

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

runs on WebDSL