algorithmic modeling for Rhino

Search Results - 福彩3天齐网首页正版保真『0TBH·COM』福彩三d试机号码开机号码2023年3月19日7时42分22秒.H5c2a3.kcssaaksa.com

Topic: Solving 2D Closed Segmented Geometry - Multiple Radii, Consistent Panel Size: x geometry which will be the basis in plan for a building facade. The problem is as follows: I am generating a series of arcs using 3 different ranges for radii. Each segment of the geometry is assigned one of the radii. The length of each arc segment is controlled by a specific number, also within a range -- the end goal is to divide this geometry into perfectly equal segments. (Parameter Ranges) I am building these arcs in such a way that they are tied to the arc drawn before it - meaning that as the length of the previous arc is adjusted, the arc in question will still begin where the previous arc ends, and be tangent from said previous arc. This approach works well until I get to the final segment of the form. I want to be able to close the form in a way that the final arc both meets the first arc at its tangent point and is a length divisible by the desired segment length. Through a series of trial and error by means of adjusting the radii, panel size, and arc lengths, I have been able to get the geometry to being very close to closed, but there is always some sort of remainder, or the last arc is not tangent to the first arc. My thought is that this would be a perfect scenario to use Galapagos, but my attempts to do so have resulted in an almost immediate crash of rhino. I'm not sure if I'm feeding too many inputs into galapagos (the radii ranges and segment length ranges), or that the number I'm telling it to minimize is incorrect (distance between the end of the final segment and the start of the first segment), or if there is a larger issue with the definition I've written, but I haven't been able to figure out the issue. Are there any thoughts out there on how I might be able to reach a possible solution? Or at the very least is there any precedent for a geometric shape similar to what I am trying to create which follows the same number of parameters I'm using? I've attached the GH definition as well as a rhino model for your visual reference. To preview the GH form in rhino, simply assign the only curve in the attached rhino model to the crv node in grasshopper: This simply locates everything that's being generated in grasshopper in space in rhino. Thanks in advance for any thoughts, and also apologies for a somewhat potentially messy definition. …; Added by Ray LeChase at 11:12am on August 31, 2016

Topic: Cordyceps: he Cordyceps. Maybe some of you find this helpful/useful. So basically, the Cordyceps is a physical module with 4 knobs and 1 slider. The knobs give an output between 1 and 1000, while the physical slider outputs 0-359. And of course, for this physical module I wrote a plugin to communicate with it. The knobs are intended to be the variables that modifies the design, while the physical slider is intended to be connected to the camera component. Here I will put up "the recipe" for all to make their own module. You will be able to download the plugin as well. Please send me a message if you want the 3D-files for the knobs, the box and slider knob. They've been made to directly 3D-print. Plugin: https://github.com/zakadjeb/Cordyceps/blob/master/Cordyceps/Cordyce... Code for Arduino IDE: https://github.com/zakadjeb/Cordyceps/blob/master/Arduino/_Arduino_... What you need: 1x - Arduino (Leonardo, UNO or whatever) 4x - Potentiometers 1x - Sliding potentiometer 1x - Breadboard Bundle of jump wires. 1. So, a potentiometer is a variable resistor, which is basically a component that changes the resistance between the voltage and the ground. If A is supplied with 5V then B must be connected to Ground. The W will give "read" the resistance, and thus should be placed in Analog input (A0-A5) on the Arduino. The slider potentiometer works the same way. 2. Now connect the 4 pots to each their Analog input. The slider is supposed to be in A4. So to make sure: A0: Knob1 A1: Knob2 A2: Knob3 A3: Knob4 A4: Slider 3. Now it's time to connect the voltage! Using the breadboard, the voltage can be sent through 1 line, the Ground as well. It should be quite easy to connect them. 4. Now, download the Arduino IDE and copy-paste the code I supplied above. In the IDE, you need to let it know which Arduino you're working with, and which port is should send the script. 5. Almost there. Download the plugin. Open the port you're using through the plugin. Set Start to True and the Cordyceps should be within you. This recipe will be updated! Let me know if there are any issues. // Zakaria Djebbara…; Added by Zakaria Djebbara at 2:17am on January 10, 2017

