The kd-tree does not correctly find existing nodes. It ignores branches that 
may contain matches within the tree's threshold.

To demonstrate this, create a kd-tree with a threshold of 1.0. Then add the 
following points (0.0, 0.0), (0.1, 1.0), and (-0.1, 1.0). The third point 
should be matched to the second point. However, the code ignores the right 
child of the root node and does not find the match.

Jason Pepper


________________________________
TERRALIGN CONFIDENTIAL: This email and its attachments contain confidential and 
proprietary information of The TerrAlign Group, Inc.. Disclosure is strictly 
prohibited.

------------------------------------------------------------------------------
Don't Limit Your Business. Reach for the Cloud.
GigeNET's Cloud Solutions provide you with the tools and support that
you need to offload your IT needs and focus on growing your business.
Configured For All Businesses. Start Your Cloud Today.
https://www.gigenetcloud.com/
_______________________________________________
Jts-topo-suite-user mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user

Reply via email to