Hi there,
I was wondering how i might go about storing the neighbours of primitive cubes. i've packed the geometry so i have 1 ID per cube but i wanted to get some advice on how i might store each cube's neighbours, preferably in python?
calculating neighbours of primitive cubes
2254 4 0- 212AA
- Member
- 7 posts
- Joined: March 2016
- Offline
- mestela
- Member
- 1737 posts
- Joined: May 2006
- Online
- 212AA
- Member
- 7 posts
- Joined: March 2016
- Offline
- mestela
- Member
- 1737 posts
- Joined: May 2006
- Online
You can increase the radius of the search to get the diagonals, the docs should give you all you need to know:
http://www.sidefx.com/docs/houdini/vex/functions/nearpoints [www.sidefx.com]
If you've connected your packed prims with edges, then you want to use the neighbours function instead:
http://www.sidefx.com/docs/houdini/vex/functions/neighbours [www.sidefx.com]
http://www.sidefx.com/docs/houdini/vex/functions/nearpoints [www.sidefx.com]
If you've connected your packed prims with edges, then you want to use the neighbours function instead:
http://www.sidefx.com/docs/houdini/vex/functions/neighbours [www.sidefx.com]
Edited by mestela - Sept. 9, 2017 17:30:39
- 212AA
- Member
- 7 posts
- Joined: March 2016
- Offline
-
- Quick Links