…While it is true that every curve which can be described by a continuous motion should ve recognized in geometry, this does not mean that we should use at random the first one that we meet in the construction of a given problem. We should always choose with care the simplest curve that can be used in the solution of a problem, but it should be noted that the simplest means not merely the one most easily described, nor the…
This is the continuation of my scripting experiment within Grasshopper. Like the minimum spanning tree algorithm, this is also a famous problem of computational geometry; the shortest path problem. I’m now coding faster and understanding the namespace more easily in Grasshopper. This time, the challenge was implementing Dijkstra’s algorithm for the Shortest Path Generator. Again, it’s a quite powerful algorithm, I even plan to use it in my current project. Although there is a faster alternative, Shortest Walk-in Food4Rhino and it…
This is the updated version of my MST code from 2012. After over a hundred hours of Rhinocommon and Grasshopper SDK studies, and lots of dead ends, I was finally able to calculate the minimum spanning tree of any given curve network in Grasshopper. Problems like these are interesting to me because of their clear logic and diverse areas of applications in design. I tried to simulate Dijkstra’s, Kruskal’s, and Prim’s algorithms, but no chance. There are similar solutions such…
Searching for a meaning to today’s popular design methods and concepts we are all going after. Most of the abstract problems, today described within architectural domains, are very parallel to another field defined by M. Ian Shamos in 1978. Here is the introduction paragraph of his PhD thesis; Geometry is a subject that has captured the imagination of Man for at least 2500 years. It is at the very foundation of Art, Architecture, and Mathematics, and plays a central role…