“R-tree is useful to store spatial objects such as restaurant locations”. I see this sentence a lot of time in internet but I haven't found the good explanation on this.
Can anybody please elaborate the steps involved in indexing spatial objects?
I have been trying to get an intuitive answer to understand the working concept of R-Trees. Like how a minimum bounding box is determined? How the objects are inserted into that bounding box? I have read and understand that MBR are used to store data points and the trees are formed on the basis of the bounding box. But how can someone fit a map in a graph of a size of an A4 size and use the spatial objects(restaurants, cafes etc) as a data point and then enclose those points in a MBR of what size, and then index them in a tree?
I do not understand this concept; it’s really more complicated than I thought. Would be more convincing if a real world based scenario is used to explain.