Search Results - 分分快3最准高手助赢计划-『8TBH·COM』福利彩票开奖结果012期查询--2023年3月19日6时48分50秒.H5c2a3.5jexii16x-gov-hk

Topic: Kangaroo 0.095 released: le and grasshopper timer to simplify simulation control. Double click the main Kangaroo component to open this remote. There are buttons for Stop(reset), Play, Pause, and Step (moves the simulation forward one iteration). Line-line force - allows interaction between line segments - they are treated as rigid cylinders. As with springs, there are settings for offset and rest distance, so this can be used to simulate colliding rods, and also for keeping cylinders tangent to one another (can be used for reciprocal structures). Gear simulator - collision between curves in a plane, can be used for various mechanical simulations - cams, gears, rack and pinions etc. Developablize force - adjusts vertices of a mesh locally, to make angles around each interior vertex sum to 2*Pi, so the mesh can be unfolded to a flat sheet without stretching. Volume dependent pressure force - allows you to set a rest volume for a mesh instead of just a fixed pressure. When combined with Laplacian smoothing for area minimization, this can be used to optimize for CMC (constant-mean-curvature) surfaces. It will also work on open meshes. Translation lock - maintains a fixed relationship between a pair of points. This can be used to enforce periodic boundary conditions for TPMS. Equalize angles force - given a set of angles (defined by 3 points each), this tries to adjust them all to become equal. Mirror symmetry force - can be used to minimize curvature variation, and optimize for higher order curve continuity. It can also be used for simulating torsional resistance in curved rods. True minimal surface relaxation - Laplacian smoothing force now includes an option for cotangent weighting, which optimizes for zero mean curvature, unlike spring based methods, or uniform weighted Laplacian smoothing which only roughly approximate this. Fast sphere collide - allows much faster collision detection between large numbers of spheres. By placing these spheres at the vertices, this can also be used for collision between meshes. Force-density element - an experimental one, more on this later Projected-force - adjusts its strength so the component of the force in a given direction stays constant. New mesh tools: WarpWeft - sorts the edges of a quad mesh into warp and weft directions. This can be used to assign them different stiffness in fabric form-finding. Checkerboard - sort the faces of a mesh into 2 lists so that 2 faces of the same colour are never adjacent. MeshDirection - sorts the vertices of a quad mesh to give it a sort of u-v directionality Refine Strips - subdivision in one direction only - can be used to generate developable strips Stripper - separates out the strips of quads from a larger mesh Unroller - unfolds a quad strip to flat without stretching MeshMap - maps points from one mesh to another (can be used together with circle-packing to generate conformal mappings) Reciprocal structure - generates starting geometry for a reciprocal structure from any input mesh (using the Plankton mesh library *Note* If you already have the Plankton components installed, you will need to update to version 0.3.0, which is available from here) ReMesher - adjusts the connectivity of a mesh by flipping, splitting and collapsing edges to make all edge lengths closer to a target value Diagonalize - creates a new face for every edge of the original mesh. Can be used on quad meshes to easily convert to a diagrid. Refine - simple non-smoothing subdivision, splitting quads into 4 quads, and triangles into 4 triangles QuadDivide - subdivide quads by any number squared, not just powers of 4 Corners - finds the corner vertices of a quad mesh ByParent - simple quad subdivision, keeping the output grouped by parent face. User objects: The download comes with an increased collection of user objects to simplify setting up common simulation types - Including a simple to use origami simulator, a reciprocal structure generator, and a tool to generate compact circle packings from a CP mesh. General: Geometry input now accepts polylines and straight curves. Hinges can now be fold completely flat in both directions. Various other minor bug fixes and speed improvements (including much faster removeDuplicatePoints/Lines components) ***** I've not yet updated all the documentation and example files to reflect this new version, but over time I will keep posting here with new demos and explanation of all these new features. I'll try and add a few new examples each week. Vote in the comments below if there is a feature mentioned above that you're particularly keen to hear more about soon. No doubt there are still some bugs to be discovered. If something isn't working the way you expect or want it to, please post in this forum (ideally with a description or sketch of what you think should be happening, and a clear description of what happens instead and any error messages). There are also some more new features that weren't quite ready to make it into this release, but are on the way shortly... Kangaroo remains completely free, for personal, academic, and commercial use. I'm always interested to hear about projects done using it, and suggestions for improvements or additions. Daniel …; Added by Daniel Piker to Kangaroo at 7:51am on December 12, 2013

