his project. Attached is my latest script. It seems to work for all points & directions of gravity except when the points are at equal height (in the reference plane the script creates, not in the world space). In other words, when the vector from A to B is perpendicular to the gravity vector, it doesn't work. It's totally due to the formulas used to solve for distance (see script), but I haven't found a way to fix it to make it work. Kudos to anyone that can help me figure it out!
Other notes: Required input: Point A, Point B, Gravity vector, and desired Height and/or desired chain/arch Length. Cool trick: when inputting both Height and Length, it recalculates the end point (point B) with those desired parameters, and the end point lies along the AB vector. Also, the "x" output shows either the found height, length, or distance (when both height & length are input), and "newPl" just shows the reference plane used to make calculations easier.
Cheers…
Added by Will McElwain at 11:52pm on January 18, 2014
med that a 1000 lux measurement for a particular hour on a workplane grid point will indicate a illuminance from direct sun at that point. If I remember correctly, these simulations are to be run without the presence of any shading devices.
From an ASE calculation perspective, there are several shortcomings within Daysim (as it exists right now). The daylight coefficient method, which Daysim employs, calculates illuminance by dividing the sky into discrete patches. (http://naturalfrequency.com/wiki/sky-subdivision) For a clear sky with sun, the luminance from sun is accounted for by approximating the position of sun into 3 (as far as I know) patches. That in turn leads to an incorrect estimation of both position and luminance contribution of the sun.
Anyways, as I wrote in the begining, in my opinion the closest you'd get to calculating ASE from daysim right now would be running an annual daylighting calculation with Honeybee by setting ambient bounces as zero. A better approach, in case you are not trying to comply with something like leed v4, would be to do a DGP analysis as Chris mentioned in his post.
…
i projected my surface on XY plane, created voronoi curves on the planar surface and re-project / map the curves onto the subject model.
However, i'm not getting a desired result.
can any-1 please help me. or even show me a different way to model it via GH? I donot want to use rhino objects.
I have attached my initial sketch, GH and Rhino files.
Hope to find some solution so I could move forward :-(
Moreover, I could not convert the initial non-planar curves into surface hence I converted them into Mesh (thanks to 'Brian Harms' for helping me out). However, the protruding edges of the mesh is not a smooth NURB curve, it forms kind of vertices of a polygon. Any way to smoothen / fillet it? Will it affect when i commence 3D printing?
Regards,
aB…
/ interest to some of you. I'm attempting to generate "bricks" along an arc, the span of the arc is known (Line AB), as is the desired brick edge length (shown as chords on the dotted circle). Im am essentially trying to solve for the diameter of the dotted circle and its center point (C). The variables within the grasshopper script would be span (X), chord Length (Y) and number of segments to the arch (N). Lacking the radius or central angle means that Im unable to solve this using my limited knowledge of Trig.
I guess the key issue here is that chord length and number is driving the radius of the arc / circle. Hence why Im not simply using the divide curve tool.
Any input members might have would be fantastic and I'd be very happy to share the resulting file.
Thank you!
…
Added by Robert Harvey at 11:24am on November 20, 2012
join site boundary curves with voronoi curves so that voronoi curves at the edges becomes a closed polygon?
2)I want to create a line between voronoi curve control points and voronoi cell centroid points, such that each 2D voronoi cell is broken down into a sets of triangles. Please refer attached sketch.
3) Then How do i project voronoi curves along with triangl curves onto a vaulted roof?.
4) lastly, i want to give some thickness to those curve. i.e. the curves basically are structural beams of the roof. with my definition pipe command does not work very well i.e. pipes intersect and crossover at each vertices, which is not my intention.
attached is a sketch and my definition.
Can any1 help me with any of the 4 problems?
Thank you very much
AB…
g a problem though when trying to set a daylight simulation with some determined radiance parameters. Here's the problem: After many tries I think I found out that setting -ab = 6 and at the same time -aa = .05 creates some sort of problem, because when I try to do so My PC blocks for several minutes, without letting me manually end processes from taskmanager, and when I'm able again to enter grasshopper, i get the following error:
"Solution exception:index out of range: 0"
Does this really depends on the parameters and values I found out or is it related to something else? Is the problem relative to the structure of HoneyBee or is it just relative to my specific case (and maybe PC)? Is it possible to solve it, and if yes, how?
Atteched you find my rhino model and my grasshopper file.
Thanks in advance for your help and again many compliments!
Luigi…
Salimzadeh
Assistant: Saeede Kalantari a Fabrication Project for “Structural Systems” BA Course;
Participants: Maryam Ahmadi, Amir Ansaripour, Kimia Bagheri, Mohammad Hassan Habibi, Mohammad Mehdi Zamani, Sam Sabzevari, Zeynab Seyed Zehtab, Mohammad Mehdi Shahroudi, Niloofar Taheri, Masoumeh Abedini, Pedram Feyzi, Asma Karamouz, Kimia Karbalayi, Hamed Kamalzadeh, Fateme Kianinejhad, Maryam Mohammaddoust, Faeze Motamedian, Romina Mehrbod, Sara Naderi, Yasaman Nejati, Kimia Nourinejhad, Morteza Vaziri, Mehragin Baghi, Sana Motallem, Helpers: Milad Amiri, Soroush Raesi, Mahla Behrouz, Alireza Sheykhlar, Shadi Khaleghi, Mohaddese Taheri, Alireza Mohammadi, Mehrnoush Kia
Photography: Sara Ahmadi, Hasan Habibi
Video production: Shayan Khalilbeigi
Special Thanks To Dr. K. Taghizadeh, Dr. H. Mazaherian, Dr. Y. Eslami and Mr.Aliari
With Support Of: Center Of Excellency In Architecture Technology – CEAT - , Collage of Fine Arts University of #Tehran, ‘Art And 4th Dimension’ Symposium, Iran #Fablab and #Fologram
Rhino/Grasshopper and C# Definitions of form-Finding and Member-generation :
http://bit.ly/2RUKc5i…
even (0, 2, 4) then that means the point either never hit it, or went in and out again, meaning it's outside. If it hits an odd number of times, then it must have come from within originally.
The method implements this approach using the mesh bounding box, and then striking a polyline from your test point along a vector that is defined by the upper right corner of the bounding box + a vector of (100,100,100). In the case of your failing points, this is a result of their striking an edge very precisely, which gets counted as 2 hits instead of 1 (as it should be getting captured) and passing false:
Your best bet is probably to roll your own implementation, that tests for multiple vectors:
private void RunScript(List<Point3d> P, Mesh M, ref object A, ref object B, ref object C) {
BoundingBox bb = M.GetBoundingBox(false);
List<bool> inside = new List<bool>();
for (int i = 0; i < P.Count; i++) {
Polyline a = new Polyline(); Polyline b = new Polyline();
a.Add(P[i]); b.Add(P[i]);
a.Add(bb.Max + new Vector3d(100, 100, 100)); b.Add(bb.Max + new Vector3d(100, 150, 150));
int[] fa; int[] fb;
Point3d[] xa = Rhino.Geometry.Intersect.Intersection.MeshPolyline(M, new PolylineCurve(a), out fa); Point3d[] xb = Rhino.Geometry.Intersect.Intersection.MeshPolyline(M, new PolylineCurve(b), out fb);
inside.Add(xa.Length % 2 == 1 || xb.Length % 2 == 1);
checkA.AddRange(xa, new GH_Path(i)); checkB.AddRange(xb, new GH_Path(i));
}
A = inside;
}
…
Added by David Stasiuk at 10:20am on October 10, 2017
le with you.
I am trying to achieve the minimal path algorithm of Steiners tree in Python using the minimal path algorithm.The syntax would be as followsFirst I need to create a cube of any dimension.
Then I need to specify one origin say point A and destination point say B.
Now for this point A,B I need to create a machine based network which will automatically enroute A to B.
Where the angle will be constant i.e 120, length can be a variable, triangular node(steiners tree)using these constraints it will create a network.
Now, I should iterate the program in such a way that I should specify the further points say like A1 and B1 so on.The program will contain a limit constraint where it will come out of iteration loop and start a new loop,forming the network.
By this I will get a dense network of 120 deg branches.
The branching gets denser the moment I add source and destination points.
There can be 100 iterations to reach from A to B but the algorithm chooses the one following the minimal path.
I would be highly thankful to you if you would please share the python syntax and grasshopper definitionCapture.JPG for the same
Thank you for your time in advance
I would be highly grateful if you help me through
warm regards
Arya
12.gifShortest%20path%20algorithm.gh
min-paths.jpgcc.henn.studyimagesminimalpaths.jpg …