Marcos Dione's Comments
| Post | When | Comment |
|---|---|---|
| Henderson, Nebraska, A small town missing details | Did you know about this Mastodon bot? https://en.osm.town/@SmallTownUSA |
|
| Delete me. | or some data on the map? |
|
| Gostaria de saber mais como mapear árvores em minha região. Pois temos muitas, distintas e que servem como ponto de referência para nossa região. a | Geralmente são mapeados como um nó (ponto). Em seguida, você pode adicionar itens como a circunferência (não o raio ou o diâmetro!!!), o nome científico (gênero) e outros. Mais detalhes aqui: osm.wiki/Pt:Tag:natural%3Dtree Sugiro também que entre em contato com qualquer uma das comunidades brasileiras: Boa sorte e bem-vinda a bordo! Traduzido com a versão gratuita do tradutor - DeepL.com |
|
| Maxspeed freshness tool | Yeah, no, 1GiB of ram wouldn’t allow you to even import the data, and the disk space is also astronomic: 360GiB for the whole Europe, although in my case it’s all data, while in your case it would be only part of the road network. |
|
| Maxspeed freshness tool | Yes indeed. I just wonder if it wouldn’t be cheaper to import the data into a PG+PostGIS db, update it daily, and serve the tiles directly from there? I’m pretty sure that the last part exists… like this: https://www.crunchydata.com/blog/dynamic-vector-tiles-from-postgis |
|
| First day - my neighborhood is out of date! | Yeah, and then learn how to use iD or JOSM: |
|
| a | You can use it as such, yes. It has its own RSS feed and appears in https://blogs.openstreetmap.org/ |
|
| ATV trails | is max_width related to the max road width or max vehicle width? Wouldn’t it be better if this was united into the width, which I usually use (the very few times I used it) to mark the more narrow width of the section of the road? |
|
| Arabic | Ok, but on which application or site? OSM provides all the necessary data, but its up the the app or site to use it to show the right text. |
|
| Mapping neighborhood common areas | Edit the current polygon if you’re sure that your version is (more) correct. The polygon-and-point is usually used on big areas like tows and cities to mark the ‘neuralgic’ center of the area, typically around the local government’s building/’old town’. See for instance relation/76337 . |
|
| Bannau Brycheiniog '23 | You will have to tell us what dupes you spot, because I can’t find any, really. Also, I can help you deleting them yourself if you want to learn how. |
|
| Postman of Fractal Lane | If you added them recently, OM only updates map data once a month. OsmAnd does too, but if you enable OSM integration, and you edit often enough (the number escapes me), you getbdaily updates. They’re limited, but enough for this kind of things. |
|
| Postman of Fractal Lane |
I wonder what do you use. Osmand tells me a pharmacy not far from here is open until 19h. Organic Maps show today’s and all open hours, but only after I push up the info tab.
You just did? Here:
|
|
| First day | Hi Russel. There are many ways to contribute. I’ll show you some:
Welcome to the map! |
|
| signed up | Things you can do:
|
|
| OSM Revival | Want more? Need more? Here! https://en.osm.town/@SmallTownUSA (Thanks for helping! :) |
|
| A Nice Mapping Trip | Bummer, I was in Antibes too this weekend! And thanks for the EV charging points! |
|
| Popular tags around us | damn, I can’t edit or delete the previous comments? |
|
| Popular tags around us | I gave it a cleanup and commented it a little: ``` from collections import defaultdict from lxml import etree from pprint import pprint import sys tag_count: dict[(str, int)] = defaultdict(int) # default value is int() == 0 with open(sys.argv[1], encoding=”utf-8”) as fp: tree = etree.parse(fp) # NOTE: this loads the whole XML in memory, so make sure you use a small extract root = tree.getroot() root is a node# child is a , or node # grandchild is , or node for child in root: for grandchild in child: # only process tags if grandchild.tag == 'tag': # decomment this line and comment the next one for counting tag+values # mstring = f"{grandchild.attrib['k']}:{grandchild.attrib['v']}" mstring = grandchild.attrib['k'] tag_count[mstring] = tag_count[mstring] + 1 pprint(tag_count) ``` I added a few shortcuts, like |
|
| Popular tags around us | I gave it a cleanup and commented it a little: ``` from collections import defaultdict from lxml import etree from pprint import pprint import sys tag_count: dict[(str, int)] = defaultdict(int) # default value is int() == 0 with open(sys.argv[1], encoding=”utf-8”) as fp: tree = etree.parse(fp) # NOTE: this loads the whole XML in memory, so make sure you use a small extract root = tree.getroot()
I added a few shortcuts, like |