[
https://issues.apache.org/jira/browse/GEOMETRY-142?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17450168#comment-17450168
]
Bruno P. Kinoshita commented on GEOMETRY-142:
---------------------------------------------
Had a read this morning in the code and in the octree wikipedia page to remind
me how it works (I remembered seeing it in gaming & GIS projects before, but
never used it).
>From what I understood, you created an octree that uses the existing Vector3D
>and Precision classes, to add Vector3DNodes into the octtree, and when
>searching simply compare the value desired with the value stored in the octree
>allowing the Precision threshold.
Sounds like a good initial implementation, but interested to see the k-d tree -
this one never had to use, and can't recall reading about either, so looking
forward to learning something new soon :)
Great job so far Matt!
-Bruno
> Point Set/Map
> -------------
>
> Key: GEOMETRY-142
> URL: https://issues.apache.org/jira/browse/GEOMETRY-142
> Project: Apache Commons Geometry
> Issue Type: New Feature
> Reporter: Matt Juntunen
> Priority: Major
>
> It would be very useful to have set and map implementations that accepts
> points and vectors as keys and use "fuzzy" look up logic, where values are
> compared using a precision context. This would have uses in a number of
> situations, including the implementation of GEOMETRY-110.
> Options for the implementation of such classes include
> * BSP trees (as already implemented)
> * k-d trees
> * quadtrees/octrees
> * r-trees
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
