𝓗² Trees

Introduction

The H2Trees package provides a Julia implementation of tree data structures and algorithms for efficient computation in the context of 𝓗² methods.

H2Trees builds upon ideas from ClusterTrees and provides a range of tree data structures, including:

• TwoNTree: A 2ⁿ-tree data structure for organizing points in ℝⁿ.
• SimpleHybridTree: A tree data structure that splits a tree
• BoundingBallTree: A tree data structure using bounding balls.

The H2Trees package provides a range of features, including

• Aggregation and disaggregation: Plans for implementing aggregation and disaggregation algorithms for efficient computation.
• Computation of translations: Algorithms for computing translations between different tree levels.
• Plotting: An interface to PlotlyJS.jl for visualizing tree data structures.
• Interface to BEAST: An interface to the BEAST package for clustering of basis functions.

Documentation

• Documentation for the latest stable version.
• Documentation for the development version