HOUDINI 神经生成的原理

HOUDINI 神经生成的原理

教程

https://www.bilibili.com/video/BV1h7411t7hU?from=search&seid=10485103029554077705

如有冒犯，敬请告知-侵删

外层a个点，内层体积化b个点

1取外层点

2外层点寻找附近的点，3并计算出方向，4将当前点加上步长x方向创建新的点，5并将新的点添加到外层中

取外层点1

Blast1->

Nearpoint:

i[]@nearparray;

f@radius = chf("radius")

int nearpt = nearpoint(0,'outside',@P,f@radius );  //查找outside组中0.1半径内的所有点的数量

int narray[] = array(@ptnum);   //对每个点建立一个数组

setpointattrib(0,'nearparray',nearpt,narray,'append'); //如果第一步中查找的点数量不为-1，将当前点加入数组中

attackline:

if (len(i[]@nearparray) > 0){  //如果组的数量大于0

//平均化附近点的方向，找出下一个点的位置

vector direct = {0,0,0};  

foreach (int p;i[]@nearparray){

    vector pattrib = point(0,'P',p);

    direct = direct + normalize(pattrib-@P);  //

}

f@length = chf("length");

vector nextpos = @P + normalize(direct)*@length; 0.01

int nextpoint = addpoint(0,nextpos); //下一点的位置

setpointgroup(0,'outside',nextpoint,1,'set'); //将新点加入下一次计算的组中

int prim  = addprim(0,'polyline'); //绘制连线

addvertex(0,prim,@ptnum);

addvertex(0,prim,nextpoint);

}

//出现不显示时，调整length和radius两值 调整搜索范围和长度

Removepoint: //删除点

int nps[] = nearpoints(0,'inside',@P,0.05);

foreach (int p;nps){

removepoint(0,p);

}