Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with intersection
Search options not deleted
user 34944
Use this tag when asking questions related to where features overlap.
2
votes
Accepted
RTree spatial index does not result in faster intersection computation
Edit: To clarify this answer, I incorrectly believed that all the intersection tests took approximately the same amount of time. This is not the case. … The time required by the intersection test can vary greatly (0.05 seconds versus 0.000007 seconds). …
- 494
9
votes
3
answers
6k
views
RTree spatial index does not result in faster intersection computation
With the shapefiles I have (approximately 4000 polygons, and 4 lines), the original code performs 12936 .intersection() checks and takes about 114 seconds to run. … The second piece of code that uses the spatial index performs only 1816 .intersection() checks but it also takes approximately 114 seconds to run. …
- 494
5
votes
1
answer
8k
views
How to efficiently determine which of thousands of polygons intersect with a linestring [duplicate]
I have a shapefile that contains several thousand Polygons/MultiPolygons and another shapefile that has a variable number of LineStrings. In the example below the blue Polygons are those that interse …
- 494