Summary
Neighborhood-based algorithms have access to only the most basic spatial information. Location-based algorithms, however, relax this restriction and assume access to a broader range of spatial information, such as the coordinate locations of nodes. As a result, location-based algorithms can provide a much broader range of functionality, including generating planar network topologies; efficient geographic routing; computing the area and centroid of regions; and identifying the topological structure of complex areal objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Duckham, M. (2013). Location-Based Algorithms. In: Decentralized Spatial Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30853-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-30853-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30852-9
Online ISBN: 978-3-642-30853-6
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)