mirror of
https://github.com/BelfrySCAD/BOSL2.git
synced 2025-01-01 09:49:45 +00:00
bug fix qr factorization, removed echo in plane intersection, fixed
bezier_surface so vnf arg is in right order
This commit is contained in:
parent
1d10c15d57
commit
ee82a8bb97
3 changed files with 4 additions and 5 deletions
|
@ -923,12 +923,12 @@ function patch_reverse(patch) = [for (row=patch) reverse(row)];
|
||||||
// ];
|
// ];
|
||||||
// vnf = bezier_surface(patches=[patch1, patch2], splinesteps=16);
|
// vnf = bezier_surface(patches=[patch1, patch2], splinesteps=16);
|
||||||
// polyhedron(points=vnf[0], faces=vnf[1]);
|
// polyhedron(points=vnf[0], faces=vnf[1]);
|
||||||
function bezier_surface(patches=[], splinesteps=16, i=0, vnf=[[],[]]) =
|
function bezier_surface(patches=[], splinesteps=16, vnf=[[],[]], i=0) =
|
||||||
let(
|
let(
|
||||||
vnf = (i >= len(patches))? vnf :
|
vnf = (i >= len(patches))? vnf :
|
||||||
bezier_patch(patches[i], splinesteps=splinesteps, vnf=vnf)
|
bezier_patch(patches[i], splinesteps=splinesteps, vnf=vnf)
|
||||||
) (i >= len(patches))? vnf :
|
) (i >= len(patches))? vnf :
|
||||||
bezier_surface(patches=patches, splinesteps=splinesteps, i=i+1, vnf=vnf);
|
bezier_surface(patches=patches, splinesteps=splinesteps, vnf=vnf, i=i+1);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
|
@ -606,8 +606,7 @@ function plane_intersection(plane1,plane2,plane3) =
|
||||||
let(
|
let(
|
||||||
matrix = [for(p=[plane1,plane2]) select(p,0,2)],
|
matrix = [for(p=[plane1,plane2]) select(p,0,2)],
|
||||||
rhs = [for(p=[plane1,plane2]) p[3]],
|
rhs = [for(p=[plane1,plane2]) p[3]],
|
||||||
point = linear_solve(matrix,rhs),
|
point = linear_solve(matrix,rhs)
|
||||||
dd=echo(point=point, normal=normal)
|
|
||||||
)
|
)
|
||||||
[point, point+normal];
|
[point, point+normal];
|
||||||
|
|
||||||
|
|
|
@ -579,7 +579,7 @@ function qr_factor(A) =
|
||||||
)
|
)
|
||||||
assert(len(dim)==2)
|
assert(len(dim)==2)
|
||||||
let(
|
let(
|
||||||
qr =_qr_factor(A, column=0, m = m, n=m, Q=ident(m)),
|
qr =_qr_factor(A, column=0, m = m, n=n, Q=ident(m)),
|
||||||
Rzero = [
|
Rzero = [
|
||||||
for(i=[0:m-1]) [
|
for(i=[0:m-1]) [
|
||||||
for(j=[0:n-1])
|
for(j=[0:n-1])
|
||||||
|
|
Loading…
Reference in a new issue