I did an undergraduate project based on the same paper as this (not nearly the same quality, but similar enough if you squint).
The procedural method used for this kind of generation is really powerful -- you usually see L-Systems being used to create basic sort of fractals but these sort of implementations can become pretty smart. For example, you can provide a height map of the terrain, and make it so that the roads find smooth paths down hills.
And then that's before you realise that the buildings themselves can be generated via rules which describe how to make buildings. And then, the layout of rooms in a building, and the layout of furniture in each room. There's some really impressive potential here if a group of people were devoted enough.
Following the the BLM protests on the police scanner recently, I spent a day studying maps of Manhattan. What comes to mind here, is how some old roads remain like Broadway -> old postal road, that were laid in past times when the patterns of settlement were different from now. And also how parts of the grid have be repurposed into pedestrian only areas, as urban theory / demands has moved on from when the grid was made. It would be neat if something like this could generate patterns on top of patterns, to get these kind of historical layers.
Broadway is a great example of something having very long-lasting effects. It’s much older than a postal road, being originally formed as a footpath used by the local native tribes to travel up and down Manhattan. It roughly followed a ridge line that is not very evident in lower Manhattan today but becomes much more obvious when you get up to northern Harlem, Washington Heights and Inwood.
In the demo pics there are radial/circular subdivisions. I find this odd, given that it's supposed to be an "American-style" generator. I've personally never seen any american city that has radial subdivisions.
Oh my goodness I love this. My husband once told me that when I died he would upload my brain into a machine that was constantly playing Cities Skylines. This looks to be focused mostly on urban grid design; have you given thought to what a suburban generator might look like?
Rather than procedural, I wonder what it would look like if you wrote software to mash the vector data for several different randomly-chosen cities' openstreetmap data together.
Taken a step further, train an AI on existing cities and have it imagine a new one. Ideally, you could sketch a basic outline (this part is waterfront, this part is the downtown, this is on a hillside) and it would fill in the details.
>Robust-first Computing: Distributed City Generation: A rough video demo of Trent R. Small's procedural city generation dynamics in the Movable Feast Machine simulator.
>Local Routing in a new Indefinitely Scalable Architecture, by Trent Small.
>Abstract: Local routing is a problem which most of us face on a daily basis as we move around the cities we live in. This study proposes several routing methods based on road signs in a procedurally generated city which does not assume knowledge of global city structure and shows its overall efficiency in a variety of dense city environments. We show that techniques such as Intersection-Canalization allow for this method to be feasible for routing information arbitrarily on an architecture with limited resources.
More info and links about David Ackley's work on Robust First Computing and the Moveable Feast Machine:
>A "Moveable Feast Machine" is a "Robust First" asynchronous distributed fault tolerant cellular-automata-like computer architecture. It's similar to a Cellular Automata, but it different in several important ways, for the sake of "Robust First Computing". These differences give some insight into what CA really are, and what their limitations are.
>Cellular Automata are synchronous and deterministic, and can only modify the current cell: all cells are evaluated at once (so the evaluation order doesn't matter), so it's necessary to double buffer the "before" and "after" cells, and the rule can only change the value of the current (center) cell. Moveable Feast Machines are like asynchronous non-deterministic cellular automata with large windows that can modify adjacent cells.
if you are migraine-sensitive or have vision/neuro issues, proceed with caution. Contains high contrast overlapping patterns on a blank generator page (no immediate animations though fortunately)
Quite difficult to use because there are no control buttons there. Specifically for zoom control, two options are required for that. Also there are no instructions on how to make a map for a particular location that we want. And there is no description (tooltip) on every feature, new users get confused.
[+] [-] thdrdt|5 years ago|reply
He also has some great talks on YouTube about generating city maps with cube marching and wave function collapse.
His online map generator: http://oskarstalberg.com/game/CityGenerator/
What I like about his approach is that it looks very natural European instead of American.
[+] [-] rob2312|5 years ago|reply
The procedural method used for this kind of generation is really powerful -- you usually see L-Systems being used to create basic sort of fractals but these sort of implementations can become pretty smart. For example, you can provide a height map of the terrain, and make it so that the roads find smooth paths down hills.
And then that's before you realise that the buildings themselves can be generated via rules which describe how to make buildings. And then, the layout of rooms in a building, and the layout of furniture in each room. There's some really impressive potential here if a group of people were devoted enough.
Another good paper is: http://peterwonka.net/Publications/pdfs/2006.SG.Mueller.Proc...
[+] [-] q_andrew|5 years ago|reply
[+] [-] clairity|5 years ago|reply
[+] [-] totetsu|5 years ago|reply
[+] [-] acafourek|5 years ago|reply
[+] [-] gruez|5 years ago|reply
[+] [-] MrMetlHed|5 years ago|reply
https://www.google.com/maps/place/Washington,+DC/@38.9099853...
[+] [-] ecopoesis|5 years ago|reply
[+] [-] twic|5 years ago|reply
[+] [-] unknown|5 years ago|reply
[deleted]
[+] [-] victoriasun|5 years ago|reply
[+] [-] stjo|5 years ago|reply
[+] [-] walrus01|5 years ago|reply
[+] [-] e_y_|5 years ago|reply
[+] [-] BorisTheBrave|5 years ago|reply
One should give credit where it is due.
[+] [-] eat_veggies|5 years ago|reply
> Algorithm - Road Network
> This generator is based on the paper ‘Interactive Procedural Street Modeling‘.
[1] https://maps.probabletrain.com/#/algorithmoverview
[+] [-] DonHopkins|5 years ago|reply
https://www.youtube.com/watch?v=XkSXERxucPc
>Robust-first Computing: Distributed City Generation: A rough video demo of Trent R. Small's procedural city generation dynamics in the Movable Feast Machine simulator.
Nere's a paper about how it works:
https://www.cs.unm.edu/~ackley/papers/paper_tsmall1_11_24.pd...
>Local Routing in a new Indefinitely Scalable Architecture, by Trent Small.
>Abstract: Local routing is a problem which most of us face on a daily basis as we move around the cities we live in. This study proposes several routing methods based on road signs in a procedurally generated city which does not assume knowledge of global city structure and shows its overall efficiency in a variety of dense city environments. We show that techniques such as Intersection-Canalization allow for this method to be feasible for routing information arbitrarily on an architecture with limited resources.
More info and links about David Ackley's work on Robust First Computing and the Moveable Feast Machine:
https://news.ycombinator.com/item?id=21858577
>A "Moveable Feast Machine" is a "Robust First" asynchronous distributed fault tolerant cellular-automata-like computer architecture. It's similar to a Cellular Automata, but it different in several important ways, for the sake of "Robust First Computing". These differences give some insight into what CA really are, and what their limitations are.
>Cellular Automata are synchronous and deterministic, and can only modify the current cell: all cells are evaluated at once (so the evaluation order doesn't matter), so it's necessary to double buffer the "before" and "after" cells, and the rule can only change the value of the current (center) cell. Moveable Feast Machines are like asynchronous non-deterministic cellular automata with large windows that can modify adjacent cells.
[+] [-] 3g0st|5 years ago|reply
[+] [-] benbristow|5 years ago|reply
[+] [-] mark242|5 years ago|reply
[+] [-] brognob|5 years ago|reply
[+] [-] reaperducer|5 years ago|reply
Galveston, Texas.
Seattle, until recently. Though that wasn't sand, it was piers.
[+] [-] crazygringo|5 years ago|reply
https://www.google.com/maps/place/Rockaway+Peninsula/@40.582...
[+] [-] _ah|5 years ago|reply
[+] [-] Aperocky|5 years ago|reply
[+] [-] iworkfromhome|5 years ago|reply
[+] [-] jordache|5 years ago|reply