Slope Analysis

Steepest Paths down a Topography with Aggregate Runoff Tracing the steepest slopes over a topography has a common mapping exercise within Landscape Urbanism practices (and one which has been used productively by our students at EPFL). It makes for a good scripting exercise because there is really no good way to do it on the … Continue reading

HEM functions

Offset, Distance, and Walk over Half-Edge Mesh Presented here are three functions for working with Half-Edge Meshes in Grasshopper. The first uses the lists of vertex’ incident edges (vIE) to calculate the bisecting angles at intersections in-between branches and create an offset of the graph which can be uniquely defined at every vertex (in black … Continue reading

Half-Edge Mesh

Each segment of this network has two half-edges Though the logic behind the data-structure of a half-edge mesh can be difficult or unintuitive to work with at first, once it becomes clear, it can become difficult to imagine working without recourse to functions that will tell you which face an edge is adjacent to, which … Continue reading

import OSM

OpenStreetMap data for Lausanne I was testing out the Elk plugin for Grasshopper some time ago (back when only the initial realease 0.0.1.0) was available and found the ability to import data from OpenStreetMap incredibly useful. Not only is this an opensource database, but it’s global coverage is pretty thorough saving the trouble of trying … Continue reading

Medial Axis

The medial axes and vanes of various shapes One of the first grasshopper definitions shared at Daniel Piker‘s SpaceSymmetryStructure blog was a file for calculating the medial axis (or topological skeleton) of a curve: the set of points with at least two closest points on a curve boundary. This definition was more accurately a voronoi … Continue reading

DLA

Diffusion Limited Aggregation Diffusion Limited Aggregation uses the mechanics of a random walk causing particles to stop moving when they come within a certain distance of an already anchored point. Connecting points to their anchors creates a branching organization with a density and connections that resemble many natural growing patterns. This version includes the possibility … Continue reading

Half-Edge Mesh

¬†key to the HEM class methods and face splitting modifier This is a class to be used with the Anar+ library for Processing to create a half-edge (or doubly-connected) mesh datastructure which uses the parametric geometry of Anar’s faces, and points. The schema for this HEM class is based on the description of doubly-connected edge … Continue reading

ACADIA 2014 Hackathon

Nathaniel Zuelzke and I were invited to participate as ‘design champions’ in the Hackathon element of this year’s ACADIA conference. The overarching theme of the conference was Design Agency, a concept that has been a focal point of research for both of us. Given the loose format and short length of the event, we worked … Continue reading