Closed gorela closed 5 years ago
@gorela What kind of landscape did you imagine?
We have 20bytes of information (from the Receivers hex-address) available to generate a unique representation. We should divide the resulting 20byte bitarray in slices, so that each slice represents a parameter of the landscape. The slices can get hashed, if the parameter requires less information than the size of the slice. (E.g. a color
in processing can be a 32 bit integer maximum)
What do you think about this: https://www.openprocessing.org/sketch/524376
I really like this visually - it's dynamic, and it looks like a topology. We could check if we can use this (legal perspective). We would have to modify it, so that it is totally deterministic based on a seed (the receivers address) and that the visual difference between different addresses is stronger.
For the deterministic behaviour, it doesn't seem sufficient to fix the seed for the perlin-noise (noiseSeed()
) and the RNG (randomSeed()
). The particles should have deterministic spawning positions.
We could also work with more colors (deterministic from address), and let the particles be pseudo-random.
@gorela Since I saw the video I assume this issue can be closed, can't it?
The 3 major areas on the screen are:
The 3 areas should be aligned with the rails and the circles may as well be racetracks.