What's the point of mapping beautiful landscapes. And how do you model routing through these landscapes? A case of RouteYou with FME.

1. The use of FME in recreational navigation Using FME to map beauty Pascal Brackman, Ph.D. Managing Partner RouteYou

2. Why would we like to map beauty? And if so,… How?

3. 1 ? Why Where? ? 2 How?

4. 3 ? Info & surprise 4 Share & Feedback

5. The context was/is changing

6. The context was/is changing

7. The context is changing

8. A demo is worth a thousand words Searching for a route Why we need “quality of a route” Do we have enough routes? Planning a route

9. Just in case

10. Routing 10

11. Routing… the basics A 5 2 4 4 B

12. Routing… the basics A 5/beauty 2/beauty 4/beauty 4/beauty B

13. Routing… the basics A 5/5 2/1 4/4 4/2 B

14. How do we map/calculate beauty

15. Beauty… and uglyness A Grotesque Old Woman orThe Ugly Duchess QuintinMassys in Antwerp

16. Absolute or relative… 90% of people agree on beauty in landscapes… Even by people who don’t have this landscape… Pleistocene landscapes… Denis Dutton a Darwinian theory of beauty

17. Nice landscapes Hobbit land Mantama http://www.routeyou.com/location/view/47449212/hobbiton-film-set.nl

18. Nice roads

19. Nice roads

20. Nice roads

21. Nice roads

22. Nice roads

23. Nice roads

24. Nice roads

25. Nice roads

26. Nice roads

27. Nice roads

28. Ugly landscapes

29. Ugly roads

30. Ugly roads

31. Ugly Roads

32. Ugly Roads

33. Ugly roads

34. The men behind the story Benjamin David Kevin

36. Curvature

37. Noise (near a highway)

38. Near forests

39. BUAs

40. Parks

42. Snapper & Getwithin Buffer

43. You always have too little and too much…

44. 3 layer model Perfect actors… Base Models Actors Omission detectors Commission detectors Detectors Characterisitic detectors Fixers Specific Model fixers Completers

45. Dead End Cleaner (erosion filter)

46. Dead End Cleaner (erosion filter)

47. Dead End Cleaner (2)

48. Isolated networks

49. Isolated networks

50. Specific characteristics E.g. closed network

51. Dead-End Non-Dead End Disconnectivity

52. Completers

53. Isolated Networks

56. Some persons are wrong all the time

58. Communty data

59. FME Viewer (debugging

60. The RouteYou fomulae Benjamin David Kevin N formulae => N scores => resistance for beauty

61. The RouteYounework

62. )

63. Flow of internal workers

64. The RouteYou network

65. Python (tile creation) & FME

66. Tiling and stitching Size and memory management

68. The NICEST route Can we measure it? “Cf. search” Can we create is when we don’t have enough? Simulating automa…

69. Data: RTY Netwerk

70. All cells are equal, but some are more equal… The Kevin number.

72. The initial cell will combine with every FON to find the best neighbour to mergeWhat is best ? The sum of every segments score multiplied by his length in the outer shell of the merged cell, devided by the total length of the outer shell First order neighbours (FON) Second order neighbours (SON)

73. GROWN TO BEST NEIGHBOUR The new cell runs through the same flow as the initial cell, if the length criteria isn’t met.

74. GROWN TO BEST NEW NEIGHBOUR The new cell runs through the same flow as the initial cell, if the length criteria isn’t met.

75. FINAL SITUATION AFTER GROWING The flow stops when the length criteria is met.

76. Result

77. Problems Local minima

79. Neighbouring

81. Thank You! Questions? For more information: info@routeyou.com Pascal.brackman@routeyou.com RouteYou www.routeyou.com