jacobusmmsmit / DiscreteVoronoi.jl

Julia implementation of various algorithms for calculating discrete Voronoi diagrams.
MIT License
5 stars 1 forks source link

Exercises with partitioning to fix more of #25 #28

Closed goerch closed 2 years ago

goerch commented 2 years ago

Looks good, what are the timings like for the two methods? I would expect an improvement through partitioning as it has simpler indices but perhaps not.

You mean filtering vs partitioning? Partitioning is faster, I believe between 10% and 30%. Drawback being that we need a more complex equality comparison or we switch to storing coordinates in the grid (here I finally understood your rationale for doing that in the main branch).