[
https://issues.apache.org/jira/browse/GEOMETRY-142?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17496825#comment-17496825
]
Matt Juntunen commented on GEOMETRY-142:
----------------------------------------
Just finished implementing spherical 1D and 2D maps. The Euclidean and
spherical 1D maps are based on {{TreeMap}} while all of the multidimensional
maps extend {{{}AbstractBucketPointMap{}}}, which contains the majority of the
code. I still need to add some dimension-specific unit tests and maybe tweak
some things. For example, I think there needs to be some logic that will
rebuild the tree if it gets too out of balance. Adding points in sorted order
currently produces trees with unacceptable performance.
> 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
> Assignee: Matt Juntunen
> Priority: Major
> Fix For: 1.1
>
>
> 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)
