Singapore
DESCRIPTION : Two seemingly contrasting ideas combined will turn into something remarkably new. This resulted in the idea of Digital Craftsmanship – connecting the digital technology with artisans’ craftsmanship. Singapore is uniquely positioned to benefit from both – the latest technology in digital fabrication, as well as the beautiful and rich culture of ASEAN craftsmanship in countries like Indonesia, Thailand and Vietnam. The NUS digital fabrication in architecture studio introduces advanced design to fabrication flow, such as 3D modeling, simulation, digital fabrication and physical assembly and testing. We discover existence of data flow distinguishes digital and conventional craftsmanship, prolonging the interface between human and object. The result is very encouraging –the Digital Craftsmanship approach could lead innovative yet regionally relevant contemporary architectural design, complex yet controlled functional geometry and aesthetics. We hope this exhibition could raise our awareness about preserving the precious wisdom of traditional craftsmanship alongside with advanced fabrication technologies in architecture.
OPENING : 24 August 2012, 7pm – 9pm, RSVP to Yi Hui (dfabstudio@gmail.com) EXHIBITION : 25 – 28 August 2012 (10 am – 9 pm, daily, free admission) VENUE : Promenade, Level 8, National Library Building, 100 Victoria Street, Singapore
PROJECT TEAM : Shinya Okuda (Studio Tutor), Liane Ee Rulian, Hiral Ashvin Desai, Lee Teng Teng Cheryl, Ian Wong Hengjie, Teo Lin Lin, Xu Xiaoqi, Liu Zhichao, Diptarshi Dev, Tan Zi Hua, Teh Yi Hui, Joshua Loh.
Organized by Digital Fabrication in Architecture Studio, NUS.…
u can display:
1. All angles
2. Angles that are smaller than a number(chose number from the CONTROLS group)
3. Only the angles around a specific node (chose node from the CONTROLS group)
Can you please explain a little better what you are trying to do?
Do you want to create pipes around all the mesh edges?
If so, what is the rule for the pipe's radius?
If it starts or ends on a node that has at least one angle<50 then its radius is 100?
And if not?…
Added by nikos tzar at 10:10am on September 8, 2014
hs (sequenced points) in initially one of two lattice structures. Output only the paths that meet the path requirements.
Path requirement (GH Inputs):
1. Number of path points: 1..N (N could and up being up to 100? (Massive calculations, realistic numbers in the up to 30 range)
2. Symmetry requirement: 0 (none), 2,3,4,5,6 fold (path sections repeat)
3. Closed path boolean: default true (output only paths where first point is last point)
4. Lattice selection: cubic body centered, cubic face centered
5. Straight path section boolean: default false. Blocking the path from going straight or allowing it to go straight. Going backwards should always be blocked.
Outputs:
1. List of unique points in sequence for path in the lattice. grouped by individual path
On implementation:
1. generate all paths and eliminate paths with duplicate points (self intersecting lines)
2. eliminate paths that don't meet closed boolean (first point not equal to last point)
3. eliminate paths that don't meet symmetry variable
for symmetry paths (symmetry not equal to 0) only number of points divided by symmetry has to be calculated. each section can be repeated the number of times of the symmetry.
For closed paths, a distance from the staring point could be maintained that could stop the generating of paths that can't make it home.
Any thoughts would be greatly appreciated!…
Added by Anton Bakker at 10:38pm on December 29, 2013
of 100% of the curve length to place my final section. I need to make it 99.99% of the length or the script breaks.
2. If I attempt to simplify the curve (there are two in the below project, one with 58 control points, this is the one that will not work if simplified) the script breaks.
3. If I redraw the curve or draw another curve (the second curve with fewer control points in the attached file for example) I cannot get the profile to loft along the entire curve even though the values that are being generated seem to be correct.
I feel as if I am missing something simple. could you please take a look at my script?
Thank you very much.…
proach:
1. It's very fast (you had 100++K things send to Kangaroo).
2. You can (as Plan B) use "intact" (whole NOT trimmed) panels (Lunchbox can make a variety of "patterns") and mastermind some "peripheral ring" - kind or gigantic "flange" - that could address the "adjust" issue. In fact marrying hexagons with nurbs ... it's not that easy (for a "perfectly" pleasing result).
3. The trim issue (the GH bug) is addressed (with a complex way, but blame GH for that).
4. You don't need any meshed surface since our goal is panels not surfaces (although achieving planarity is impossible - meaning that if you need transparency you'll opt Lexan instead of glass, with the obvious thermal loss disadvantages).
more in a while
best, Peter …
t on that thing since mine does what you want with no issues? (or maybe you want something other: like rearranging the triads kinda like a surf subdivision ?).
OK, I'll give a look on it (P.S. I haven't examine your def in depth since you did some very CPU taxing stuff ... and thus I've "translated" your requirement into a much simplified def that works 100(?) times faster(??)).
BUT ... if you did bad things (like a tree with variable items per branch) > remind me to kill you when we meet (no mercy).
have ready some red pepper Vodka (and some caviar - obviously).
he, he…
of things more:
1. DataTrees are used (sampling 3d data in Lists is ultra amateurish). This allows (as well) to check the truss rigidity [at least 2 "voxels" must "share" a common "face" in X.Y.Z etc etc etc] - this check IS NOT included mind.
2. Skin mode is added (that's rather cool).
3. BBoxes are created either in WorldXY plane or with respect any user defined plane.
Keep in mind that this is INDICATIVE: without a robust connectivity data structure (nodes to nodes indices AND nodes to struts indices) ANY truss definition is 100% academic (meaning: useless). Not to mention drilling axis data and clash detection (via trigonometry NOT physical "bool" type of checks).
more soon.…
ollection of curves (to be more precise: sweep properly oriented profiles along a given rail) ... you need a totally different approach (and 100 times faster).
2. Thus ... your def needs a major reconstruction: in fact a total remake ... especially if you intend to create a similar thing for real life AEC purposes (meaning: modular "struts", "strut" connectivity data, node design [usually done via metal plates], panel roofing design [ potentially using a secondary grid and/or stand-alone monocoque panels] ... etc etc).
3. I could provide to you a workaround on this using only one "component" ... but it's C# code only (no components of any kind) thus it could be potentially useless (unless you speak C#).
best, Peter…
eled in rhino. The building was Jean Nouvel's 100 11th avenue in New York. The piece of this building I plan on documenting is the rotation of the windows on the building because all of them are either rotated up, down, left, or right, and either at 2, 3, 4, or 5 degrees. Ive looked up as many tutorials as I can find, anyone have any suggestions? much appreciated
-Stew…
main surface by its planer cut surfaces.
In the end i'm trying to evaluate the differences in shape if you change the step size. (compare two volumes, one where the boundary curves are divided in for instance 3 parts and one in which the curves are divided into 100 parts)
so the idea is to find 'the integral' of the difference in shape by combining the boolean difference of all the separate elements and add this together.
I hope this makes sense, and that anyone can help me.
Thanks,
Tijl
the added picture shows a shape which needs to be divided by the green planars and than form separate volumes which can be evaluated separately…