Timeline for Find all circles that cover one point
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2015 at 7:24 | comment | added | piotrpo | Yes r-tree seeking is O(log2(n)) looping is O(n), so simply it's better to reverse order - first find potential results with r-tree then filter them up with geometry/geodetic calculations. | |
| Jun 14, 2015 at 21:39 | comment | added | Dovizu | I see. So if instead I were to execute a query that look for all circles which cover a particular point, it will be a lot more inefficient because you can't use an MBB to narrow down the search, is that correct? | |
| Jun 14, 2015 at 7:23 | history | answered | piotrpo | CC BY-SA 3.0 |