A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Springer Tracts in Advanced Robotics
Consider a network of nodes in the plane whose locations are unknown but which establish communication links based on proximity. We solve the following problems: given a node in the network, (1) determine if a given cycle surrounds the node; and (2) find some cycle that surrounds the node. The only localization capabilities assumed are unique IDs with binary proximity measure, and, in some cases, cyclic orientation of neighbors. We give complete algorithms for finding and verifying surroundingdoi:10.1007/978-3-540-68405-3_26 fatcat:g7hdri2wzfgltf63ilschsewz4