d-drive or the web or God knows where.
Also, "3 simple spheres" implies that it's possible to determine what "simple" is. Perhaps you really do need 250 components and a runtime of 20 seconds in order to find that single point coordinate that is vital to your design.
An approach which might work but I'm not sure warrants the investment would be to define specific groups of components. Something like "If A is connected to B, then A and B are connected to C and finally C is hooked up to D and E, then you may be able to get the same result using only component X and Y". Not only is this approach free from unknowns it also tries to help the user out. I'd much rather be told "why don't you try using a Key/Value search here?" than "You're a f*cking idiot mate."
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 4:14pm on January 12, 2012
into a z-coordinate it just takes one of those values. For it to be an attractor you usually measure the distance (D output). If you plug that into the z-coordinate it will change when you move the attractor point around.
Also you had the option "only draw preview geometry for selected objects" enabled (one of the icons in the top right of Grasshopper). I wouldn't recommend that. It gets very confusing then. Just hide stuff you dont want to see, which is usually everything except your final output. Just middle-click on selected components and hide them. I added a custom preview at the end, which looks a lot nicer than the usual red jelly that Grasshopper shows by default.
Hope that helps!…
t, but I want to offset them in a series of six values (lets say 8,4,0,4,8,12 to keep it simple). Essentially I want to create a "domain" that goes from 8 to 12 but by going negative down to 0 first before bouncing back up. I don't think I can use the construct domain component to achieve this and I don't know how to do it.
Thanks in advance!
Ben
EDIT: I know I can easily accomplish this by plugging a multiline panel with the given values into the D input of Offset Surface, but I would like to be able to do it computationally so that if I change an input to 3, for example, it would adjust the series of numbers to be 6,3,0,3,6,9 or if I used 2, the adjustment would be 4,2,0,2,4,6. It doesn't have to be exactly this pattern but I am looking for a "bulge" in my offset surfaces with a 0 value in the middle.
…
is created for each point (25 paths, N=1 for each) which is feed into [Pull Point] for the pull geometry [G].
Correspondingly for the 4 source points a branch is created for each point and duplicated 25 times (4 paths, N=25 for each). This tree then needs to be inverted with [Path Mapper] so the structure will correspond to the format of the pull geometry. The mapping {A;B;C}(i) > {i}(B) produces (25 paths, N=4 for each) the structure to feed into the search point [P].
The [Pull Point] boolean toggle [C] needs to get set to False to obtain all the distances between all search and pull points (4 x 25 = 100 values).
Simultaneously there is also an index being created to correspond to the list of the 4 source points. This index is the integers 0 to 3 which are branched and inverted similar to the source points (25 paths, N=4 for each).
The distance output [D] from [Pull Point] is then sorted synchronously with the source point index for each branch. From the following screengrab branch {0;0} corresponds to a point in the 5 x 5 grid and the shortest distance between that point and a referenced source point index is 5.261. The index of the referenced source point is 3.
For each following sorted branch the first sorted index value will correspond to the closest source point (first [List Item] shown). This index value is then used to select from the original list of duplicated and inverted points and this is done for each of the 25 branches (second List Item shown).
Draw a line or whatever an away we go!…
- C
{2;0} (N=61) - D
{2;1} (N=60) - E
{2;2} (N=61) - F
group 2:
{0;0} (N=10) - U
{0;1} (N=10) - V
{0;2} (N=10) - W
{0;3} (N=10) - X
{0;4} (N=10) - Y
{0;5} (N=10) - Z
the idea case is I can merge those date sets in a pattern of A-U-B-V-C-W-D-X-E-Y-F-Z...so on
therefore I am thinking how could I modify the path on group 2 and make them becomes things like:
{0;0} (N=10) - U
{0;1} (N=10) - V
{0;2} (N=10) - W
{1;0} (N=10) - X
{1;1} (N=10) - Y
{1;2} (N=10) - Z
but I have no idea how could I modify the path in that way....
can anyone show me how to?…
Added by Preston Chan at 8:34pm on October 26, 2010
e Workshop and Conference will be a gathering of the global community of innovators and pioneers in the fields of architecture, design and engineering.
The event will be in two parts, a four day Workshop 14-17 July, and a public conference beginning with Talkshop 18 July, followed by a Symposium 19 July. The event follows the format of the highly successful preceding events sg2010 Barcelona, sg2011 Copenhagen, sg2012 Troy, and sg2013 London.
sg2014: Hong Kong
Image: Cities without Ground - Adam Frampton, Jonathan D Solomon and Clara Wong
URBAN COMPACTION
Large cities thrive on density and diversity. But beyond the energy and pollution advantages of the elevator over the automobile, complex issues are at play in concentrating population and built infrastructure in contemporary high-rise cities. How do you meet the challenges of system design for high quality compact urban environments?
Designing for high and increasing density in cities is a complex and wicked problem that calls for innovative approaches to modelling in diverse areas of the city’s dynamics.
sg2014 Challenge: Urban Compaction
WORKSHOP
The SG Workshop is a unique creative cauldron attracting attendees from across the world of academia, professional practice as well as many of the brightest students. The Workshop is open to 100 applicants who come together for four intensive days of design and collaboration.
The annual Workshop is organised around Clusters. Clusters are hubs of expertise comprising of people, knowledge, tools, materials and machines. The Clusters provide a focus for Workshop participants working together, within a common framework.
We now have an open call to submit proposals for Workshop Clusters
call for clusters
CONFERENCE
Talkshop Conference Day One
After four intense days of innovative work, the first day of the conference, the Talkshop, offers an opportunity for critical reflection on what has been accomplished in the Workshop. Talkshop will be an opportunity to open debates, pose questions, challenge orthodoxies, and propose new ideas.
Talkshop will feature informal and open discussions between Cluster participants, leading practitioners and emerging talents in digital design, offering inside perspectives on how the landscape of computational design is reshaping built form.
Symposium Conference Day Two
The second day of the conference, the Symposium, will feature invited keynote speakers showcasing major projects and research from around the globe that mark out the territory of the year's Challenge. The Symposium is a unique opportunity to hear insights into the challenges ahead for the discipline.
Interwoven throughout the day will be reports and highlights from each Workshop Cluster, giving an opportunity to view work created during the previous four days of intensive collaboration, design and development.
More information about the conference, including speakers, to be posted soon.
www.Smartgeometry.org…
Added by Shane Burger at 10:51am on February 3, 2014
at STL files of "thickened" wireframes.
The problem underneath, is that we are not dealing with 2d or 2.5d meshes, but a bunch of lines, intersecting in 3d vertex, wich globally are not topologically related, but its ideally a 3d spatial structure.
As fas as we know:
option1: mesh/solid boolean
>between tubes, for the edges, and spheres at each vertex.
>it happens to get many errors in Magics & crashes quickly with big structures and many meshes.
option 2: isosurface
>either isosurf , or realflow works fine for high blending needs, and small pieces
>looks always good but does not seem to fit slender tubular structures fabrication purposes
option 3: 3-matic software
>used by prototyping industry, seems to repair everything
>expensive, unaffordable, exceptionally
option4: topological extrude
>topologically solve the extrusion of a vertex with many edges, generating non overlapped geometry. For 2d and 2,5 D, it works, but our attempts in maya fail everytime we try with 3D vertices.
> we believe there has to be a geometrical mesh trick
(we imagine Giulio Piacentino's Weaver Bird could have this useful feature)
We'll be waiting for suggestions and solutions (or cases)
Thanks
Enrique & Pep…
ized triangles? Aesthetics? Constructability/financial? Frankly, much of the diagrid construction I've worked on and know about doesn't worry about same sizes but rather maximum and minimum sizes, and tolerances.
3. You could aim for families of sizes: understand the tolerance of the system as constructed and group similar panels by size and shape so that you could potentially have 10 of A, 8 of B, 4 of C, and 2 of D or something.
4. I highly recommend looking at Evolute Tools. It has all sorts of optimization of meshes that would allow you to control of size, shape, etc.
5. Finally, I don't think you want a simple mapping of a diagrid to your surfaces. I say that because of the way your form pinches down to a point. One thought would be to create a larger surface that has a more rectangular boundary, panelize it, then trim the panels. Then all the internal panels would be quite similar and you'd only have irregular edge panels.
Just a few thoughts.
That's my two cents!…
always working this way when a
2d-matrix tree structure is needed. I supposed many of us are using this logic
a lot.
It'd always be better if it's in 3 or 4 etc. dimensions.
best regards…
o a multiplication between two lists of N matrixes of 6x6.
So far, i've been working with them as data tree, therefore i have a "3 dimensional" setup(Paths are [X,Y}(Z))
i'm an absolute begginer in any programming language, but so far i've done something like this:ps: d is just an input, thats the number of dimensions,
both k and T are the lists of matrixes.well, i'm hoping to get one matrix list as an output, what is what i attempted by the c{m} up there, and if possible eventually(after some more operations) bring them back to data tree format.any ideas?Thanks!Bruno…
Added by Bruno Galvao at 1:19pm on February 20, 2014