Hi, I have about 200K point and trying to find points within 100m and generate a list for each point by using NeighborFinder. But it is very slow as I expected. Does anyone know a trick to speed up the process? Thanks in advance!
Question
Is there a way to speed up Neighbor Finder?
This post is closed to further activity.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.
+10I once heard a trick someone used, i.e. use a sequential number of NeighborFinder transformers, starting with a small distance and adding up the numbers. E.g. 5m, 10m, 25m, 50m and 100m. This doesn't look like it is helping, but it really does.
Also try to input the candidates first and set 'Candidates first' to Yes.
+22- Contributor
- 2179 replies
Not sure if this would be faster, but worth the try:
Buffer all points, using the Bufferer and buffer size 100.
Then use the PointonAreaOverlayer to generate the list on the Area output port.
If needed recreate the point by using a CenterPointReplacer.
I once heard a trick someone used, i.e. use a sequential number of NeighborFinder transformers, starting with a small distance and adding up the numbers. E.g. 5m, 10m, 25m, 50m and 100m. This doesn't look like it is helping, but it really does.
Also try to input the candidates first and set 'Candidates first' to Yes.
I heard about this too, let me give it a try!!