This is based on my failure of creating an optimum solution to 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 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 a simple idea that I can obtain the tangent plane of any point on a […]
For the last 10 days I’ve been searching for a proper algorithm in representing surfaces using planar shapes. It is obvious that triangulation is an answer but there is an interesting research topic of planar remeshing using shapes other than quads, hexagons or any other regular polygons. Especially in computer graphics, such things refer to optimization of models to decrease the load of GPUs. In Grasshopper community, this has also been discussed and there is a great implementation at Trada pavilion by Ramboll Computational Design Team (link here). There are […]
This experiment is based on a traditional surface-component definition. However, the variation of component is associated with Gaussian curvature. We just control the subdivision and a multiplier value. Results are interesting in as an educational tool to explain NURBS surface curvature and it’s utilization for Design Geometry. Different surface shapes generate exciting results. Of course this could be much improved by recognizing positive and negative curvature values, (probably only accepting positive ones maybe). Grasshopper definition can be downloaded here [2011_12_22_gauss].