CA, DA, DC)Two of those diagonal lengths are obviously redundant but they allow you to simply shift the array to get at different rotational permutations. This makes the search for the nearest mean a bit more straightforward since, in the context of panel clustering, you'd need to consider all rotational permutations of each one.…
Added by David Reeves at 5:26am on November 9, 2014
gone with the wind topic: since this is utterly Academic the main issue here is to oversimplify LBS (in real life: a collection of columns/beams/slabs/X members + tube frame rigid members (shafts/elevators/cats/dogs)). Reason is that if we use the real "solids" (turned into meshes) as the "node" pool for the hinges required ... only HAL 9000 could solve it in "real-time" (for instance an E5 Xeon 1630 v3 takes ... several minutes). And this is ... er ... challenging I must say. This is a typical case where "simplifying" means "stupidity" almost instantly.
Spam on:
where's my collection of "bend-a-truss-that-looks-like-a-tower" K1 demo defs? Is in this workstation or in another? (blame Alzheimer).
Spam off.
More soon.…