Open Hub
Black Duck Open Hub

Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Boost.Geometry

Compare

  No analysis available

The Boost.Geometry (aka Generic Geometry Library, GGL) provides a generic implementation of geometry algorithms, working with geometry types provided by the library itself as well as user-defined types. It also provides the implementation of R-tree spatial index. The library is implemented in C++ ... [More] programming language with extensive use of elements of metaprogramming like class (type) templates, static polymorphism and compile-time execution. Consequently, Boost.Geometry is built upon foundation of C++ Standard Library and Boost C++ Libraries. Source: https://github.com/boostorg/geometry Documentation: http://www.boost.org/libs/geometry Reporting bugs: http://www.boost.org/development/bugs.html [Less]

0 lines of code

12 current contributors

0 since last commit

4 users on Open Hub

Activity Not Available
5.0
 
0 Reviews
I Use This
Mostly written in language not available
Licenses: Boost_Sof...
Tags algorithms boost boost_geometry boost_polygon c++ cad concepts generic geometry geospatial ggl gis 8 more...

libspatialindex

Compare

  Analyzed about 1 month ago

C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API

62.2K lines of code

10 current contributors

about 1 month since last commit

2 users on Open Hub

Activity Not Available
0.0
 
0 Reviews
I Use This
Mostly written in C++
Licenses: mit
Tags algorithms c++ geometry gis rtree

ELKI

Compare

  Analyzed 2 days ago

ELKI: "Environment for Developing KDD-Applications Supported by Index-Structures" is a development framework for data mining algorithms written in Java. It includes a large variety of popular data mining algorithms, distance functions and index structures. Its focus is particularly on clustering ... [More] and outlier detection methods, in contrast to many other data mining toolkits that focus on classification. Additionally, it includes support for index structures to improve algorithm performance such as R*-Tree and M-Tree. The modular architecture is meant to allow adding custom components such as distance functions or algorithms, while being able to reuse the other parts for evaluation. [Less]

214K lines of code

2 current contributors

about 2 months since last commit

1 users on Open Hub

Low Activity
5.0
 
0 Reviews
I Use This
Mostly written in Java
Licenses: AGPL3_or_...
Tags algorithms analysis api clustering data data_analysis data_mining datamining dataminingframework java kdd knowledge_discovery 8 more...

PH-Tree

Compare

  Analyzed 6 days ago

The PH-Tree is a multi-dimensional spatial index structure. It is a 'trie' version of a quadtree. Properties: no rebalancing, ever. Depth limited to 64 nodes. Fast updates, window queries and kNN queries. Scales very well with large datasets (10M+) and prefers clustered data over evenly distributed ... [More] data. PDFs with a description can be found in the source code. [Less]

47.4K lines of code

2 current contributors

11 months since last commit

0 users on Open Hub

Very Low Activity
0.0
 
0 Reviews
I Use This
Mostly written in Java
Licenses: apache_2
Tags index indexing indexstructure java kdtree knn multi-dimensional multidimensional nearestneighbor nearestneighborssearch quadtree rangequeries 4 more...