Timeline for Finding polygons crossed by line using OGR?
Current License: CC BY-SA 2.5
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 22, 2010 at 14:35 | comment | added | Nicklas Avén | About spatial indexes you should google gist and multidimensional indexes. The idea is to build a multidimmensional index of the bounding boxes. In db-evironment the planner then decides if it is worth the effort to search the index first to find the intersecting bounding boxes before doing the real intersection test. | |
Dec 22, 2010 at 14:27 | comment | added | Marc | As for "I read your question again and realised that you are not using the linestring the trac forms but each vertex." I guess I could also test for intersection from the linestring object, but then I will need to extract the intersecting part. But that may be faster, you are absolutely right ! | |
Dec 22, 2010 at 14:20 | comment | added | Marc | Thanks for the answer. I'm not using a DB for the setup simplicity. But if avoiding DB implies too much code complexity, then I will change my mind :). As for the "spatial indexes", I will have to google a bit to understand exactly what it is. | |
Dec 22, 2010 at 13:15 | comment | added | Jay Cummins | I was thinking the same thing on the linestring. I'm not as familiar with GIS & python, but there should be a way to build spatial indexes in memory (I know various there are various .net options for doing this). This might be another good question for gis.se. | |
Dec 22, 2010 at 11:17 | history | edited | Nicklas Avén | CC BY-SA 2.5 |
added 923 characters in body
|
Dec 22, 2010 at 10:11 | history | answered | Nicklas Avén | CC BY-SA 2.5 |