방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 경관 패턴 지표× | 최소 비용 경로 / 비용 거리 분석× | |
|---|---|---|
| 분야 | 공간분석 | 공간분석 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1988 | 1994 |
| 창시자≠ | R. V. O'Neill et al.; McGarigal & Marks (FRAGSTATS) | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| 유형≠ | Quantitative landscape pattern description | Raster cost-surface routing |
| 원전≠ | O'Neill, R. V., et al. (1988). Indices of landscape pattern. Landscape Ecology, 1(3), 153–162. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ |
| 별칭 | landscape pattern indices, FRAGSTATS metrics, fragmentation indices, peyzaj metrikleri | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol |
| 관련 | 3 | 3 |
| 요약≠ | Landscape metrics are quantitative indices that describe the composition and spatial configuration of a categorical map — typically land cover — at the patch, class, and whole-landscape levels. Developed in landscape ecology (O'Neill and colleagues, 1988) and made widely usable by the FRAGSTATS software, they turn maps into numbers like patch density, edge density, fragmentation, diversity, and connectivity for ecological, planning, and change analysis. | Least-cost path analysis finds the route between two locations that minimizes accumulated travel cost across a landscape, rather than minimizing straight-line distance. By encoding terrain, slope, land cover, and other frictions into a cost surface and accumulating cost outward from a source, it identifies optimal corridors for roads, pipelines, trails, power lines, and wildlife movement — a core raster-GIS technique built on Dijkstra's shortest-path logic. |
| ScholarGate데이터셋 ↗ |
|
|