FME Desktop Tutorial 2011: Introduction - FME Data Transformation
Fme to map beauty along a route
-
Upload
pascal-brackman -
Category
Technology
-
view
605 -
download
2
description
Transcript of Fme to map beauty along a route
The use of FME in recreational navigation
Using FME to map beauty
Pascal Brackman, Ph.D.Managing Partner RouteYou
Why would we like to map beauty?
And if so,… How?
1?
Why Where?
2?
How?
3
Info &surprise
?
Share &Feedback
4
The context was/is changing
The context was/is changing
The context is changing
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
Just in case
Routing
10
Routing… the basics
5
4
2
4
A
B
Routing… the basics
5/beauty
4/beauty
2/beauty
4/beauty
A
B
Routing… the basics
5/5
4/4
2/1
4/2
A
B
How do we map/calculate beauty
Absolute or relative…
Denis Dutton a Darwinian theory of beauty
90% of people agree on beauty in landscapes…Even by people who don’t have this landscape…Pleistocene landscapes…
Nice landscapesHobbit land
Mantama
http://www.routeyou.com/location/view/47449212/hobbiton-film-set.nl
Nice roads
Nice roads
Nice roads
Nice roads
Nice roads
Nice roads
Nice roads
Nice roads
Ugly landscapes
Ugly roads
Ugly roads
Ugly Roads
Ugly Roads
Ugly roads
The men behind the story
Benjamin David Kevin
Worker Module: Get Spatial Data Within Buffer
• Busy roads• Curvature• Noise (near a highway)• Near forests• BUAs• Parks• Water/rivers/lakes….
2nd source: Professional sources
Mapping other sources with your reference data
Snapper & Getwithin Buffer
You always have too little and too much…
3 layer model
Base Models
Omission detectors
Commission detectors
Specific Model fixers
Detectors
Actors
Fixers Completers
Characterisitic detectors
Perfect actors…
Dead End Cleaner (erosion filter)
Dead End Cleaner (erosion filter)
Dead End Cleaner (2)
Isolated networks
Isolated networks
Specific characteristics
E.g. closed network
Dead-End Non-Dead End Disconnectivity
Completers
Isolated Networks
3rd source: Community
• It’s very likely that one person is wrong once• Some persons are wrong all the time• It’s very unlikely that all persons are wrong all the time
The power ofthecommunity
Community source
Communty data
FME Viewer (debugging
The RouteYou fomulae
Benjamin David Kevin
N formulae => N scores => resistance for beauty
The RouteYou nework
)
Flow of internal workers
The RouteYou network
Python (tile creation) & FME
Tiling and stitching
Size and memory management
The NICEST route
Can we measure it? “Cf. search”
Can we create is when we don’t have enough? Simulating automa…
Data: RTY Netwerk
All cells are equal, but some are more equal…
The Kevin number.
First order neighbours (FON)
Second order neighbours (SON)
- Every cell ‘knows’ which cells are his first order neighbours
- The initial cell will combine with every FON to find the best neighbour to merge
What 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
CellScoreLength
LengthScore
OuterShell
SegSeg *
GROWN TO BEST NEIGHBOUR
The new cell runs through the same flow as the initial cell, if the length criteria isn’t met.
GROWN TO BEST NEW NEIGHBOUR
The new cell runs through the same flow as the initial cell, if the length criteria isn’t met.
FINAL SITUATION AFTER GROWING
The flow stops when the length criteria is met.
Result
Problems
Local minima
Neighbouring
Thank You!
Questions?
For more information: [email protected] [email protected] RouteYou www.routeyou.com