Reconstruction of polygonal sets by constrained and unconstrained double probing |
| |
| Authors: | M Lindenbaum A Bruckstein |
| |
| Affiliation: | (1) Department of Electrical Engineering, Technion-Israel Institute of Technology, 32000 Haifa, Israel;(2) Department of Computer Science, Technion-Israel Institute of Technology, 32000 Haifa, Israel |
| |
| Abstract: | The problem of recovering the shape of planar objects arises in robotics. This work deals with this problem under the assumption that composite double probings are made. Two kinds of double probes are considered and their use for reconstructing convex planar polygons is investigated. For both kinds of probes, lower bounds on the number of probings required for reconstruction under any strategy are obtained and specific strategies which are proven to be almost optimal are provided. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
