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
tecture. Hochbau | University of Innsbruck . A simple random, but at the same time organised growth routine. 5 iterations for this image.
Link to the course here:
http://www.exparch.at/index.php?option=com_content&task=view&id=1054&Itemid=87
View full size...as per Pieter's suggestion…