
Geometry : 
Subject: Re: [geometry] geometry partition/spatial index
From: Andrii Sydorchuk (sydorchuk.andriy_at_[hidden])
Date: 20120414 17:47:59
>
> for linear creation algorithm with max=32, min=8 it takes 2.76s to create
> the index of 1M values, 1.03s to perform 100k box intersection queries and
> 0.26s to perform 10k nearest neighbor searches. For quadratic creation
> algorithm times are 4.24s, 0.35s and 0.12s respectively. I were using these
> tests to compare my implementation with the old one. If you plan to
> compare it to other implementations or on some reallife data please share
> results.
Well I wasn't planning to compare it with other implementation. The Voronoi
library is going now through the review process and implementation of the
spatial index on top of the Voronoi cells is one of the features I'd like
to add within the next few months. Thanks for the numbers! Besides what is
the memory consumption of the spatial index data structure?
Regards, Andrii
Geometry list run by mateusz at loskot.net