Skip to content
pubscout

Compare

The strongest value in each row is marked.

Attributekdtree

A fast Dart implementation of the k-dimensional (k-d) tree data structure.

pub.devRemove
r_tree

An R-tree implementation to index and query two-dimensional data in Dart.

pub.devRemove
ScoresHealth3666 (best)
Maintenance039 (best)
Quality7693 (best)
Popularity2343 (best)
Community1180 (best)
Compatibility100100
UsageDownloads (30 days)1.8k18k (best)
Likes1111
Pub points140 / 160145 / 160 (best)
GitHub stars1212
MaintenanceLatest release0.2.0, 6 years ago3.0.2, 9 months ago (best)
Major versions in 12 months00
Contributors228 (best)
PublisherUnverifiedworkiva.com
FitPlatformsAll (pure Dart)All (pure Dart)
WASM-readyYesYes
KindPure DartPure Dart
Code generationNoNo
Direct dependencies00
LicenseMITUNKNOWN
Setup effortLowLow
JudgementStrengths
  • Super fast Dart implementation of the k-d tree algorithm.
  • Supports nearest neighbor queries with optional maximal search distance.
  • Includes JSON serialization and balance factor approximation.
  • Dedicated recursive R-tree implementation for Dart.
  • Supports bulk loading and filtering search results.
  • Includes performance benchmarks and branch factor tuning.
Weaknesses
  • Unreliable balance factor for small trees.
  • No built-in alternative packages from the catalog to compare against.
  • License is unknown.
  • Limited to two-dimensional data structures.
WarningsNoneNone
kdtree vs r_tree: which Flutter package should you use? | pubscout