NON TEACHING WEEK ALGORITHMIC EXPLORATION DESIGN TASK Tommy Heng - 516673 Studio 8/9
MID-POINT FROM A CURVE ALGORITHM-1
- A very basic definition that fines the exact midpoint of any curve using the point on curve component.
ALGORITHM-2
- This definition divides a curve into 2 equal segments and thus produces the midpoint of the curve. A cull pattern component is required to extract the point.
ALGORITHM-3
- This is a definition that only works if the line is linear. The midpoint is produced by amplifying the move component of the original point by a magnitude of 0.5.
ALGORITHM-4
- This definition is similar to the second apart from the use of a more complex line to evaluate. The helix here is divided into equal segments and thus the resultant midpoint is extracted.
MID-POINT FROM A SURFACE ALGORITHM-1
- The definition essentially evaluates the area of the curve and thus the midpoint of the surface with the area compnent. This can be used across all kinds of surfaces.
ALGORITHM-2
- This definition evaluates the midpoint by drawing a line between the corners of a surface by using the box corner component. The line is then divided and the midpoint found. This definition will only work on surfaces basic geometries such as squares, triangles, rectangles, etc.