[转] Download Images from Multiple Maps

转载自 李旭， Tool: Download Images from Multiple Maps

Summary

SAS Planet是一款俄罗斯绿色免费软件，一直持续不断更新。该软件最大的一个特点就是无水印地从多种网络地图上下载影像，比如Google Earth、ESRI、Yahoo!等等，缺点是至今该软件的英文帮助还不强大，寥寥数页，俄文帮助比较详细，这对于该软件的理解和掌握有困难。

下载地址：Downloads。

Example

试举一例说明下载高清影像之过程。打开SAS Planet，选择Satellite(Google maps)地图展开，选择Selection management，如Fig.1，Rectangular是矩形，Polygonal是多边形，Polyline是折线，在这里选择Visible Area，表示选中当前视图范围。

Fig. 1

Download tab select the type of map and the number of zoom levels. If you want the highest resolution, choose a zoom level of 24, see Fig. 2.

Fig. 2

In the Stitch tab must choose the output format of the images, the options are: JPEG, PNG, BMP, JPEG2000, ECW. Then select the path and name of the output file. Also choose the projection default map projection appears.

These are the minimum required options, the rest is optional, but it is good to play with various options and settings. Now click Start.

Fig. 3

The georeferenced images can be used in ArcGIS, gvSIG, QGIS, Erdas, ENVI, etc, see Fig. 4 displayed under ArcGIS.

Fig. 4

References

[1] Download images from Google Earth.

[2] SAS.Wiki - home page.

时间： 2024-08-08 09:02:57

[转] Download Images from Multiple Maps的相关文章

ZOJ 1671:Walking Ant【bfs】

Walking Ant Time Limit: 2 Seconds      Memory Limit: 65536 KB Ants are quite diligent. They sometimes build their nests beneath flagstones. Here, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to h

zoj 1671 Walking Ant

Walking Ant Time Limit: 2 Seconds      Memory Limit: 65536 KB Ants are quite diligent. They sometimes build their nests beneath flagstones. Here, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to h

Zoj 1671 Walking Ant(BFS+优先队列||记忆化搜索)

Walking Ant Time Limit: 2 Seconds Memory Limit: 65536 KB 点击打开链接 Ants are quite diligent. They sometimes build their nests beneath flagstones. Here, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to

poj 2688 Cleaning Robot (tsp问题)

Cleaning Robot Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4073   Accepted: 1659 Description Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture. Consider the room floor paved with

uva 211（dfs）

211 - The Domino Effect Time limit: 3.000 seconds A standard set of Double Six dominoes contains 28 pieces (called bones) each displaying two numbersfrom 0 (blank) to 6 using dice-like pips. The 28 bones, which are unique, consist of the followingcom

Hypervisor scheduler

Techniques for configuring a?hypervisor?scheduler?to make use of cache topology of processors and physical memory distances between NUMA nodes when making scheduling decisions. In the same or other embodiments the?hypervisor scheduler?can be configur

zoj 1671 Walking Ant【简单bfs】

Walking Ant Time Limit: 2 Seconds      Memory Limit: 65536 KB Ants are quite diligent. They sometimes build their nests beneath flagstones. Here, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to h

第一轮 F

Multiple of 17 Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Download as PDF Multiple of 17 Theorem: If you drop the last digit d of an integer n (n$ \ge$10), subtract 5d from the remaining integer, then the

北大poj-2688

Cleaning Robot Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4395   Accepted: 1763 Description Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture. Consider the room floor paved with