hannah willoughby pearson algorithmic sketchbook

80
A S L K G E O T R C I H T B H O M O I K C HANNAH WILLOUGHBY PEARSON 359502

Upload: hannah-willoughby-pearson

Post on 08-Apr-2016

231 views

Category:

Documents


2 download

DESCRIPTION

 

TRANSCRIPT

Page 1: Hannah willoughby pearson algorithmic sketchbook

A SL KG EO TR CI HT BH OM OI KC

HANNAH WILLOUGHBY PEARSON359502

Page 2: Hannah willoughby pearson algorithmic sketchbook
Page 3: Hannah willoughby pearson algorithmic sketchbook

CONTENTS

1

3

6

9

12

15

18

21

24

27

30

33

WEEK 1

WEEK 2

WEEK 3

WEEK 4

WEEK 5

WEEK 6

WEEK 7

WEEK 8

WEEK 9

WEEK 10

WEEK 11

WEEK 12

Page 4: Hannah willoughby pearson algorithmic sketchbook

VERONI3D CELLS

PROXIMITY 3D OF A SURFACE

Increasing number of points and seed count allows for more complex surfaces - becoming

more like a mineral

Decreased point count and enlarging individual veroni cells to inter-

sect each other

Extreme variations in response to slider inputs. Increasing maximum radius results in more lin-ear arrangement, whilst decreasing gives a more webbed output as point must only reach to nearest

neighbour

Veroni3D cells uses randomly generated points populated in selected geometry [in this case, a cube]. By changing in-put values for number of points, the total amount of cells filling the object can be altered. Veroni and OcTree are

both very quick form generators. Alone they are quite eco-nomic, and can be modified and made more complex with the

additon of other shapes and tools

Page 5: Hannah willoughby pearson algorithmic sketchbook

METABALL RADIAL GRID

LOFT 3 CURVES

Decreased polar grid cells and various inputs for isocurve

threshold

Incresing polar grid cells to produce a more radial geometry.Isocurve threshold accuracy and sampling accuracy at opposing maximum and minimum values

5 polar grid cells repeated

in radial direction

Linear loft arrangements playing with loose and de-velopable types as well as

rebuild count.

Exploding mesh to create fragmented

facade.

Grasshopper allows for the lofting of multiple curves. It has a more flexible out-put when compared to lofting in Rhino, as control points of the lofted curves can be edited without breaking history and hence the lofted geometry will develop with the

editing of the curves. As more curves are added to the lofted geometry, the resulting surface becomes increasingly complex. However, at the same time it also becomes more difficult to control and the risk of forming unpredictable and failed

geometry increases.

Page 6: Hannah willoughby pearson algorithmic sketchbook

Control points moved in x,y,z coordinates. Creation of vertical walls that act as shelter

Pushing curves and control points to limits before geometry fails. The

ability to create more extreme varia-tions is possible, however the el-

egance of geometry can be compromised with the risk of having less control over the control curves as well as each control point having less and less affect upon the surface as a

whole

Exploring varia-tion in form through control points of 2 lofted curves. Excit-ing variations in form were not achievable in comparisson to 3 and 4

curve lofts.

Page 7: Hannah willoughby pearson algorithmic sketchbook

[2]

It is interesting to note that using box morph, each ‘morphed box’ has its own distinct shape, which would not be possible [or it would be in-herently difficult] to create using traditional CAD modelling. But with this increasingly com-plex geometry I also noted that it takes a lon-

ger time for the computer to process informa-tion, and using tools like the kaleidoscope on

complex geometry generates a lot of lag

Box Morph on Lofted Curves

Page 8: Hannah willoughby pearson algorithmic sketchbook

[2]Project Geometry and Boxmorph

Page 9: Hannah willoughby pearson algorithmic sketchbook

Boxmorph with extruded planar facesThis adds moredimension to the box morph definition instead of just giv-ing a relatively 2 dimensional sur-face

Modified orientation of boxmorph geometryIn this iteration you can really see how effective boxmorph is in creating individ-ual geometries in a mass quantity. Model-ling each of these individual scales to its unique shape would take a very long time using traditional CAD software

[2]

Page 10: Hannah willoughby pearson algorithmic sketchbook
Page 11: Hannah willoughby pearson algorithmic sketchbook

[2]

Boxmorph of cylinders with proximity orientation to point

Page 12: Hannah willoughby pearson algorithmic sketchbook

[3]Bookcase

Page 13: Hannah willoughby pearson algorithmic sketchbook

