[OSM-dev] Reverse geocoding - nearest nodes vs areas

[Michael Handerek]

Hi,

I played a little bit with different ideas and concepts to realize a
reverse geocoding tool. I also found some existing implementations like
the namefinder and the navigation subsystem of traveling sales man. I
noticed that all solutions search for tagged nodes and ways in specified
max. distance. 

In my opinion, checking if a point is part of an area geometry is more
precise than setting a marginal distance for the nearest tagged nodes,
isn't it? But what about the performance aspect, nearest node vs area?


Regards, mic