Topic: Cordyceps: he Cordyceps. Maybe some of you find this helpful/useful. So basically, the Cordyceps is a physical module with 4 knobs and 1 slider. The knobs give an output between 1 and 1000, while the physical slider outputs 0-359. And of course, for this physical module I wrote a plugin to communicate with it. The knobs are intended to be the variables that modifies the design, while the physical slider is intended to be connected to the camera component. Here I will put up "the recipe" for all to make their own module. You will be able to download the plugin as well. Please send me a message if you want the 3D-files for the knobs, the box and slider knob. They've been made to directly 3D-print. Plugin: https://github.com/zakadjeb/Cordyceps/blob/master/Cordyceps/Cordyce... Code for Arduino IDE: https://github.com/zakadjeb/Cordyceps/blob/master/Arduino/_Arduino_... What you need: 1x - Arduino (Leonardo, UNO or whatever) 4x - Potentiometers 1x - Sliding potentiometer 1x - Breadboard Bundle of jump wires. 1. So, a potentiometer is a variable resistor, which is basically a component that changes the resistance between the voltage and the ground. If A is supplied with 5V then B must be connected to Ground. The W will give "read" the resistance, and thus should be placed in Analog input (A0-A5) on the Arduino. The slider potentiometer works the same way. 2. Now connect the 4 pots to each their Analog input. The slider is supposed to be in A4. So to make sure: A0: Knob1 A1: Knob2 A2: Knob3 A3: Knob4 A4: Slider 3. Now it's time to connect the voltage! Using the breadboard, the voltage can be sent through 1 line, the Ground as well. It should be quite easy to connect them. 4. Now, download the Arduino IDE and copy-paste the code I supplied above. In the IDE, you need to let it know which Arduino you're working with, and which port is should send the script. 5. Almost there. Download the plugin. Open the port you're using through the plugin. Set Start to True and the Cordyceps should be within you. This recipe will be updated! Let me know if there are any issues. // Zakaria Djebbara…; Added by Zakaria Djebbara to Cordyceps at 5:44am on January 10, 2017