[3]Bookcase

Page 14: Hannah willoughby pearson algorithmic sketchbook

[3] Bookcase

Page 15: Hannah willoughby pearson algorithmic sketchbook

[3]

Page 16: Hannah willoughby pearson algorithmic sketchbook

[4]

increase scale factor and segments mirror

original Multiply scale factor 4

Set initial truncateed tetra brep

Set initial truncateed tetra brep

Mirror and orient mod-ules. Failed with 5 faces. Cannot infinite-ly grow

Brep truncate, rebrep Simplified brep trun-cate rebrep

Individual segment re-brep

Fractal geometry

Page 17: Hannah willoughby pearson algorithmic sketchbook

[4]

In this series of iterations I played with the number of divisions of a circle to create branches as well as increasing the radius of the piping and the extrusion in z direction

This is a failed attempt to make a grid of trees, however I ended up creating an interest-ing form which could be made out of wicker to form a forest shelter

Increasing the piping and number of branches created interesting woven textures

Top view of shelter shows that a few trees were suc-cessfully created, but also shows the complex pattern of connections between grid points

Tree

Page 18: Hannah willoughby pearson algorithmic sketchbook

[4]

10.2 Plan export

10.2 Grasshopper defi nition

This defi nition creates a group of rooms which are re-lated to each other

10.3 Grasshopper defi nition

10.3 Plan export

Independent and dependent rooms

Page 19: Hannah willoughby pearson algorithmic sketchbook

[4]Colour Field Mesh

This shows the colorisation of the fi led force of a point charge on a tri grid mesh at any given point. The force is physically active on the mesh and distorts parts of its surface relative to its distance

Page 20: Hannah willoughby pearson algorithmic sketchbook
Page 21: Hannah willoughby pearson algorithmic sketchbook

Failed field force colourisation of mesh brep. But this created some interesting layering of linear and curved webs. I like the contrast-ing elements between the more built up and heavier layered sections against the fine longer lines and empty voids. I wonder if this would be modified to create a structure held together in tension and perhaps stretch out canvas or another material to create a room/shelter

Page 22: Hannah willoughby pearson algorithmic sketchbook

[4][5]

In these iterations I tried using different graph mapping components such as sin

Page 23: Hannah willoughby pearson algorithmic sketchbook

[4][5]

Field geometry

This was the first successful loft of the resulting curves. It was too complex to loft the whole thing, which was a shame, so I selected a small alcove

Page 24: Hannah willoughby pearson algorithmic sketchbook

[5]Graph Controllers

A triangle was used as the shape to be influenced by the graph controller in the iteration. Changing the number of curve divisions as well as the type of graph used vastly influenced the caused dramatic changes in the patterning produced

Polygon used instead of triangle. Interpolated a curve between the end points of the polygons to make a sort of spiral which was divided into points, culled to remove any linear points, and then voronoi was applied

Page 25: Hannah willoughby pearson algorithmic sketchbook

[5]

In this iteration, a 9 sided polygon was plugged to the sin graph mapper, and divided into points whicha quad tree was then run through. Th ese points were then further divided and used as the input to voronoi

Page 26: Hannah willoughby pearson algorithmic sketchbook

Image Sampler

[5]

This page: Image sampler was used to map a set of cones which were then scaled, offset and

lofted on a planar surface. The resulot of this was best shown using top view which shows the

spiralling pattern used.

Top next page: I thought this could be applied in more interesting ways to a curved surface,

however in some sections this failed because of overlapping between cones in areas of steep in-

clines on the surface geometry.

Bottom next page: I applied the same idea of us-ing the image sampler on a curved surface except here I chose a less eratic surface and used the image sampler the control the heights of boxes

that I had set on the surface. This worked quite well because the points between each box re-mained relatively constant. The result was a

kind of city scape

Page 27: Hannah willoughby pearson algorithmic sketchbook

[5]

Page 28: Hannah willoughby pearson algorithmic sketchbook
Page 29: Hannah willoughby pearson algorithmic sketchbook
Page 30: Hannah willoughby pearson algorithmic sketchbook

[NTW]Tree statistics

I found data trees were helpful in that they really started to ‘unpack’ what was held in the wires. I didnt really know what was happening when I connected one container to another, but the data trees are helpful in explianing what you have done, how it is broken up and arranged, as well as can also explain why some things were going red.

Th ey are complex though because I found you kind of have to know beforehand, what you data you have and where its going

Page 31: Hannah willoughby pearson algorithmic sketchbook

[NTW]Relative Item

