Updates

改善了一些尋找邊界成面會出現的bug,請重新下載.

Some optimization with [Cluster] Tracing Boundary, please redownload.

Download 抓我 ლ(◉◞౪◟◉ )ლ 

步行距離檢討器Ver.01 demo

步行距離檢討器 Ver.01

Updates....

這是同個東西改第三次了.......

我想只有一直畫新的東西你才會發現原來的cluster有問題,

後來改的這個[Cluster] Remove Duplicated Lines 移除重疊線也是問題一大堆...

所以這次完全換一個寫法,希望不要再有問題了...

請重新下載更新版本...

This is the third time I recompose the same cluster.......

I think you will always find new bug in the cluster whenever you face new situations,

the previous [Cluster] Remove Duplicated Lines version is a mess...

so this time I recompose the cluster with a new method, and I hope there will be no more bugs...

Please redownload the new version...

最新版的移除重疊線可以選擇的選項有三,

在有重疊關係的線之間只取最長的 Keep longest overlap

在有重疊關係的線之間只取最短的 Keep shortest overlap

只要有重疊關係的線全部都移除掉 Delete all overlaps

This new version has three options,

Keep longest overlap

Keep shortest overlap

Delete all overlaps

/

兩組線各自重疊的情況

Two groups of lines overlapping situation

在有重疊關係的線之間只取最長的 

Keep longest overlap

在有重疊關係的線之間只取最短的 

Keep shortest overlap

只要有重疊關係的線全部都移除掉 

Delete all overlaps

Definition /

Download 抓我 ლ(◉◞౪◟◉ )ლ

More testing...

建築技術規則之步行距離與重覆步行距離檢討 WIP

This def is solving one of the Taiwan's building technical regulations,
so I'm not going to translate into english,
but it's just mainly calculates the distance from each room to the fire exit.

/

這大概是第一次根據實務需求下去嘗試GH的操作,
建築技術規則之步行距離與重覆步行距離檢討,
基本上就是計算各房間從其與門距離之最遠角到最近梯間的距離.

01 / 
首先我們要輸入的東西很簡單,
就是房間(封閉曲線)跟動線

02 /
在這我們假設兩條動線的頭尾各有一個地方可供置入梯間

03 /
在4個梯間中我們可以選擇實際要置入的梯間的位置

04 /
接下來我們要設定門的位置,
在這我直接讓電腦去算各房間節點中最靠近動線的點當門.

但假如你的門位置需特別設定,
那只需確保門的位置(點)需定義在各房間的邊線上
(但我想其實直接畫點再輸入也可以,只是有資料順序上的處理問題),

05 /
再來我們要求出離門最遠的點在哪,
所以首先要繪出內部網絡,
也就是各房間角落到其他角落的可能動線.

06 /
最終,透過運算後,我們即能求出所有角落到門的最短距離,
並把其中距離最長的篩選出來,即是離門最遠的點.

07 /
再來就可以透過向量圖,
我們可以看到各房間的起始點到梯間的動向.

08 /
所以所有的動線疊在一起就像這樣,
此時,我們就可開始檢視各房間到梯間的距離

9 /
經過檢驗後,在預設的最長可接受步行距離(在此設60m)下,
不合格的房間將不會填有顏色,
也因此我們可以知道若梯間選擇設在0跟3時是不合格的,
相對的設在1跟3則是可以的

當然你也可以根據顯示的距離數據去對房型做微調,
或是直接做新的動線規劃(我好像在講廢話)


/


再來還沒做但需要檢視的是"重覆步行距離",
完成後便可構成一較完整的步行距離與重覆步行距離檢討器.


以上.

[Cluster] Yayoi Kusama Dots 草間彌生的點點

要做的事情非常簡單,

就是把某個區域填滿草間彌生的點點風格,

先需要輸入要處理的區域跟一條劃開區域的線,

剩下的參數請參考影片.

The goal is really simple,

it's all about filling a area with Yayoi Kusama's dots style.

An area(closed curve) and a curve that split the area into half should input first,

and the rest parameters function please watch the video below.


Definition /

Download 抓我 ლ(◉◞౪◟◉ )ლ

Fur Image 圖片長毛

今天不知道在幹麻,亂拉了一下.....
請把圖片控制在300 x 300.

Just fooling around....
The image size should be 300 x 300.


Definition /

Updates

Debug the problem of the connection between start and end point,

please re-download the new version. :)

Download 抓我 ლ(◉◞౪◟◉ )ლ

[Cluster] Morphing 漸變

漸變這個工具需要的元素主要有兩個,
一個是漸變的路徑,一個是要漸變的形(一定要是平面封閉曲線),
所以基本上你只要輸入這兩項東西,
其他只剩下參數的調整.

