<html>
<head>
<style><!--
.hmmessage P
{
margin:0px;
padding:0px
}
body.hmmessage
{
font-size: 12pt;
font-family:Calibri
}
--></style></head>
<body class='hmmessage'><div dir='ltr'>Hi all,<br><br>some month ago we discussed the idea to implement addr:place support.<br>It it assumed that an address has addr:housenumber and either addr:place or <br>addr:street. Up to now those with addr:place are ignored.<br>It is also assumed that the addr:place tag is used in hamlets and small villages<br>and that the roads in such a hamlet have no name.<br><br>I've coded the following simple approach:<br> For each element (node/way) with addr:housenumber=* and addr:place=* and addr:street!=*<br>search the nearest routable way that has no name (mkgmap:street!=*)<br>If the closest road is within a given range (150m), store the place name as a possible road<br>name. Perform a 2nd search to find also the closest road with a name or ref.<br>If we find exactly one possible name for the road, use it.<br><br>Problem 1)<br>What should happen if the algo finds multiple possible names for one road?<br><br>This happens quite often. Typical reasons:<br>a) The road is rather long and connects two or more hamlets.<br>I think it would be best to split the road so that we can give it different names.<br>Maybe split into three parts so that the part between the hamlets stays unnamed.<br>b) The road is near the boundary (or on the boundary). Houses on the left belong<br>to hamlet A, the others to B. This is a bit more complicated.<br>I see these possible solutions:<br>b1) ignore the road and the houses which are close to it (address search will not find them)<br>b2) duplicate the road and give the original road the name A and the copy the name B<br><br>Problem 2)<br>What should happen when the closest road is one with a name and the closest unnamed road<br>is too far away?<br>I think in many cases we have to treat this as an error in the OSM data .<br>Problem 2b)<br>What should happen when the closest road is one with a name and the closest unnamed road<br>is a bit more away, e.g. 20m and 50m ?<br>I fear this will require complex analysis, so it will be ignored for now.<br><br>Problem 3)<br>What should happen when the closest road is one with a ref, but no name?<br>I think this is like problem 1). We can split the road, give the part through the hamlet<br>the name of the hamlet (in addition to the ref) <br><br>Do you see other possible problems or solutions? Is one of the suggested solutions a no-go?<br><br>Any input is welcome.<br><br>Gerd<br><br> </div></body>
</html>