Neighbouring cities • N = # Neighboring Cities • N equally spaced rays • Rotate all by Phi Phi • Perturb each by Theta i • Find nearest vertex 43 Jan Beneš - Procedural Modelling of Urban Road Networks
Neighbouring cities • N = # Neighboring Cities Theta 3 • N equally spaced rays Theta 4 • Rotate all by Phi Theta 2 Theta 0 • Perturb each by Theta i • Find nearest vertex Theta 1 44 Jan Beneš - Procedural Modelling of Urban Road Networks
Neighbouring cities E D • N = # Neighboring Cities Theta 3 • N equally spaced rays Theta 4 • Rotate all by Phi Theta 2 Theta 0 A C • Perturb each by Theta i • Intersect the border Theta 1 B 45 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Build Roads in Order 1. AC (157 deg) 2. BD (155 deg) 3. CE (140 deg) • After each road A C – Make the most recent road cheaper • Variations – Shuffle in more pairs B 46 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 47 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 48 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 49 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 50 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 51 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 52 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 53 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 54 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network Initial Road Network E D • Connect opposite cities 1. AC 2. BD 3. CE • Until all are connected A C • Variations – Relax the term “opposite” – Shuffle the order B 55 Jan Beneš - Procedural Modelling of Urban Road Networks
Initial Road Network 56 Jan Beneš - Procedural Modelling of Urban Road Networks
Nuclei of Growth – Major Road Intersections, – Ports – Nearby 57 Jan Beneš - Procedural Modelling of Urban Road Networks
Nuclei of Growth • Major road intersections • Ports • Nearby 58 Jan Beneš - Procedural Modelling of Urban Road Networks
Nuclei of Growth • Major road intersections • Ports • Nearby 59 Jan Beneš - Procedural Modelling of Urban Road Networks
Nuclei of Growth • Major road intersections • Ports • Near existing nuclei • Drives Shape! 60 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Intersections • Sum up weights • Nuclei of Growth • Use as probabilities • Choose N intersections? • N “ Historical context” • Closer = more probable Minor roads 61 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads Nucleus of growth • Intersections • Sum up weights • Nuclei of growth • Use as probabilities • Choose N intersections? • N “ Historical context” • Closer = more probable Minor roads 62 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads Nucleus of growth • Intersections • Sum up weights • Nuclei of growth • Use as probabilities • Choose N intersections? • N “ Historical context” • Closer = more probable Minor roads 63 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads Nucleus of growth • Intersections • Sum up weights • Nuclei of growth • Use as probabilities • Choose N intersections? • N “ Historical context” • Closer = more probable Minor roads 64 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads Nucleus of growth • Intersections • Sum up weights • Nuclei of growth • Use as probabilities • Choose N intersections? • N “ Historical context” • Closer = more probable Minor roads 65 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Expansion • Constraints 66 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Expansion • Constraints 67 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Adaptation 68 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Adaptation 69 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints deg =2 • Adaptation α 70 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Adaptation 71 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Good fit 72 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Good fit 73 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Good fit 74 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Good fit 75 Jan Beneš - Procedural Modelling of Urban Road Networks
Minor Roads • Similar to [Muller01] and [Weber09] • Constraints • Good fit 76 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade Routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 77 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade Routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 78 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade Routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 79 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade Routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 80 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 81 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 82 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • “Historical Context” • Trade routes full? • New trade route • New major road & route • 83 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • trade “Historical context” • time Trade routes full? • New trade route • New major road & route • 84 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • trade “Historical context” • time Trade routes full? • New trade route • New major road & route • 85 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • trade “Historical context” • time Trade routes full? • New trade route • New major road & route • 86 Jan Beneš - Procedural Modelling of Urban Road Networks
Trade Simulation Simulate trade • Neighbouring cities • Trade routes • One • Or more • Amount of trade • trade “Historical context” • time Trade routes full? • New trade route • New major road & route • 87 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 88 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 89 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 90 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 91 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 92 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 93 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 94 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 95 Jan Beneš - Procedural Modelling of Urban Road Networks
Major Roads • [Galin10] Overlay terrain with a graph • Curvature & elevation aware • shortest path • Extend Water graph • Harbour edges • • Existing road network Remove collisions • Stitch together • Use instead • 96 Jan Beneš - Procedural Modelling of Urban Road Networks
Recapitulation 97 Jan Beneš - Procedural Modelling of Urban Road Networks
Recapitulation 98 Jan Beneš - Procedural Modelling of Urban Road Networks
Recapitulation 99 Jan Beneš - Procedural Modelling of Urban Road Networks
Recapitulation 100 Jan Beneš - Procedural Modelling of Urban Road Networks
Recapitulation 101 Jan Beneš - Procedural Modelling of Urban Road Networks
Recommend
More recommend