1. An optimal algorithm for determining the visibility polygon from an edge;Avis;IEEE Trans. Comput.,1981
2. Probing polygons minimally is hard;Belleville;Proceedings of the Third Canadian Conference in Computational Geometry,1991
3. Algorithms in Combinatorial Geometry;Edelsbrunner,1988
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. An efficient algorithm for identifying objects using robot probes;Lyons,1988