www.si-community.com

Awesome tut im checking everyday

Hey that's cool

I wasn't sure whether to merge the points first and then create the top polygon, or the other way round.

Went for the other way round because when the top bevel subdivisions is 1 (hm should be actually 0), I'll need all the points, like in the case in the screenshot.

Could find out by selecting the top edges and then adjacent points that the points are alwas numbered 0,10,20,40,... when the top bevel subdivisions is 9 for example. So I need an array like [0, topsubd+1, (topsubd+1)*2, (topsubd+1)*3]....

finally for the first part, building the indices for collapsing the top edge points (see viewport in screenshot)

Done 4 times with a repeat node. The repeat's CounterValue is subtracted from 3 so the highest indices are collapsed first (collapsing lower ones first would change the higher ones, then would come chaos!:)

Something had to be done about normals auto ones turn out horribly when bevel setting is low.
Found something on "face weighted normals" that should fix that. That method makes each point's normal the average normal of it's neighbor faces (as usual), but weighted by their area (not usual)
The weight can be squared for even more power

it's an easy method but the ICE graph turns out quite complex anyway which is because normals are defined for nodes (polygon corners) not for points.

So the polygon data has to be converted into a point context first (using select in array) and the result of the weighting (in point context) to node context (again using select in array). Then it can be set to NodeUserNormal or a user normal cluster. Luckily the array conversion takes no time because it just gives access to an array that already exists

Looks perfect!

The first paving stone of a paving stone street.