Contents

Tool-box Window (short-cut 'b')

1. Bisect Larest Polygons: Each iteration searches for the largest polygon and splits it into two. This also requires a second adjacent polygon to be divided into two, so each each iteration results in two new polygons being produced.
2. Surface Simplification: Each iteration searches for the smallest polygons and merges them with the adjacent polygons.
3. Surface Relaxation: Each iteration causes all selected vertexes to move towards the average position of the adjacent vertexes on the same surface. A consequence is that surfaces edges become 'pulled in' and so generally edges should not be included in the selection.
4. Create Block From 2D Object: Gives a flat 2D surface a thickness. It is necessary that the polygons are pointing in the correct direction so that the result looks the same whether viewed using double-sided polygons (short-cut 'd') or single-sided polygons.