bench_r_tree.cc File Reference

Informative benchmark for RTree/RStarTree spatial indexes. More...

#include <algorithm>
#include <charconv>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <random>
#include <string_view>
#include <vector>
#include <geom_algorithms.H>
#include <tpl_r_star_tree.H>
#include <tpl_r_tree.H>

Include dependency graph for bench_r_tree.cc:

Go to the source code of this file.

Functions
int	main (int argc, char *argv[])

Detailed Description

Informative benchmark for RTree/RStarTree spatial indexes.

Compares dynamic RTree/RStarTree insertion and intersection-query throughput against a brute-force rectangle scan and Aleph's static AABBTree.

Usage: bench_r_tree [entry_count] [query_count]

Definition in file bench_r_tree.cc.

Function Documentation

main()

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 179 of file bench_r_tree.cc.

References Aleph::and, Aleph::blossom_maximum_cardinality_matching(), row, Aleph::AABBTree::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size().