<html>
<head>
</head>
<body class='hmmessage'><div dir='ltr'>
<style><!--
.hmmessage P
{
margin:0px;
padding:0px
}
body.hmmessage
{
font-size: 12pt;
font-family:Calibri
}
--></style>
<div dir="ltr">Hi all,<br><br>seems nobody else is interested ?<br>If I got it right, the combination<br>addr:place=* & addr:housenumber=* & addr:street!=* <br>is not often used, mappers seem to prefer to <br>give all streets in a hamlet the name of the hamlet,<br>so that they can use the normal scheme with<br>addr:housenumber=* & addr:street=* <br><br>I used osmfilter on europe<br>osmfilter.exe europe.o5m --keep="addr:place= and addr:housenumber=" --drop="addr:street=" -o=addr_place.o5m<br>and found that most elements are in and around <br>the Czech Republic (I see more housenumbers with addr:place than with addr:street)<br><br>So, I wonder if those users who create maps for this area found<br>a trick to make address search (with housenumbers) work?<br><br>@WanMil:<br>I must confess that I did not fully understand your initial post in 2013.<br><br>Gerd<br><br><div>> Date: Thu, 11 Dec 2014 21:24:36 +0100<br>> From: wmgcnfg@web.de<br>> To: mkgmap-dev@lists.mkgmap.org.uk<br>> Subject: Re: [mkgmap-dev] addr:place and housenumbers<br>> <br>> Hi Gerd,<br>> <br>> some time ago I asked if anybody is interested in adding place <br>> boundaries to the precompiled boundaries <br>> (http://www.mkgmap.org.uk/pipermail/mkgmap-dev/2013q2/018003.html).<br>> <br>> I never got a feedback (apart from you) about that so I didn't realize it.<br>> <br>> Your idea expands my idea in creating virtual bounds on the fly based on <br>> node data. My personal opinion is that this supports insufficient <br>> tagging - polygons for hamlets should be created in the OSM DB if are <br>> required - but there seem to be regions where evaluating this tagging <br>> might improve address data a lot.<br>> <br>> My ideas for your thoughts:<br>> For step 2 you can use an algorithm that creates the smallest polygon <br>> around the node set. I don't remember a name of such an algorithm but <br>> you should find one on wikipedia. After that you can increase the <br>> polygons to march upon the neighbour hamlet polygon with an upper <br>> expansion limit (500m?).<br>> <br>> This step might also be perfomed while preprocessing the bounds so it <br>> will not decrease the map creation time very much.<br>> <br>> WanMil<br>> <br>> > Hi all,<br>> ><br>> > I have an idea how to support the evaluation of the addr:place tag.<br>> > I first thought this can all be done with a few rules in the style, but<br>> > it seems that<br>> > the boundaries don't contain the hamlet boundaries, so it is difficult<br>> > to find the<br>> > matching names for streets and nodes.<br>> ><br>> > Idea:<br>> > Step 1:<br>> > - collect all nodes with addr:housenumber=* and addr:place=* and<br>> > addr:street!=*<br>> > - collect all nodes with place=hamlet and name=*<br>> > - collect all unnamed roads<br>> > Step 2:<br>> > For each hamlet, calculate the area (bbox or maybe a circle) containing<br>> > the corresponding<br>> > addr:place nodes (the place=hamlet nodes should help in case that there<br>> > are two or more<br>> > hamlets with the same name in one tile)<br>> > Step 3: Find out the unnamed streets in these areas. Give them the name<br>> > of the hamlet<br>> > and interpret the addr:place tag in the nodes like mkgmap:street (using<br>> > the normal housenumber<br>> > routines)<br>> ><br>> > Is anybody interested in that?<br>> ><br>> > Gerd<br>> ><br>> ><br>> ><br>> ><br>> > _______________________________________________<br>> > mkgmap-dev mailing list<br>> > mkgmap-dev@lists.mkgmap.org.uk<br>> > http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev<br>> ><br>> <br>> _______________________________________________<br>> mkgmap-dev mailing list<br>> mkgmap-dev@lists.mkgmap.org.uk<br>> http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev<br></div></div>
</div></body>
</html>