Timeline for Correct use of the terms geographic, path, and Euclidean distance

5 events

when toggle format	what		by	license	comment
Jun 11, 2020 at 15:27	history	edited	CommunityBot		Commonmark migration
Jul 4, 2012 at 17:45	comment	added	whuber		@Paul You are correct that the algorithms are graph-theoretic. However, the graph is not given explicitly (in the usual forms of pairs of vertices or adjacency matrices): it is determined by neighbor-to-neighbor relations implied by the gridded representation of the data. This is far more efficient (in terms of RAM, anyway) than explicitly representing the graph. Similarly, higher dimensional grids, with a comparably efficient representation of neighboring cells, are likely to work well for optimizing higher-order path functionals.
Jul 4, 2012 at 11:52	vote	accept	digitalmaps
Jul 4, 2012 at 11:51	comment	added	digitalmaps		Utterly comprehensive and detailed answer! I thought that cost distance calculations were typically implemented using graph theory representations of rasters. The cost distances are, then, found as the minimum weight path through a weighted graph. While this may be a typical algorithmic solution, is the approach you imply likely to be more efficient?
Jul 3, 2012 at 20:05	history	answered	whuber	CC BY-SA 3.0