2012
DOI: 10.1080/01426397.2011.650628
|View full text |Cite
|
Sign up to set email alerts
|

The Algorithmic Complexity of Landscapes

Abstract: A method to evaluate the algorithmic complexity of landscapes is developed here, based on the notion of Kolmogorov complexity (or K-complexity). The K-complexity of a landscape is calculated from a string x of symbols representing the landscape's features (e.g. land use), whereby each symbol belongs to an alphabet L, and can be defined as the size of the shortest string y that fully describes x. K-complexity presents several useful aspects as a measure of landscape complexity: a) it is a direct measure of comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 45 publications
(12 citation statements)
references
References 36 publications
0
12
0
Order By: Relevance
“…In the case of route finding, this algorithm also reflects the minimal distance traveled. This is an interesting theoretical problem which refers to the "traveling salesman" problem (that has been proven to be very hard to solve), and to newer approaches dealing with complexity in geographical studies [16,17].…”
Section: Discussionmentioning
confidence: 99%
“…In the case of route finding, this algorithm also reflects the minimal distance traveled. This is an interesting theoretical problem which refers to the "traveling salesman" problem (that has been proven to be very hard to solve), and to newer approaches dealing with complexity in geographical studies [16,17].…”
Section: Discussionmentioning
confidence: 99%
“…For the assessment of spatially enabled RDF stores, in which an even higher level of complexity arises [40,41], Kolas [42] proposed and performed a benchmark for the geospatial query capacity of RDF stores; however, since it was proposed before the standardization of GeoSPARQL, not much from that work can be applied to today's developments. Battle and Kolas [43] demonstrated the geospatial capacity of Parliament and successfully ran a number of GeoSPARQL-compliant queries.…”
Section: Assessment and Benchmarking Of Spatially Enabled Rdf Storesmentioning
confidence: 99%
“…Additionally, a structurally more complex field will naturally lead to more complex membership functions, so that an extracted ECO from this field may have holes and inner boundaries [44]. is a large lake.…”
Section: Element-clustering Objectsmentioning
confidence: 99%