Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Takeshi Shirabe"'
Autor:
Lindsi Seegmiller, Takeshi Shirabe
Publikováno v:
Annals of GIS, Vol 29, Iss 2, Pp 205-225 (2023)
ABSTRACTThe least-cost path problem is a widely studied problems in geographic information science. In raster space, the problem is to find a path that accumulates the least amount of cost between two locations based on the assumptions that the path
Externí odkaz:
https://doaj.org/article/0efd39fee9954199aa3c68786fe3fbbd
Publikováno v:
Ecological Processes, Vol 10, Iss 1, Pp 1-19 (2021)
Abstract Background Connectivity is an important landscape attribute in ecological studies and conservation practices and is often expressed in terms of effective distance. If the cost of movement of an organism over a landscape is effectively repres
Externí odkaz:
https://doaj.org/article/cfe399100e854bbd85d6542fd6d3b503
Autor:
Takeshi Shirabe, Lindsi Seegmiller
Publikováno v:
Transactions in GIS. 26:1098-1115
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fa231b2ebb86f0f1e07424aff10323e
https://doi.org/10.1111/tgis.12864
https://doi.org/10.1111/tgis.12864
Publikováno v:
International Journal of Geographical Information Science. :1-22
Given a grid of cells, each having a value indicating its cost per unit area, a variant of the least-cost path problem is to find a corridor of a specified width connecting two termini such that it...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8101ec3965ebc53605185c494759c2c
https://doi.org/10.1080/13658816.2020.1850734
https://doi.org/10.1080/13658816.2020.1850734
Selection of optimal paths or sequences of cells from a grid of cells is one of the most basic functions of raster-based geographic information systems. For this function to work, it is often assumed that the optimality of a path can be evaluated by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56808532da323b18e7e78d1206d5b315
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-285379
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-285379
Publikováno v:
International Journal of Geographical Information Science. 32:2169-2188
Planners who are involved in locational decision-making often useraster-based geographic information systems to quantify the valueof land in terms of suitability or cost for a certain use. From acomputational point of view, this process can be seen a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98ab611547528a2e98589c0ffd34e62e
https://doi.org/10.1080/13658816.2018.1498504
https://doi.org/10.1080/13658816.2018.1498504
Autor:
Takeshi Shirabe
Publikováno v:
Ecological Informatics. 44:109-116
Conservation of wildlife corridors has been an option to counter the problem of loss and fragmentation of wildlife habitat. A mathematical model often adopted in this option uses an algorithm for f ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5c9a1d1e0dbf3dbc8df525bf095cd8f
https://doi.org/10.1016/j.ecoinf.2018.02.002
https://doi.org/10.1016/j.ecoinf.2018.02.002
Autor:
Takeshi Shirabe
Publikováno v:
International Journal of Geographical Information Science. 30:1469-1485
Given a grid of cells each having an associated cost value, a raster version of the least-cost path problem seeks a sequence of cells connecting two specified cells such that its total accumulated cost is minimized. Identifying least-cost paths is on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::892636bbb60a495b73f6ec387a143c5a
https://doi.org/10.1080/13658816.2015.1124435
https://doi.org/10.1080/13658816.2015.1124435
Autor:
Takeshi Shirabe
Publikováno v:
International Journal of Geographical Information Science. 28:314-325
This paper considers the problem of planning a path in a circumstance where its origin is given, but its destination is not specified and is to be selected from among a set of candidate destinations during a trip. A situation like this may be experie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e53e0bb90cf76a87737763216cfdeb58
https://doi.org/10.1080/13658816.2013.838769
https://doi.org/10.1080/13658816.2013.838769
Autor:
Takeshi Shirabe
Publikováno v:
Geographic Information Science ISBN: 9783319457376
GIScience
GIScience
Given a grid of cells each having a cost value, a variant of the least-cost path problem seeks a corridor—represented by a swath of cells rather than a sequence of cells—connecting two terminuses such that its total accumulated cost is minimized.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9e5aeba8eebc7a6424102b217666192
https://doi.org/10.1007/978-3-319-45738-3_7
https://doi.org/10.1007/978-3-319-45738-3_7