Defective Use of Algorithms: TPI Disability
June 24, 2013This is based on my failure of creating an optimum solution for planar polygonal subdivisions. There is a method called Tangent Plane Intersection (TPI), explained briefly here (sometimes similar algorithms are called “planar remeshing” and “variational shape approximation”) which is effectively used in the Trada pavilion (here). I tried to implement a similar method using only native Grasshopper components and no recursion, but it quickly became much more complicated than I thought. It was based on the simple idea that…










