Probing polygons minimally is hard
- 31 March 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (5) , 255-265
- https://doi.org/10.1016/0925-7721(93)90022-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An efficient algorithm for identifying objects using robot probesThe Visual Computer, 1994
- Probing polygons minimally is hardComputational Geometry, 1993
- Computational Geometry--An Introduction.Mathematics of Computation, 1986
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981