New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Faster brute-force search in support-vector computation of VPolygon #3277

Merged

schillic merged 1 commit into master from schillic/svec_vpolygon

Apr 14, 2023

Member

schillic commented Apr 7, 2023

julia> V = rand(VPolygon, num_vertices=1000); d = rand(2);

julia> @time LazySets._brute_force_support_vector_old(d, V.vertices)
  0.000077 seconds (847 allocations: 66.109 KiB)
433

julia> @time LazySets._brute_force_support_vector_new(d, V.vertices)
  0.000045 seconds (1 allocation: 16 bytes)
433


          faster brute-force search support vector VPolygon

schillic marked this pull request as ready for review

April 8, 2023 05:08

mforets approved these changes

View reviewed changes

schillic merged commit 15b7209 into master

schillic deleted the schillic/svec_vpolygon branch

April 14, 2023 15:27

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet