Face ID

Connecting moving points over a topographic model of Zermatt, Switzerland Following the previous post this code shows how to use the twin-edge function to more quickly identify a point position’s corresponding face from an HEM. In that code we simply checked through every face until finding one which intersected the cutting plane. In some ways … Continue reading

Mesh Section

Progressive sections through a topographic mesh of Zermatt, Switzerland This sketch adds to the Half-Edge Mesh sketch, a function sectionHEM() for cutting a planar section through a mesh. It also uses the Mesh Import function to instantiate the topography from a pair of .txt files (included in the .zip file below). The section function is … Continue reading

Mesh Import

Rhino to Processing This sketch expands on the earlier Half-Edge Mesh sketch, demonstrating how to generate a large HEM class from text files containing the vertex positions and the vertex indices for each face as comma separated lists. (To generate these .txt files from Rhino via Rhinoscript see this post.) The difference between this sketch … Continue reading

Mesh Export

Rhino to Processing In a previous post I covered the implementation of a Half-Edged Mesh as a class in Processing. In that definition, however, both the vertex coordinates and face indexing were hard-coded in the body of the script (Lines 8-9). This may be acceptable for a mesh with only 16 faces, but for most … Continue reading

Solar Incidence

Mesh incidence analysis Ted Ngai’s solar incidence definition has been the standard grasshopper definition for calculating solar position and sun angles since it was released over 2 years ago. Since that time, Grasshopper has released update after update and has switched from OpenNurbs to RhinoCommon for script components. Ngai’s definition is not significantly affected because … 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