Basically I want to place, non-overlapping randomly sized, square filled with nodes (a growing square spiral), which are added real-time so I can't predict how large a square will get, but the maximum square can hold 100 million (10,000 X 10,000) nodes. All nodes belonging inside this square have the same link to the original starting node. Right now I generate these random start coordinates where the square spiral begins to grow, to minimize overlaps with another growing bounding box arising from a totally new random seed coordinates that by some chance, happens to be close enough that the two boxes end up overlapping each other.
basically I'm afraid that if I generate 1,000,000 random start coordinates and grow a square spiral square for each coordinate with varying square area size, starting at each point in the clockwise direction, there will be overlapping square shaped spiral of nodes eventually. I do have some upper limits as to the maximum area of each square spiral, it should be able to store 100 million nodes. I am assuming there will be issues when more than one node occupies the same longitude and latitude. I've thought about using the or is this overkill, will the overlaps somehow be automatically be handled when querying for all nodes within?
asked
studentofosm Frederik Ramm ♦ |

How is this related to OSM? Looks like your question fits better on http://stackoverflow.com/ or http://gis.stackexchange.com/. Oh, it is already there: https://stackoverflow.com/questions/55697912/osm-how-to-place-1-million-randomly-sized-squares-filled-with-nodes-without-ov

I posted it there for visibility but they link it to this thread which effectively kills my question