#2 doc #15855, #15864

docs/web/docs/Simulation/Routing.md

@@ -213,6 +213,8 @@ It uses a precomputed distance table to selected network edges (so-called landma
 
 - A lookup table can be generated by creating a file with one landmark edge id per line (e.g. landmarks.txt)
 and then setting the options **--astar.landmark-distances landmarks.txt --astar.save-landmark-distances lookuptable.txt**.
+  - an alternative input for generating a distance table is one geo-coordinate in the form `LON LAT` per line
+  - the tool [generateLandmarks.py](../Tools/Misc.md#generatelandmarkspy) can be used to generate a landmark input file by distributing edges around the rim of the network in all directions
 - As a rule of thumb using 8-16 edges distributed around the main roads that border the network achieve good ALT-performance. Using more edges is not recommended because each landmark adds a fixed overhead).
 - by using *astar* together with the option **--astar.all-distances** {{DT_FILE}} the A\* algorithm is
   used together with a complete (and often huge) distance table to allow for blazing fast search. This is only recommended for medium sized networks with a high number of routing queries