TESIGN: [Cluster] Tracing Boundary 尋找邊界成面

2013/02/02

[Cluster] Tracing Boundary 尋找邊界成面

首先我們可以用Michael Hansmeyer的柱子當例子,

當他把3D切剖面的時候,其實裡面的線是交錯重疊的而無法送進雷射切割,
但他用了half edge演算法去找出最外邊的線而解決了此問題.
這也是我嘗試在Grasshopper裡做到的事情(當然比寫程式來的簡單許多...).

First, we can use the amazing columns made by Michael Hansmeyer as an example,
when he slice the column for sections,
it's actually ovelapped with many lines,
so it can't be send into the laser cutter or else it would be a mess.
However, he use the half edge algorithm to solve the problem,
and this is what I'm trying to achieve in Grasshopper(which is a lot easier without coding...).

基本上你可以隨便給任何直線或曲線,甚至兩者都有的情況,
尋找邊界會自動幫你算出最大可成面的邊界,
當然有時可構成的面並不相連,
所以你可以透過設定決定是否只顯示最大面積的面,
亦或是輸出所有可被構成的面.

Basically the cluster accepts lines or curves, even having both at the same time,
the cluster will automatically find the biggest surface by tracing the boundary,
but sometimes the surfaces aren't linked together,
so you can decide whether to generate the surface with biggest area
or output all the surfaces that can be formed.

一開始總共有5條或直或曲的線
Starts with 5 lines (polyline and curve)