grey/BOSL2
1
0
Fork 0
mirror of https://github.com/BelfrySCAD/BOSL2.git synced 2024-12-29 16:29:40 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

commented example

Browse source
This commit is contained in:
Adrian Mariano 2021-05-14 16:34:35 -04:00
parent 9501b9da95
commit 465cc40c0a
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
vectors.scad
View file

@ -369,9 +369,9 @@ function vp_nearest(points, tree, p, k) =
// to check all the queries. If you use queries=points and set r to epsilon then // to check all the queries. If you use queries=points and set r to epsilon then
// you can find all of the approximate duplicates in a large list of vectors. // you can find all of the approximate duplicates in a large list of vectors.
// Example: Finding duplicates in a list of vectors. With exact equality the order of the output is consistent, but with small variations [2,4] could occur in one position and [4,2] in the other one. // Example: Finding duplicates in a list of vectors. With exact equality the order of the output is consistent, but with small variations [2,4] could occur in one position and [4,2] in the other one.
v = array_group(rands(0,10,5*3,seed=9),3); // v = array_group(rands(0,10,5*3,seed=9),3);
points = [v[0],v[1],v[2],v[3],v[2],v[3],v[3],v[4]]; // points = [v[0],v[1],v[2],v[3],v[2],v[3],v[3],v[4]];
echo(search_radius(points,points,1e-9)); // Prints [[0],[1],[2,4],[3,5,6],[2,4],[3,5,6],[3,5,6],[7]] // echo(search_radius(points,points,1e-9)); // Prints [[0],[1],[2,4],[3,5,6],[2,4],[3,5,6],[3,5,6],[7]]
// //
function search_radius(points, queries, r, leafsize=25) = function search_radius(points, queries, r, leafsize=25) =
assert(is_matrix(points),"Invalid points list") assert(is_matrix(points),"Invalid points list")