0

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?

Improve this question
10
  • have you tried looking at the source code of an implementation
    – Ian Turton ♦
    May 4, 2022 at 14:42
  • No, but I will try it. Do you think it would be helpful?
    – Masoumeh
    May 5, 2022 at 6:54
  • Welcome to Geographic Information Systems! This seems like an XY problem - could you describe what you are trying to do as well as what you have tried so far.
    – Ian Turton ♦
    May 5, 2022 at 7:33
  • You can either read technical papers describing R-Trees or actual code implementing them, which is more helpful depends on you and your end aim.
    – Ian Turton ♦
    May 5, 2022 at 7:33
  • Thank you! I know my question is basic one, sorry about that. I have read technical papers about R-Trees like this. Also, I am familiar with the structure.
    – Masoumeh
    May 5, 2022 at 8:09

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.