Morphing this gadget has two main requirements,
one is the morphing rail, the other are the sections(must be closed planar curves) to morph,
so basically when you import this two requirements,
all that's left is some parameter adjustments.


Definition /

Download 抓我 ლ(◉◞౪◟◉ )ლ

Morphing WIP 漸變

Divide Rectangle P2

方形分形的另一個版本...

Another version of devide rectangle...

[Cluster] Divide Rectangle I&A 方形碎形

這是之前發佈過的Divide Rectangles的延伸,
現在它有兩種進形方形碎形的方式,
"I"代表的是根據迴圈次數,"A"代表的是根據最小面積,
所以你能根據自己的需求來選擇運算的方式,
同時也新增了一些可調參數.

This is an extension of the previous post Divide Rectangles,
now it has two different ways to divide the rectangle,
"I" stands for iteration, and "A" stands for area,
so you can decide which method you prefer,
and some new parameters were added.



Definition (Divide rectangle I) /

Download 抓我 ლ(◉◞౪◟◉ )ლ


Definition (Divide rectangle A) /

Download 抓我 ლ(◉◞౪◟◉ )ლ

[Cluster] Thicken Curves 粗線

這是一個讓平面線段變粗的一個小工具,
透過它線會轉換成面,也可以做更多的編輯.
輸入的線段如果有自身交集的情況,
請先用[ 線段交集分割 ]處理過.

This is a gadget that thicken the planar curves,
it turns curves into surfaces, and we can have more edit options.
If the input curves have self intersections,
please use the [ Split at intersections ] process them first.

線段的厚度可以是隨機不統一的,
當然同一線段如果給予多種厚度,
透過一些程序我們可以得到類似繽紛刷色的效果.

The thickness of curves can be randomly unequal,
an if we assign multiple thickness to the same curve,
through some process we can get a colorful brush style.

Definition /

Download 抓我 ლ(◉◞౪◟◉ )ლ

Packing Blocks 3D 三維方體填充

以方體填充進階版的方法將方體填入到三維的空間內,
範圍空間也不限制於方體中,可以有挖空等等.

Same method with packing blocks +, just input into a 3D space,
and the space boundary doesn't have to be a cube,
it can have vacant space too.

Packing Blocks 3D sneak peek

Packing Blocks + 方體填充進階版

跟上一代方體填充的差別是,
只要你的塊體是由某一最小單元組成,
它都可以將其填充到範圍內,
當然範圍也應是由同一最小單元組成.

Different from packing blocks,
as long as the blocks are constructed with a minimal module, 
it can pack it into the boundary,
of course the boundary should be constructed with minimal module too.

範圍不一定要是方體,
當然也能有中空的範圍.

The boundary doesn't have to be a rectangle,
and of course it can has hollow holes in the boundary too.

你可以選擇只要用輸入的方體填充,
亦或是方體的四向度旋轉也納入填充選擇內.

You can choose to only use the input blocks for packing,
or each block's four dimension rotation can be consider for packing as well.

Packing Blocks 方體填充

每次迴圈運算都會算出新的方體置放點,
同時會根據當下的邊界條件來篩選出可以放置的方體們,並從中隨機選一放置.

Every loop it calculates a new orient coordinate for placing a random block,
and filter out the blocks that are suitable inside the boundary, and pick one from it.

Unequal hexgonal grid 不規則六角網格

Aichi Spanish Pavilion / FOA 

透過類似mesh的概念,
其實也能很容易的操作nurbs,
單純以點來控制形的生成.

Use the same concept of mesh,
we can also control nurbs just by points.

Maze & Drifting Voxel

Maze /





Drifting Voxel /

:v)

Normal is not something to aspire to,
it is somrthing to get away from.                    

Jodie Foster

人們不應可望平凡,反之應該是逃離它.                                          

茱蒂·佛斯特

Constrain RGB 顏色簡化

Definition /

Cluster Updates 封包更新

有兩個之前出的封包做了更新,
一個是Slicer,一個是Chemical Bond(Nodes to linked curves),
除了一些除錯外,Slicer多了一個Remove Ends參數可調.

Definition (Slicer) / 

Download 抓我 ლ(◉◞౪◟◉ )ლ



Definition (Chemical Bond) / 

Download 抓我 ლ(◉◞౪◟◉ )ლ

[Cluster] Split at intersections 線段交集分割

這是將彼此有交疊的線段透過交集點進行分割,
所以本來各自獨立的線會轉換成網絡.

This is a gadget that use the intersections between curves to split them into segments,
so each individual curve will combine and transform into a network.

Definition /

Download 抓我 ლ(◉◞౪◟◉ )ლ