Topic: Formfinding through Plastic deformation.: d simulate the bending process of a flat stell sheet in order to get the same shape. This can be really interesting so we can evaluate the material beheaviour, the deformation on the cross section a nd explore big deformations in mecanics analysis of materials. I am not a mecanical engineer nor a civil engineer, I´m an Architect and my interest is the construcction method and extracting the necesary information to consider fabricating the project. I´m having conceptual challengings on the methodology for this simulation, so I will post a small overview of what I`ve done. 1.- Understanding the Geometry. This is a sclupture by the Venezuelan/Hungarian/German artist Zoltan Kunckel (KuZo). The shape is achieved bending a pre water cut square sheet of stainless steel. After bended manually, the different lashes are pulled on the opposite direction. New curvatures are produced after all is deployed. 2.- Reproducing the Shape digitally. Using Karamba I built a definition to reproduce the produced by physical stress. This model served to find deformations that occur when a set of loads are applied to a mesh. Following this process will allow us to find a coherent and more natural cross section so then we could re-shape simulating the bending process of a piece of ductile material. 3.- Discretizing curve Reducing the model to its simplest element is a key aspect of finite nonlinear analysis. Once our shape is already defined we can divide its principal characteristic of its principal given curve. At this point I have already found the desired curve. I Think the better strategy to simulate bending the steel sheet into this shape, is rationalize the curve and divide it finding the tangents one of the curve that compose this sort of parabola. bur i don`t know how to parametrize that in GH. Please. If someone have a better Idea about this process I`ll glad to read sugestions. Tomás Mena …; Added by Tomás Mena Lozada at 4:11pm on March 23, 2017

Topic: Honeybee Incorrect Heat Balance: rrect, the heat balance of a zone is always 0 = Qcool/heat + Qinf + Qvent + Qtrans + Qinternalgains + Qsol. These parameters also correspond with the readEPresult element. However, if i sum up these values there is a slight deviation. The deviation is greater during daytimes and in winter, suggesting it has something to do with the heating values. Attached you'll find an image of the energy plus outputs that I use and the resulting -.CSV file that I constructed. In this you'll see that the balance does not add up. Am i missing some energy flows? Thanks for the help. Hour[H] Qbal{kWh] Qint[kWh] Qsol[kWh] Qinf[kWh] Qvent[kWh] Qtrans[kWh] Tair[°C] Tdrybulb[°C] DIFFERENCE 1 3,039357 0,137702 0 -0,253218 -0,321929 -2,000028 20 5,1 0,601884 2 3,107099 0,125462 0 -0,247457 -0,315484 -1,881276 20 4,6 0,788344 3 3,181073 0,119342 0 -0,261765 -0,334485 -2,473788 20 4,3 0,230377 …; Added by Vincent Höfte at 4:08am on July 11, 2017

Comment on: Topic 'Setting the value of Bounds.X, Bounds.Y, etc.': So it's not true that Bounds.X is only a getter. However it does behave as though it is. This is because RectangleF is a Value Type instead of a Reference Type. When you assign a variable of one value type to another variable of the same type, you always assign a copy of the first value. So when you request the Bounds from an attributes class, what you get is a copy of the actual bounds. Changing the X on this copy would be a useless operation which is why Visual Studio catches this mistake. Let's assume that Dog is a class (a reference type) and it has a get/set property for fur type. Then, if I type: Dog A = new Dog(); A.Coat = Long; Dog B = A; B.Coat = Short; At the end of these lines, both A and B have a short coat, because the act of assigning A to B (line 3) means that both A and B now point to the same instance of Dog in memory. In effect, A and B are the same. If Dog were a struct (a value type), then at the end of this code A and B would have different coats, because assigning A to B means creating a copy of A. Any changes made to B will not affect A. The one place where this causes annoying situations is exactly where you ran into it. If a property returns a value type then it's typically not useful to call properties and methods on that returned data, as it would only affect the copy of the actual data instead of the original data. That's why, if you want to change the Bounds of an attribute, you need code like this: RectangleF box = Bounds; box.X +=10; Bounds = box; On to the second problem, which is that doing it this way won't help you one bit. Laying out a component is a difficult job and the size of the Bounds depends on many things: The display mode of the component (icon or text). The size of the text (depending on which Font to use). The maximum number of input and output parameters. The maximum width of the longest input/output parameter name. The maximum number of state icons to draw on the input/output parameters. Changing the Bounds after the layout has occurred will basically just invalidate the parameter layout, resulting in parameter names and grips being drawn in the wrong places. If you want to affect the size of the Bounds for a GH_Component class, you're going to have to dive in and do the laying out yourself. As mentioned before, this is not trivial. There are static methods on GH_ComponentAttributes which are helpful when doing this, have a look at: LayoutComponentBox() LayoutInputParams() LayoutOutputParams() LayoutBounds() Unfortunately they are undocumented. -- David Rutten david@mcneel.com…; Added by David Rutten at 1:39pm on January 31, 2014

Event: Grasshopper Advanced Training: to enter the programming world and tinker more complex, interactive solutions. We will also explore advanced programming paradigms. There is no class official programming language, as both C# and Vb.Net are possible on the participant’s side, and all examples will be provided in both C# and Vb.Net. Additionally, we will see how to get started writing full .Net plug-ins. Finally, we will have time to explore user’s own proposals on the third day. Day 1 Morning: programming introduction in .Net • The Grasshopper scripting components. Choosing a .Net language. Language developments • Variables declaration, assignment and utilization. Operators. Methods [functions]. Calls • Classes: declaration and instancing. Constructors. Importing a namespace. Point3d, Lines • Arrays declaration and usage. Lists. Adding to arrays and lists, advantages and opportunities. Afternoon: patterns • About OOP (object oriented programming) as opposed to procedural programming. Discussion • Example of OOP good code reuse: sorting points by coordinates using the .Net SDK classes • Lists as input parameters. Trees as input parameters. Usage and limitations • Finding resources: on the net with website that can help getting started and troubleshoot. And books Day 2 Morning: extending Grasshopper functionality with our definitions • Store data between updates. The use of fields [globals, or static locals] • Examples on how to use stored data between updates: a simple agents simulation • Baking geometry with scripting directly into the Rhino document. Baking with names • Passing custom types from a scripted component to another one. Our own code reusability • Rendering an animation from Grasshopper. How to get started and final results Afternoon: customizing our tools • Our Rhino plug-in with Visual Studio C# [Vb.Net] Express Edition & wizard. Parametric mesher • Writing a custom Grasshopper component: hacking an exporter for our data to Excel Day 3 All day: personal project • Rehearsal on any example from the first two days. A project that you want to start on your own, being it a Rhinoceros plug-in, a Grasshopper assembly or a script. Example might be to send data through network with UDP to Processing MINIMUM REQUIREMENTS A good foundation of Grasshopper visual programming is mandatory. You will need a level which corresponds to the Grasshopper 101 course outline. Examples of things that will not be covered in this course are: sorting document spheres by diameter, paneling of a surface with grasshopper components. You are expected to already know these from the Grasshopper course.…; Added by Giulio Piacentino at 1:26am on January 15, 2010

Blog Post: MCDC // Master Computational Design and Construction: Added by David Lemberski at 10:57am on May 26, 2014

Topic: How to avoid 'Input parameter ... failed to collect data' for empty input curve parameters: rameters, which forces the user to connect all three curve input parameters (even if only 2 are required) to avoid the message 'Input parameter ... failed to collect data'. How can I set up the curve inputs so that null values are valid? I'm currently registering these as curve parameters as below, and suspect the answer lies in using a different method for parameter registration. protected override void RegisterInputParams(GH_Component.GH_InputParamManagerpManager) { pManager.Register_SurfaceParam( "Reference Surface", "S", "Surface on which laths are to be generated", GH_ParamAccess.item); pManager.Register_CurveParam( "Surface curves 1", "Curves 1", "Set of curves across surface in first direction", GH_ParamAccess.list); pManager.Register_CurveParam( "Surface curves 2", "Curves 2", "Set of curves across surface in second direction", GH_ParamAccess.list); pManager.Register_CurveParam( "Surface Curves 3", "Curves 3", "Set of curves across surface in third direction", GH_ParamAccess.list); pManager.Register_DoubleParam( "Lath Offsets 1", "LO1", "Offset from surface to centreline of first layer", 0.0, GH_ParamAccess.item); pManager.Register_DoubleParam( "Lath Offsets 2", "LO2", "Offset from surface to centreline of second layer", 0.0, GH_ParamAccess.item); pManager.Register_DoubleParam( "Lath Offsets 3", "LO3", "Offset from surface to centreline of third layer", 0.0, GH_ParamAccess.item); pManager.Register_IntegerParam( "Seed Value (0, 1, 2)", "Seed", "Seed value for weave offsets (0 for no weave, 1 or 2 for weave)",0, GH_ParamAccess.item); } Thanks! Alex …; Added by Alex Baalham at 9:48am on October 1, 2012

Comment on: Topic 'Discrete genome - Elite size - Display settings?': lly it should not make much of a difference - random number generation is not affected, mutation also is not. crossover is a bit more tricky, I use Simulated Binary Crossover (SBX-20) which was introduced already in 1194: Deb K., Agrawal R. B.: Simulated Binary Crossover for Continuous Search Space, inIITK/ME/SMD-94027, Convenor, Technical Reports, Indian Institue of Technology, Kanpur, India,November 1994 Abst ract. The success of binary-coded gene t ic algorithms (GA s) inproblems having discrete sear ch sp ace largely depends on the codingused to represent the prob lem variables and on the crossover ope ratorthat propagates buildin g blocks from pare nt strings to childrenst rings . In solving optimization problems having continuous searchspace, binary-co ded GAs discr et ize the search space by using a codingof the problem var iables in binary st rings. However , t he coding of realvaluedvari ables in finit e-length st rings causes a number of difficulties:inability to achieve arbit rary pr ecision in the obtained solution , fixedmapping of problem var iab les, inh eren t Hamming cliff problem associatedwit h binary coding, and processing of Holland 's schemata incont inuous search space. Although a number of real-coded GAs aredevelop ed to solve optimization problems having a cont inuous searchspace, the search powers of these crossover operators are not adequate .In t his paper , t he search power of a crossover operator is defined int erms of the probability of creating an arbitrary child solut ion froma given pair of parent solutions . Motivated by t he success of binarycodedGAs in discret e search space problems , we develop a real-codedcrossover (which we call the simulated binar y crossover , or SBX) operatorwhose search power is similar to that of the single-point crossoverused in binary-coded GAs . Simulation results on a number of realvaluedt est problems of varying difficulty and dimensionality suggestt hat the real-cod ed GAs with t he SBX operator ar e ab le to perform asgood or bet t er than binary-cod ed GAs wit h t he single-po int crossover.SBX is found to be particularly useful in problems having mult ip le optimalsolutions with a narrow global basin an d in prob lems where thelower and upper bo unds of the global optimum are not known a priori.Further , a simulation on a two-var iable blocked function showsthat the real-coded GA with SBX work s as suggested by Goldberg and in most cases t he performance of real-coded GA with SBX is similarto that of binary GAs with a single-point crossover. Based onth ese encouraging results, this paper suggests a number of extensionsto the present study. 7. ConclusionsIn this paper, a real-coded crossover operator has been develop ed bas ed ont he search characte rist ics of a single-point crossover used in binary -codedGAs. In ord er to define the search power of a crossover operator, a spreadfactor has been introduced as the ratio of the absolute differences of thechildren points to that of the parent points. Thereaft er , the probabilityof creat ing a child point for two given parent points has been derived forthe single-point crossover. Motivat ed by the success of binary-coded GAsin problems wit h discrete sear ch space, a simul ated bin ary crossover (SBX)operator has been develop ed to solve problems having cont inuous searchspace. The SBX operator has search power similar to that of the single-po intcrossover.On a number of t est fun ctions, including De Jong's five te st fun ct ions, ithas been found that real-coded GAs with the SBX operator can overcome anumb er of difficult ies inherent with binary-coded GAs in solving cont inuoussearch space problems-Hamming cliff problem, arbitrary pr ecision problem,and fixed mapped coding problem. In the comparison of real-coded GAs wit ha SBX operator and binary-coded GAs with a single-point crossover ope rat or ,it has been observed that the performance of the former is better than thelatt er on continuous functions and the performance of the former is similarto the lat ter in solving discret e and difficult functions. In comparison withanother real-coded crossover operator (i.e. , BLX-0 .5) suggested elsewhere ,SBX performs better in difficult test functions. It has also been observedthat SBX is particularly useful in problems where the bounds of the optimum point is not known a priori and wher e there are multi ple optima, of whichone is global.Real-coded GAs wit h t he SBX op erator have also been tried in solvinga two-variab le blocked function (the concept of blocked fun ctions was introducedin [10]). Blocked fun ct ions are difficult for real-coded GAs , becauselocal optimal points block t he progress of search to continue towards t heglobal optimal point . The simulat ion results on t he two-var iable blockedfunction have shown that in most occasions , the sea rch proceeds the way aspr edicted in [10]. Most importantly, it has been observed that the real-codedGAs wit h SBX work similar to that of t he binary-coded GAs wit h single-pointcrossover in overcoming t he barrier of the local peaks and converging to t heglobal bas in. However , it is premature to conclude whether real-coded GAswit h SBX op erator can overcome t he local barriers in higher-dimensionalblocked fun ct ions.These results are encour aging and suggest avenues for further research.Because the SBX ope rat or uses a probability distribut ion for choosing a childpo int , the real-coded GAs wit h SBX are one st ep ahead of the binary-codedGAs in te rms of ach ieving a convergence proof for GAs. With a direct probabilist ic relationship between children and parent points used in t his paper,cues from t he clas sical stochast ic optimization methods can be borrowed toachieve a convergence proof of GAs , or a much closer tie between the classicaloptimization methods and GAs is on t he horizon. In short, according to the authors my SBX operator using real gene values is as good as older ones specially designed for discrete searches, and better in continuous searches. SBX as far as i know meanwhile is a standard general crossover operator. But: - there might be better ones out there i just havent seen yet. please tell me. - besides tournament selection and mutation, crossover is just one part of the breeding pipeline. also there is the elite management for MOEA which is AT LEAST as important as the breeding itself. - depending on the problem, there are almost always better specific ways of how to code the mutation and the crossover operators. but octopus is meant to keep it general for the moment - maybe there's a way for an interface to code those things yourself..!? 2) elite size = SPEA-2 archive size, yes. the rate depends on your convergence behaviour i would say. i usually start off with at least half the size of the population, but mostly the same size (as it is hard-coded in the new version, i just realize) is big enough. 4) the non-dominated front is always put into the archive first. if the archive size is exceeded, the least important individual (the significant strategy in SPEA-2) are truncated one by one until the size is reached. if it is smaller, the fittest dominated individuals are put into the elite. the latter happens in the beginning of the run, when the front wasn't discovered well yet. 3) yes it is. this is a custom implementation i figured out myself. however i'm close to have the HypE algorithm working in the new version, which natively has got the possibility to articulate perference relations on sets of solutions. …; Added by Robert Vier to Octopus at 1:59pm on June 8, 2013