Path Mapper

Changing the branch offset even only by a small amount resulted in significantly different geometry and patterning of the sphere

Path mapper is useful in that itcan simplify your data tree so thatyou can eliminate any information that may be assumed or applicable to many branches,such as ‘0’ points.

Page 32: Hannah willoughby pearson algorithmic sketchbook

[NTW]Single Union and fabrication joints

Single union script using smooth mesh brep

I made a simple geometry using bollean union, and then conveted it to a mesh and smoothed its edges. Th ere was a problem creating the single union sur-faces, as for some reason, some of the edges didnt join, so the tube section was not able to create planar surfaces.

Th is could be useful for fabrication because these surfaces can easily be laid fl a and laser cut and either glued together to make a solid object, or con-nected using joints such as those on the opposite page

Page 33: Hannah willoughby pearson algorithmic sketchbook

[NTW]Single Union and fabrication joints

Fabrication jointscript

Fabrication joint for surfaces obtained from single union

Page 34: Hannah willoughby pearson algorithmic sketchbook

[6]Walking Salesman

Repeating the walking salesman cluster using python script

Page 35: Hannah willoughby pearson algorithmic sketchbook

[6]

Page 36: Hannah willoughby pearson algorithmic sketchbook

[6]Gradient

2 cluster gradient - shorter lines Increase surface point gradient - more lines

Different surface

Page 37: Hannah willoughby pearson algorithmic sketchbook

[6]

Increase surface point gradient - more lines 20 cluster gradient - longer lines

Extruded cureves

Page 38: Hannah willoughby pearson algorithmic sketchbook

failed unroll brep

fractal geometry

Page 39: Hannah willoughby pearson algorithmic sketchbook
Page 40: Hannah willoughby pearson algorithmic sketchbook
Page 41: Hannah willoughby pearson algorithmic sketchbook
Page 42: Hannah willoughby pearson algorithmic sketchbook
Page 43: Hannah willoughby pearson algorithmic sketchbook
Page 44: Hannah willoughby pearson algorithmic sketchbook
Page 45: Hannah willoughby pearson algorithmic sketchbook
Page 46: Hannah willoughby pearson algorithmic sketchbook
Page 47: Hannah willoughby pearson algorithmic sketchbook
Page 48: Hannah willoughby pearson algorithmic sketchbook
Page 49: Hannah willoughby pearson algorithmic sketchbook
Page 50: Hannah willoughby pearson algorithmic sketchbook
Page 51: Hannah willoughby pearson algorithmic sketchbook
Page 52: Hannah willoughby pearson algorithmic sketchbook
Page 53: Hannah willoughby pearson algorithmic sketchbook
Page 54: Hannah willoughby pearson algorithmic sketchbook
Page 55: Hannah willoughby pearson algorithmic sketchbook
Page 56: Hannah willoughby pearson algorithmic sketchbook
Page 57: Hannah willoughby pearson algorithmic sketchbook
Page 58: Hannah willoughby pearson algorithmic sketchbook
Page 59: Hannah willoughby pearson algorithmic sketchbook
Page 60: Hannah willoughby pearson algorithmic sketchbook
Page 61: Hannah willoughby pearson algorithmic sketchbook
Page 62: Hannah willoughby pearson algorithmic sketchbook
Page 63: Hannah willoughby pearson algorithmic sketchbook
Page 64: Hannah willoughby pearson algorithmic sketchbook
Page 65: Hannah willoughby pearson algorithmic sketchbook
Page 66: Hannah willoughby pearson algorithmic sketchbook
Page 67: Hannah willoughby pearson algorithmic sketchbook
Page 68: Hannah willoughby pearson algorithmic sketchbook
Page 69: Hannah willoughby pearson algorithmic sketchbook
Page 70: Hannah willoughby pearson algorithmic sketchbook
Page 71: Hannah willoughby pearson algorithmic sketchbook
Page 72: Hannah willoughby pearson algorithmic sketchbook
Page 73: Hannah willoughby pearson algorithmic sketchbook
Page 74: Hannah willoughby pearson algorithmic sketchbook
Page 75: Hannah willoughby pearson algorithmic sketchbook
Page 76: Hannah willoughby pearson algorithmic sketchbook
Page 77: Hannah willoughby pearson algorithmic sketchbook
Page 78: Hannah willoughby pearson algorithmic sketchbook
Page 79: Hannah willoughby pearson algorithmic sketchbook
Page 80: Hannah willoughby pearson algorithmic sketchbook