I am trying to understand about how R-tree works for polygon data. In other words, polygon is a list of vertices (points), however, I am wondering how spatial index can recognize the order of points in R-tree. For example, I have a table with thousands of polygons (MULTIPOLYGON (((385653.893 6671591.048, 385573...)))) which I would like to know the logic behind the spatial indexing for polygon that how to create a bounding box for these points as a polygon. Is there any ordering process?
I have searched a lot on the Internet but I could not find the answer of my question.
What is the structure of indexing for such geometries?