WEEK 2 ALGORITHMIC EXPLORATION DESIGN TASK Tommy Heng - 516673 Studio 8/9

A L G O R I T H M - 1

1. Describing a simple rectangle by manipulating the X and Y inputs about a specified plane.

2. Moving the base geometry in the Z direction x units as controlled by the number slider. The corners of the geometry is then extrapolated as points and joined to form a cube.

3. The surface is then extruded from th form and solid cube.

he base geomtry to

4. The geometry is then popularted with a random set of points and voronoid to produce a set of arbitrary points and surfaces.

5. The wireframe is extracted to illustrate the algorithms end result of converting/reinterprating the form produced into simple curves and points.

A L G O R I T H M - 2

1. Two curves are first described in Rhino 3d modelling space.

2. The curves are then divided into equal segments and conencted through an arc in the Z plane.

3. The arcs are lofted and given a set of co points which can be later manipulated and a

ontrol 4. The lofted surface is divided further by overlayaltered. ing a grid over it. The control points are extrapolated as one approach.

5. The intersection points of the overlayed grid are identified as to provide an alternative set of points to mathemtically reduce the surface into curves and points.

6. Another algorithm is used to cconvert the surface to its definited edge curves. Points are similarly defined.

A L G O R I T H M - 2

1. A series of points are sequentially described by interpolating a curve through them.

2. The resultant curve is divided into segments of equal lengths and then linked with archs drawn between them.

3. The arcs/curves are then lofte surface.

ed to produce a desired

4. The control points are established on the surface.

5. The overlayed grid is divided further and with the number of points generated controlled using a number slider.