Topic: Grasshopper 0.8.0050 available for download: ger work. Be aware, this release breaks file-forwards compatibility. You will not be able to open gh and ghx files saved with 0.8.0050 on previous versions, though of course you should be able to open old files without problems. If this is not the case, please yell loudly. If you're having trouble loading Grasshopper, note that you must have the latest Microsoft C++ Runtimes installed on your machine. They can be downloaded from the microsoft website. The new release can be downloaded from the usual location. Here's a list of changes, additions and fixes since 0.8.0013: File format forwards compatibility has been broken. You will not be able to open files saved with 0.8.0050 on earlier versions. This release contains many breaking changes and GHA libraries compiled for older version may not work anymore. Grasshopper Binary files (*.gh) are now saved as compressed data. Grasshopper Binary files (*.gh) are now the default format. Support for ancient versions of the Text Panel (still called Post-It from back then) has been removed. Support for ancient versions of the Path Mapper (still called Path Lexer from back then) has been removed. Placeholders for ancient versions of the Graph Mapper have been removed. Gradient input parameters now show state tag icons (Reversed, Flatten etc.). Geometry Cache name changes are now updated on every key press. Geometry Cache name changes can now be cancelled with Escape. Geometry Cache name changes can now be undone. Mesh|Mesh intersection component now uses a different algorithm. The old behaviour is still available from the component menu. Warning and Error balloons are now drawn as part of a Canvas Widget and will no longer show up in the Hi-Res image export. Galapagos now accepts multiple fitness values. The true fitness will be the average of the collection. Galapagos wires are drawn much fainter when the Galapagos object is unselected. Medium fast redraw mode in Galapagos now immediately redraws instead of at the end of each generation. Redesigned all Grasshopper file format icons and added larger size icons for high-dpi explorer views. Redesigned the Most Recently Used files menu, it should now display much quicker. Compass widget has been rewritten in an attempt to increase display performance. Added preferences section for Compass widget. Added preferences section for Align widget. Added preferences section for Default Preview colours. Added preferences section for Document Preview colours. Added preferences section for the Most Recently Used files menu. The Area component now accepts Breps, Meshes and Planar Closed Curves. The Area Centroid component now accepts Breps, Meshes and Planar Closed Curves. The Volume component now accepts Breps and Meshes. The Volume Centroid component now accepts Breps and Meshes. Added Merge Faces component (Surface.Util panel). Added a Mesh Smooth component (Mesh.Util panel). Added a Curve Seam component (Curve.Util panel). Added Interpolate Curve With Tangents component (Curve.Spline dropdown). Added GrasshopperFolders command to open Settings, Components and UserObject folders without loading the core plugin. The window that reports on certain Loading Errors now has a Copy button. Added Simplify post-process filter to parameters (in addition to Reverse, Flatten and Graft). Parameter post processes (Reverse, Flatten, Graft & Simplify) can now also be assigned to output parameters. Version History window now has formatting (not happy with this, I'm working on something better). The Process Info window is gone. Main menu has been redesigned. Canvas toolbar has been redesigned. Canvas context menu has been replaced by a Radial Menu. Canvas now has a radial menu which will pop up on Middle Mouse Button clicks. It's possible to switch between Radial and Legacy menus in the Preferences (Interface.Canvas section). 'Save As Copy' feature has been replaced by 'Save Backup' which is a GUI-less save including date+time stamp. Added a 'Show in Folder' item to the File menu. AutoSave settings are no longer available from the File menu, you now need to use the Preferences. Selection shifts now also modify the view so you can use Ctrl+Left and Ctrl+Right to navigate up and downstream. Mesh Edge display can now be toggled with Ctrl+M. Preview modes now have shortcuts (Ctrl+1 = no preview, Ctrl+2 = wireframe, Ctrl+3 = shaded). Solution States now have a default name. Data Viewer window now responds to all required events. Data Viewer window can now handle input and output parameters as well. Canvas Navigation pane can now be dragged using the icon in the upper left corner. The Persistent Data Editor has been redesigned. It's now possible to select multiple items in the Persistent Data Editor list and edit their properties. It's now possible to drag multiple items at the same time in the Persistent Data Editor list. Item addition to the Persistent Data Editor is much improved. The Persistent Data Editor is now non-modal. The Canvas would remain black upon maximizing the Rhino window, this is fixed. Sliders would cause multiple updates under certain conditions, this is fixed. Digit Scrollers would cause multiple updates under certain conditions, this is fixed. Pipes were inside out. This is fixed. The curve component would not adjust invalid nurbs degrees, this is fixed. Curves referencing Brep edges failed to load, this is fixed. Points referencing Brep edges failed to load, this is fixed. Referenced dlls in the VB/C# components sometimes resulted in invalid imports statements, this is fixed. Pasting geometry in Rhino would cause a recompute of the Grasshopper solution, this is fixed. Importing a file into the Rhino document would cause a recompute of the Grasshopper solution, this is fixed. Galapagos would trigger superfluous solutions, this is fixed. Mesh Solid Difference had a wrong name and description, this is fixed. Several menu items were not greyed out despite not being usable, this is fixed. The position and size of the Grasshopper window failed to get stored on Rhino shutdown, this is fixed. The Persistent Data Editor would crash on parameters that did not support data proxies, this is fixed. I'll add some additional information regarding some of the new UI features in subsequent posts. -- David Rutten david@mcneel.com Poprad, Slovakia…; Added by David Rutten at 10:02am on July 30, 2011

Topic: A script for elastic bending (aka the elastica curve): rmation?" I know that this can already be accomplished using the brilliant Kangaroo plugin, but I wanted a simpler and faster (yet still accurate) single component that could replicate this unique curve using a variety of inputs: the length of the rod/wire, the width/distance between the endpoints, the height of the bend, and the tangent angle at the start. I also wanted make the unknowns (such as height if only length and width are known) easily accessible for plugging into additional components. The resulting script, being an all-in-one solution, is somewhat unwieldy, but it could easily be broken down into smaller components (custom .gha's which I don't have the ability to code). If someone wants to tackle this, please do! I'm not an expert coder by any means, and as this was only my second time diving into Grasshopper scripting, if the script seems somewhat strange, that's probably why. I did try to comment the code pretty well though. Here's the full description: -------------------------------------------------- DESCRIPTION: This beast creates the so-called 'elastica curve', the shape a long, thin rod or wire makes when it is bent elastically (i.e. not permanently). In this case, force is assumed to only be applied horizontally (which would be in line with the rod at rest) and both ends are assumed to be pinned or hinged meaning they are free to rotate (as opposed to clamped, when the end tangent angle is fixed, usually horizontally). An interesting finding is that it doesn't matter what the material or cross-sectional area is, as long as they're uniform along the entire length. Everything makes the same shape when bent as long as it doesn't cross the threshold from elastic to plastic (permanent) deformation (I don't bother to find that limit here, but can be found if the yield stress for a material is known). Key to the formulas used in this script are elliptic integrals, specifically K(m), the complete elliptic integral of the first kind, and E(m), the complete elliptic integral of the second kind. There was a lot of confusion over the 'm' and 'k' parameters for these functions, as some people use them interchangeably, but they are not the same. m = k^2 (thus k = Sqrt(m)). I try to use the 'm' parameter exclusively to avoid this confusion. Note that there is a unique 'm' parameter for every configuration/shape of the elastica curve. This script tries to find that unique 'm' parameter based on the inputs. The algorithm starts with a test version of m, evaluates an expression, say 2*E(m)/K(m)-1, then compares the result to what it should be (in this case, a known width/length ratio). Iterate until the correct m is found. Once we have m, we can then calculate all of the other unknowns, then find points that lie on that curve, then interpolate those points for the actual curve. You can also use Wolfram|Alpha as I did to find the m parameter based on the equations in this script (example here: http://tiny.cc/t4tpbx for when say width=45.2 and length=67.1). Other notes: * This script works with negative values for width, which will creat a self-intersecting curve (as it should). The curvature of the elastica starts to break down around m=0.95 (~154°), but this script will continue to work until M_MAX, m=0.993 (~169°). If you wish to ignore self-intersecting curves, set ignoreSelfIntersecting to True * When the only known values are length and height, it is actually possible for certain ratios of height to length to have two valid m values (thus 2 possible widths and angles). This script will return them both. * Only the first two valid parameters (of the required ones) will be used, meaning if all four are connected (length, width or a PtB, height, and angle), this script will only use length and width (or a PtB). * Depending on the magnitude of your inputs (say if they're really small, like if length < 10), you might have to increase the constant ROUNDTO at the bottom REFERENCES: {1} "The elastic rod" by M.E. Pacheco Q. & E. Pina, http://www.scielo.org.mx/pdf/rmfe/v53n2/v53n2a8.pdf {2} "An experiment in nonlinear beam theory" by A. Valiente, http://www.deepdyve.com/lp/doc/I3lwnxdfGz {3} "Snap buckling, writhing and Loop formation In twisted rods" by V.G.A. GOSS, http://myweb.lsbu.ac.uk/~gossga/thesisFinal.pdf {4} "Theory of Elastic Stability" by Stephen Timoshenko, http://www.scribd.com/doc/50402462/Timoshenko-Theory-of-Elastic-Stability (start on p. 76) INPUT: PtA - First anchor point (required) PtB - Second anchor point (optional, though 2 out of the 4--length, width, height, angle--need to be specified) [note that PtB can be the same as PtA (meaning width would be zero)] [also note that if a different width is additionally specified that's not equal to the distance between PtA and PtB, then the end point will not equal PtB anymore] Pln - Plane of the bent rod/wire, which bends up in the +y direction. The line between PtA and PtB (if specified) must be parallel to the x-axis of this plane ** 2 of the following 4 need to be specified ** Len - Length of the rod/wire, which needs to be > 0 Wid - Width between the endpoints of the curve [note: if PtB is specified in addition, and distance between PtA and PtB <> width, the end point will be relocated Ht - Height of the bent rod/wire (when negative, curve will bend downward, relative to the input plane, instead) Ang - Inner departure angle or tangent angle (in radians) at the ends of the bent rod/wire. Set up so as width approaches length (thus height approaches zero), angle approaches zero * Following variables only needed for optional calculating of bending force, not for shape of curve. E - Young's modulus (modulus of elasticity) in GPa (=N/m^2) (material-specific. for example, 7075 aluminum is roughly 71.7 GPa) I - Second moment of area (or area moment of inertia) in m^4 (cross-section-specific. for example, a hollow rod would have I = pi * (outer_diameter^4 - inner_diameter^4) / 32 Note: E*I is also known as flexural rigidity or bending stiffness OUTPUT: out - only for debugging messages Pts - the list of points that approximate the shape of the elastica Crv - the 3rd-degree curve interpolated from those points (with accurate start & end tangents) L - the length of the rod/wire W - the distance (width) between the endpoints of the rod/wire H - the height of the bent rod/wire A - the tangent angle at the (start) end of the rod/wire F - the force needed to hold the rod/wire in a specific shape (based on the material properties & cross-section) **be sure your units for 'I' match your units for the rest of your inputs (length, width, etc.). Also note that the critical buckling load (force) that makes the rod/wire start to bend can be found at height=0 THANKS TO: Mårten Nettelbladt (thegeometryofbending.blogspot.com) Daniel Piker (Kangaroo plugin) David Rutten (Grasshopper guru) Euler & Bernoulli (the O.G.'s) -------------------------------------------------- Edit: More on the math behind this here. Cheers, Will …; Added by Will McElwain at 4:08pm on February 26, 2014

Blog Post: Tangible User Interface for Grasshopper: Added by Daniel Piker at 2:54pm on July 1, 2010

Blog Post: Integration Design Process: toward Energy and Structure Compatibility based upon Iranian Traditional Architecture Principles

Download Link of Presentations in Higher Quality…

Added by Mahdi Soheyli Fard at 8:21pm on October 18, 2015

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

Topic: NEW RELEASE > Ladybug 0.0.59 and Honeybee 0.0.56!: re are major changes and enhancements. HONEYBEE More Flexible Workflow - Many small modifications were made to support a more flexible workflow, such as the ability to separate a zone created with masses2Zones into editable HBSrfs that can be recombined. For the energy components, it is now possible to plug custom constructions directly into the components that set the zone constructions without writing them first into the library. For the daylighting components it is now possible to change all of the materials of specific surface types at once. Support for Complex Geometry - Many small bugs for complex geometry have been fixed including the ability to import energy results correctly for curved NURBS surfaces as well as unconventional window configurations. Also, the intersectMasses component now almost always succeeds in splitting all of the surfaces of adjacent zones, no matter how complex the intersection is. Automatic Download Issues Fixed - Many users who faced issues with not having “gendaymtx.exe” or who had trouble syncing with our github know that we faced an issue with automatic background downloads. Air Walls - Honeybee EnergyPlus models now officially support air walls (or virtual partitions) in a basic implementation. Now, any time that you use the air wall construction or set a surface type to “air wall,” the air between adjacent zones will be automatically mixed. At present, this mixing is just a constant flow based on the surface area between zones connected by air walls multiplied by an adjustable “flow factor.” It is important to stress that this basic air mixing is not with the EnergyPlus Airflow Network, although the groundwork laid in this release will eventually allow for the implementation of the Airflow Network in future releases. As such, this present air mixing is only suitable for multi-zone conditions where there is not significant buoyancy-driven flow between zones. Natural Ventilation - To go along with the new potential introduced by air walls, there has been a basic implementation of EnergyPlus’s natural ventilation objects in a new component called “Set EP Airflow”. The current setup allows for three possible types of natural ventilation: 1) natural ventilation through windows (with auto-calculated flow based on window area, outdoor wind speed/direction, and stack effects), 2) custom wind and stack objects that can be used to model things such as chimneys off of single zones, and 3) constant, fan-driven natural ventilation. Additional Thermal Mass - The capability to add additional thermal mass to zones has been added. This is useful for factoring in the mass of indoor furniture or heavy interior objects such as chimneys. New Utility Components - Abraham has added a couple of useful components to help calculate lighting loads based on bulb types and target lighting levels as well as a converter from ACH to the m3/s-m2 that the other HB components accept. Along this vein, there is also a component for adding in the resistance of Air Films to HB constructions. Improved and Editable Ideal Air Loads System - The EnergyPlus Ideal Air System now goes through an automatic sizing period at the start of the simulation based on the extreme weeks of the weather file. Furthermore, the ability to adjust many of the parameters of the ideal air loads system have been added with a new “Set Ideal Air Loads Parameters” component. The component allows you to add in heat recovery, air side economizers and demand-controlled ventilation. OpenStudio Export Update - The OpenStudio workflow is still largely under development but this release includes a version with a working VAV and PTHP system template for those curious with experimenting. Note that not all of the new features available for the basic “Run Energy Simulation” component are available for the OpenStudio component (such as air walls, natural ventilation, or additional thermal mass). Microclimate/Indoor Comfort Maps - Blossoming from initial experiments with the radiant temperature map, a workflow for looking into sub-zone microclimate and indoor comfort has been initiated. All components for this are presently under the Honeybee WIP tab but, over the next month, they will be completing their development phase and moving into the rest of the tabs. If you are interested in testing when they are ready, please let Chris know. For a teaser video of the intended capabilities, see this video: (https://www.youtube.com/watch?v=fNylb42FPIc&list=UUc6HWbF4UtdKdjbZ2tvwiCQ) LADYBUG Monthly Bar Chart - After much demand from multiple parties, a new component to create monthly bar and line charts has been added. The component is particularly useful for plotting the outputs of the “Average Data” component like monthly EPW data or averaged monthly-per hour data. It also supports daily data and any type of Energy simulation results. Wind Profile - To go along with the new capabilities of natural ventilation in Honeybee, Ladybug now has a fully fleshed-out Wind Profile component that allows you to visualize how wind speed changes with height in relation to your building geometry. The component is geared to understanding the conditions of prevailing wind and will be useful in the future for setting up CFD models. Credit goes to Djordje Spasic for adding in all of the new capabilities. In a similar vein, the appearance of the wind rose has also been improved thanks to suggestions from Alejandra Menchaca. Faster Solar Adjusted Temperature - Thanks to the SolarCal method from the Center for the Built Environment at UC Berkeley (http://escholarship.org/uc/item/89m1h2dg), the solar adjusted temperature component now includes an option for a much faster calculation that produces results that are very close to those originally obtained with the genCumSky component. Instead of using the cumulative sky, the component can now accept the direct and diffuse radiation from the ImportEPW component. Over a whole year, this essentially takes a calculation that used to be a half-hour and shrinks it down to 10 seconds. Thanks again to those at UC Berkeley for keeping their work open source! Instructions - Last but not the least, [It took me almost two years to understand this but finally] we have a text file that describes the installation step by step and is way easier to modify than a video. You can find it in the zip file. Credit goes to Chris! We also want to welcome Anton, Patrick and Sandeep to the team. Anton has kicked off his development by working on a component to import and visualize epw ground temperature data and he will be continuing to develop components to bring in reliable precipitation data to Ladybug. With this basis, he will continue to implement Honeybee components for ground heat storage, earth tubes, rain collection and hot water systems. Patrick and Sandeep are working on integration of Honeybee to Energy Performance Calculator. As always let us know your comments and suggestions. Enjoy!…; Added by Mostapha Sadeghipour Roudsari to Ladybug Tools at 7:55pm on February 3, 2015

Topic: Creating a Component with a variable number of output parameters: the data structure of the input. I'll create a component that aims to write all the GH_Paths inside the input data structure into separate output parameters. I'll add a menu item to the component that allows users to synch the number of outputs with the current data. Note that there are some bugs I found related to Undo here, but I'll attempt to fix those asap. The mechanisms employed in this example are correct. Let's start with the Component class definition and the constructor: Public Class GH_ExampleComponent_VarOutput Inherits GH_Component Public Sub New() MyBase.New("Extract Paths", "ExPath", "Extract all the paths from a tree", "Sets", "Tree") End Sub End Class Now, the RegisterXXXXParams methods: Protected Overrides Sub RegisterInputParams(ByVal pManager As GH_Component.GH_InputParamManager) pManager.Register_GenericParam("Tree", "T", "Data tree to examine", GH_ParamAccess.tree) End Sub Protected Overrides Sub RegisterOutputParams(ByVal pManager As GH_Component.GH_OutputParamManager) 'We'll add one output parameter, just to not have a jagged output. pManager.Register_PathParam("Path 1", "1", "1st path in tree") End Sub SolveInstance() is somewhat special, but not very complicated: Protected Overrides Sub SolveInstance(ByVal DA As IGH_DataAccess) 'We have only one input parameter and it is set to Tree, 'so SolveInstance will only be called once for every solution. 'We don't actually need the data inside the input, we're only interested in the paths. 'So we don't actually need to call DA.GetDataTree, we can just go in and extract the 'paths directly: Dim paths As IList(Of GH_Path) = Params.Input(0).VolatileData.Paths 'Abort if there is no tree. If (paths.Count = 0) Then Return 'Post a warning if the number of output parameters does not 'equal the number of paths in the tree. If (paths.Count < Params.Output.Count) Then AddRuntimeMessage(GH_RuntimeMessageLevel.Warning, "There are more outputs than paths in the tree.") ElseIf (paths.Count > Params.Output.Count) Then AddRuntimeMessage(GH_RuntimeMessageLevel.Warning, "There are fewer outputs than paths in the tree.") End If 'Iterate over all paths and assign to output parameters. For i As Int32 = 0 To Math.Min(Params.Output.Count, paths.Count) - 1 DA.SetData(i, paths(i)) Next End Sub Adding a menu item to the component menu is relatively straightforward, however handling the menu command requires a fair bit of logic: Protected Overrides Sub Menu_AppendCustomComponentItems(ByVal iMenu As System.Windows.Forms.ToolStripDropDown) 'Add a single item to the component menu. Menu_AppendGenericMenuItem(iMenu, "Synch outputs", AddressOf Menu_SynchOutputClicked) End Sub Private Sub Menu_SynchOutputClicked(ByVal sender As Object, ByVal e As EventArgs) 'Here we have to synch the number of output parameters with the number 'of paths in the volatile data tree in the input parameter. 'This requires a few steps: '1. Determine whether something needs to happen at all. '2. Record an undo event. '3. Remove excess outputs or add missing outputs. Dim paths As IList(Of GH_Path) = Params.Input(0).VolatileData.Paths If (paths.Count = Params.Output.Count) Then Return 'yay, nothing needs to be done. 'Something needs to be done, record an undo state. RecordUndoEvent("Synch output") 'We either have too few or too many outputs, determine which is the case. If (paths.Count > Params.Output.Count) Then 'Add the missing outputs For i As Int32 = Params.Output.Count + 1 To paths.Count Dim param As New Grasshopper.Kernel.Parameters.Param_GenericObject() param.Name = "Path " & i.ToString() param.NickName = i.ToString() If (i.ToString.EndsWith("1")) Then param.Description = i.ToString() & "st path in tree" ElseIf (i.ToString.EndsWith("2")) Then param.Description = i.ToString() & "nd path in tree" ElseIf (i.ToString.EndsWith("3")) Then param.Description = i.ToString() & "rd path in tree" Else param.Description = i.ToString() & "th path in tree" End If Params.RegisterOutputParam(param) Next Else 'Remove excessive outputs Do If (Params.Output.Count <= paths.Count) Then Exit Do Dim param As IGH_Param = Params.Output(Params.Output.Count - 1) Params.UnregisterOutputParameter(param) Loop End If Params.OnParametersChanged() ExpireSolution(True) End Sub Finally, we must make sure that the component properly (de)serializes. This means we have to override the Write and Read methods and add additional information to the GHX archive: Public Overrides Function Write(ByVal writer As GH_IO.Serialization.GH_IWriter) As Boolean 'We must make sure that the number of output parameters is correctly stored. 'We'll use a special function on the GH_ComponentParamServer to accompish this 'without too much sweat. Params.WriteParameterTypeData(writer) Return MyBase.Write(writer) End Function Public Overrides Function Read(ByVal reader As GH_IO.Serialization.GH_IReader) As Boolean 'Very important, we must make sure all parameters exist before we 'start with the main deserialization. Params.Clear() Params.ReadParameterTypeData(reader) Return MyBase.Read(reader) End Function I attached a VB file that contains the code outlined above. -- David Rutten david@mcneel.com Seattle, WA…; Added by David Rutten at 11:43pm on October 27, 2010

Comment on: Topic 'apply a pattern on a surface': me of course!So I'll try to be as clear as possible.I have two problems.The form we have is a shade. I would like to close the shape of the top so she cancling to a bulb socket. For this, I want to keep a planar surface (the same surface asthe top of the basic shape without distortion but reduced (scale)), then connect themodified form (with the attractors points) to this surface. However, it must be dividethis surface on triangle to succeed have flat surface (because the shade is made of paper and then cut out of planar sheets).I managed to do it but very complicated and non-automatic by taking each point oneby one through lists items.Do you know a way to do it automatically and it still works even if we increase the number of facets of the form?I also have a problem with attractors points to 2 different places, to distort the basic shape and create the holes. I could wish to create as many attractors points what I want in my program but it is limited.Do you think it is possible to group all attractors points in only component (point) to make this automatic?In my program, I have managed to use several (3) points attractors to distort the basic shape using dispatch order if I want attractors for example 24 points, I wouldcreate 24 pieces of program which is quite disturb!For holes, the problem IS exactly the same.Do you have any ideas? (If you have time). Thanks a lot.Ines …; Added by Ines at 3:05am on January 26, 2012