Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

handling a large number of polygons #103

Closed
geoHeil opened this issue Jun 11, 2017 · 2 comments

Comments

@geoHeil
Copy link

commented Jun 11, 2017

I have polygons which look like this https://gis.stackexchange.com/questions/242710/polygonize-raster-and-shrink-number-of-polygons and there are lots of them.

Usually a spatial join will lookup the bounding box and then for each matching /filtered pair validate the within constraint. As I have a large number of polygons and so far could not find this 2 step process in geospark's code I wonder if this could be integrated easily in order to increase performance as discussed in #91

So far I could only see that objects are

  • spatially partitioned
  • looked up from the R tree

I wonder if this pruning is already implemented (lookup only of the envelopes, then validate within constraint) or if it could easily be added.

@jiayuasu

This comment has been minimized.

Copy link
Member

commented Jun 13, 2017

@geoHeil
Hi Geoheil,
When using R-Tree, I do use MBR to filter useless polygon and then calculate the intersection relation using the real boundary.

The code is here: https://github.com/DataSystemsLab/GeoSpark/blob/master/core/src/main/java/org/datasyslab/geospark/joinJudgement/GeometryByPolygonJudgementUsingIndex.java#L75-L81

@viswanatharv

This comment has been minimized.

Copy link

commented Jun 17, 2019

@jiayuasu
The above link is not working. Can you please provide the correct link?

Thanks
Vish

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
3 participants
You can’t perform that action at this time.