Scott (Minnesota) Map Cropping Samples
Scott (Minnesota) Map Cropping Samples-1
Scott (Minnesota) Map Cropping Samples-2
Scott neighborhoods and villages map with 3D shadow effect
flag map of Scott with 3D shadow effect
Scott map with 3d shadow effect
Download outline map of Scott (geojson format) :
Scott.geojson (**)
Download polygon array of Scott map for "Google Maps" :
Scott.txt
Bounding Box for Scott Map : ( 44.542978 , -93.911401 , 44.813007 , -93.277942 )
Wikipedia ID for Scott : Q491256
Wikipedia SPARQL Query for Scott (population,elevation,area,lat,long, postal code,licence plate) :
SELECT ?population ?elevation ?area ?latitude ?longitude ?postal_code ?license_plate
WHERE {
OPTIONAL { wd:Q491256 wdt:P1082 ?population. }
OPTIONAL { wd:Q491256 wdt:P2044 ?elevation. }
OPTIONAL { wd:Q491256 wdt:P2046 ?area. }
OPTIONAL { wd:Q491256 wdt:P281 ?postal_code. }
OPTIONAL { wd:Q491256 wdt:P395 ?license_plate. }
OPTIONAL {
wd:Q491256 p:P625 ?coordinate.
?coordinate psv:P625 ?coordinate_node.
?coordinate_node wikibase:geoLatitude ?latitude.
?coordinate_node wikibase:geoLongitude ?longitude.
}
}
Run this SPARQL Query on Wikidata Page (Click RUN button on the opened page!)
Run this Query with SPARQL API
Get Boundaries from overpass-turbo (OSM) with boundary box of Scott map
[out:json];
(
relation["boundary"="administrative"]["admin_level"~"5|6|7"](44.542978, -93.911401, 44.813007, -93.277942);
);
out geom;
Run this query on overpass-turbo (Click RUN button on the opened page!)
Get Boundaries from overpass-turbo (OSM) with place name (Scott)
[out:json];
(
rel["name"="Scott"][type=boundary];
rel["name:en"="Scott"][type=boundary];
);
out geom;
Run this query on overpass-turbo (Click RUN button on the opened page!)
Notes:
- You can download geometry data for Scott in various formats (Geojson,KML,GPX,raw OSM data) by clicking export button on the overpass-turbo
- You can freely use the jpeg type map images you created on the "map cropping" page or downloaded from the "samples" pages.
- (**)
Terms of Use for downloaded geojson files.