nts for Ladybug too. They are based on PVWatts v1 online calculator, supporting crystalline silicon fixed tilt photovoltaics.
You can download them from here, or use the Update Ladbybug component instead. If you take the first option, after downloading check if .ghuser files are blocked (right click -> "Properties" and select "Unblock").
You can download the example files from here.
Video tutorials will follow in the coming period.
In the very essence these components help you answer the question: "How much energy can my roof, building facade, solar parking... generate if I would populate them with PV panels"?
They allow definition of different types of losses (snow, age, shading...) which may affect your PV system:
And can find its optimal tilt and orientation:
Or analyse its performance, energy value, consumption, emissions...
By Djordje Spasic and Jason Sensibaugh, with invaluable support of Dr. Frank Vignola, Dr. Jason M. Keith, Paul Gilman, Chris Mackey, Mostapha Sadeghipour Roudsari, Niraj Palsule, Joseph Cunningham and Christopher Weiss.
Thank you for reading, and hope you will enjoy using the components!
EDIT: From march 27 2017, Ladybug Photovoltaics components support thin-film modules as well.
References:
1) System losses:
PVWatts v5 Manual, Dobos, NREL, 2014
2) Sun postion equations by Michalsky (1988):
SAM Photovoltaic Model Technical Reference, Gilman, NREL, 2014
edited by Jason Sensibaugh
3) Angle of incidence for fixed arrays:
PVWatts Version 1 Technical Reference, Dobos, NREL, 2013
4) Plane-of-Array diffuse irradiance by Perez 1990 algorithm:
PVPMC Sandia National Laboratories
SAM Photovoltaic Model Technical Reference, Gilman, NREL, 2014
5) Sandia PV Array Performance Module Cover:
PVWatts Version 1 Technical Reference, Dobos, NREL, 2013
6) Sandia Thermal Model, Module Temperature and Cell Temperature Models:
Photovoltaic Array Performance Model, King, Boys, Kratochvill, Sandia National Laboratories, 2004
7) CEC Module Model: Maximum power voltage and Maximum power current from:
Exact analytical solutions of the parameters of real solar cells using Lambert W-function, Jain, Kapoor, Solar Energy Materials and Solar Cells, V81 2004, P269–277
8) PVFORM version 3.3 adapted Module and Inverter Models:
PVWatts Version 1 Technical Reference, Dobos, NREL, 2013
9) Sunpath diagram shading:
Using sun path charts to estimate the effects of shading on PV arrays, Frank Vignola, University of Oregon, 2004
Instruction manual for the Solar Pathfinder, Solar Pathfinder TM, 2008
10) Tilt and orientation factor:
Application for Purchased Systems Oregon Department of Energy
solmetric.com
11) Photovoltaics performance metrics:
Solar PV system performance assessment guideline, Honda, Lechner, Raju, Tolich, Mokri, San Jose state university, 2012
CACHE Modules on Energy in the Curriculum Solar Energy, Keith, Palsule, Mississippi State University
Inventory of Carbon & Energy (ICE) Version 2.0, Hammond, Jones, SERT University of Bath, 2011
The Energy Return on Energy Investment (EROI) of Photovoltaics: Methodology and Comparisons with Fossil Fuel Life Cycles, Raugei, Fullana-i-Palmer, Fthenakis, Elsevier Vol 45, Jun 2012
12) Calculating albedo: Metenorm 6 Handbook part II: Theory, Meteotest 2007
13) Magnetic declination:
Geomag 0.9.2015, Christopher Weiss…
.
Things have been working swimmingly in many areas of the plugin, but one particular problem has been tough to solve. I have two components that are trying to read/write to the same memory at the same time, causing Rhino exceptions and crashes.
The conflicts appear to be happening between two components -- one is a "Layer Events Listener" that reports essentially what type of layer event just happened. The other is a "Set Layer Visibility" component that toggles the visibility of a list of layers.
The code:
public class LayerTools_LayerEventsListener : GH_Component { /// <summary> /// Initializes a new instance of the LayerTools_LayerListener class. /// </summary> public LayerTools_LayerEventsListener() : base("Layer Events Listener", "Layer Listener", "Get granular information about the layer events happening in the Rhino document.", "Squirrel", "Layer Tools") { }
/// <summary> /// Registers all the input parameters for this component. /// </summary> protected override void RegisterInputParams(GH_Component.GH_InputParamManager pManager) { pManager.AddBooleanParameter("Active", "A", "Set to true to listen to layer events in the Rhino document.", GH_ParamAccess.item, false); pManager.AddTextParameter("Exclusions", "E", "Provide a list of exclusions to stop reading specific events (Added, Deleted, Moved, Renamed, Locked, Visibility, Color, Active).", GH_ParamAccess.list); pManager[1].Optional = true; }
/// <summary> /// Registers all the output parameters for this component. /// </summary> protected override void RegisterOutputParams(GH_Component.GH_OutputParamManager pManager) { pManager.AddBooleanParameter("Initialized", "I", "Whether the listener changed from passive to active.", GH_ParamAccess.item); pManager.AddTextParameter("Document Name", "doc", "Name of the Rhino document that is changing.", GH_ParamAccess.item); pManager.AddTextParameter("Layer Path", "path", "Path of the modifed layer.", GH_ParamAccess.item); pManager.AddIntegerParameter("Layer Index", "ID", "Index of the modified layer.", GH_ParamAccess.item); pManager.AddIntegerParameter("Sort Index", "SID", "Sort index of the modified layer.", GH_ParamAccess.item); pManager.AddTextParameter("Event Type", "T", "Type of the modification.", GH_ParamAccess.item); pManager.AddBooleanParameter("Added", "A", "If the layer has been added.", GH_ParamAccess.item); pManager.AddBooleanParameter("Deleted", "D", "If the layer has been deleted.", GH_ParamAccess.item); pManager.AddBooleanParameter("Moved", "M", "If the layer has been moved.", GH_ParamAccess.item); pManager.AddBooleanParameter("Renamed", "R", "If the layer has been renamed.", GH_ParamAccess.item); pManager.AddBooleanParameter("Locked", "L", "If the layer locked setting has changed.", GH_ParamAccess.item); pManager.AddBooleanParameter("Visibility", "V", "If the layer's visibility has changed.", GH_ParamAccess.item); pManager.AddBooleanParameter("Color", "C", "If the layer's color has changed.", GH_ParamAccess.item); pManager.AddBooleanParameter("Active", "Act", "If the active layer has changed.", GH_ParamAccess.item); }
/// <summary> /// This is the method that actually does the work. /// </summary> /// <param name="DA">The DA object is used to retrieve from inputs and store in outputs.</param> protected override void SolveInstance(IGH_DataAccess DA) { bool active = false; List<string> exclusions = new List<string>();
DA.GetData(0, ref active); DA.GetDataList(1, exclusions);
RhinoDoc thisDoc = null;
bool initialize = false;
string dName = null; string activePath = null; int layerIndex = -1; int sortIndex = -1; string eventType = null; bool added = false; bool deleted = false; bool moved = false; bool renamed = false; bool locked = false; bool visibility = false; bool color = false; bool current = false;
if (active) { thisDoc = RhinoDoc.ActiveDoc;
initialize = (!previouslyActive) ? true : false;
RhinoDoc.LayerTableEvent -= RhinoDoc_LayerTableEvent; RhinoDoc.LayerTableEvent += RhinoDoc_LayerTableEvent; previouslyActive = true;
} else {
RhinoDoc.LayerTableEvent -= RhinoDoc_LayerTableEvent; previouslyActive = false; }
if (ev != null) { dName = ev.Document.Name; layerIndex = ev.LayerIndex; eventType = ev.EventType.ToString();
if (!exclusions.Contains("Active")) { if (ev.EventType.ToString() == "Current") { // active layer has just been changed current = true; }
}
if (!exclusions.Contains("Moved")) { if (ev.EventType.ToString() == "Sorted") { // active layer has just been changed moved = true; }
}
if (!exclusions.Contains("Added")) { if (ev.EventType.ToString() == "Added") { // layer has just been added activePath = ev.NewState.FullPath; added = true; }
}
if (!exclusions.Contains("Active")) { if (ev.EventType.ToString() == "Deleted") { // layer has just been added
deleted = true; } }
if (ev.EventType.ToString() == "Modified") { // layer has been modified activePath = ev.NewState.FullPath;
//skip sortindex eventType = ev.EventType.ToString();
if (ev.OldState != null && ev.NewState != null) { if (!exclusions.Contains("Locked")) { if (ev.OldState.IsLocked != ev.NewState.IsLocked) locked = true;
} if (!exclusions.Contains("Visibility")) { if (ev.OldState.IsVisible != ev.NewState.IsVisible) visibility = true; }
if (!exclusions.Contains("Moved")) { if (ev.OldState.ParentLayerId != ev.NewState.ParentLayerId) moved = true; }
//if (ev.OldState.SortIndex != ev.NewState.SortIndex) moved = true; if (!exclusions.Contains("Renamed")) { if (ev.OldState.Name != ev.NewState.Name) renamed = true; }
if (!exclusions.Contains("Color")) { if (ev.OldState.Color != ev.NewState.Color) color = true; } }
} }
DA.SetData(0, initialize); DA.SetData(1, dName); DA.SetData(2, activePath); DA.SetData(3, layerIndex); DA.SetData(4, sortIndex); DA.SetData(5, eventType); DA.SetData(6, added); DA.SetData(7, deleted); DA.SetData(8, moved); DA.SetData(9, renamed); DA.SetData(10, locked); DA.SetData(11, visibility); DA.SetData(12, color); DA.SetData(13, current);
}
static bool previouslyActive = false; Rhino.DocObjects.Tables.LayerTableEventArgs ev = null;
void RhinoDoc_LayerTableEvent(object sender, Rhino.DocObjects.Tables.LayerTableEventArgs e) { ev = e;this.ExpireSolution(true); }
And for the layer visibility component:
public LayerTools_SetActiveLayer() : base("Set Active Layer", "SetActiveLayer", "Set the active layer in the Rhino document.", "Squirrel", "Layer Tools") { }
/// <summary> /// Registers all the input parameters for this component. /// </summary> protected override void RegisterInputParams(GH_Component.GH_InputParamManager pManager) { pManager.AddBooleanParameter("Active", "A", "Set to true to change the active layer in Rhino.", GH_ParamAccess.item, false); pManager.AddTextParameter("Path", "P", "Full path of the layer to be activated.", GH_ParamAccess.item); }
/// <summary> /// Registers all the output parameters for this component. /// </summary> protected override void RegisterOutputParams(GH_Component.GH_OutputParamManager pManager) { pManager.AddIntegerParameter("Layer ID", "ID", "Index of layer that has been activated.", GH_ParamAccess.item); pManager.AddBooleanParameter("Status", "St", "True when the layer has been activated.", GH_ParamAccess.item); }
/// <summary> /// This is the method that actually does the work. /// </summary> /// <param name="DA">The DA object is used to retrieve from inputs and store in outputs.</param> protected override void SolveInstance(IGH_DataAccess DA) { bool active = false; string path = "";
if (!DA.GetData(0, ref active)) return; if (!DA.GetData(1, ref path)) return;
int layer_index = -1; bool status = false;
if (path != null) {
Rhino.RhinoDoc doc = Rhino.RhinoDoc.ActiveDoc; Rhino.DocObjects.Tables.LayerTable layertable = doc.Layers;
layer_index = layertable.FindByFullPath(path, true);
if (layer_index > 0) { // if exists RhinoDoc.ActiveDoc.Layers.SetCurrentLayerIndex(layer_index, true); status = true; } }
DA.SetData(0, layer_index); DA.SetData(1, status); }
Now originally I was getting exceptions when changing multiple layers' visibility properties, which would cause the Event Listener to fire and try to read the Visibility property before the memory has been released by the Set Layer Visibility component. That led me to add an "Exceptions" input, that would allow me to disable the reading of Visibility events at the source in the Layer Events listener. That helped me manage about 95% of the crashes I was getting, but I still get strange crashes in other event properties, even when that property shouldn't be affected. For instance, I am getting a crash here on the Name property in the event from the delegate function, even though I am only changing Visibility at any one time:
I have a few ideas but they all seem pretty hacky. One is to try to set a flag that is readable by any component in the plugin -- so that the event listener can see if a "set" component is currently running and abort before causing an exception. The other is creating a delay in the event listener, somthing like 200ms, to allow any set components to finish what they are doing before reading the event. Neither seems super ideal.
Any ideas?
Thanks,
Marc
…
t file** - ply file with just x,y,z locations. I got it from a 3d scanner. Here is how first few lines of file looks like - ply format ascii 1.0 comment VCGLIB generated element vertex 6183 property float x property float y property float z end_header -32.3271 -43.9859 11.5124 -32.0631 -43.983 11.4945 12.9266 -44.4913 28.2031 13.1701 -44.4918 28.2568 13.4138 -44.4892 28.2531 13.6581 -44.4834 28.1941 13.9012 -44.4851 28.2684 ... ... ... In case you need the data - please email me on **nisha.m234@gmail.com**. **Algorithm:** I am trying to find principal curvatures for extracting the ridges and valleys. The steps I am following is: 1. Take a point x 2. Find its k nearest neighbors. I used k from 3 to 20. 3. average the k nearest neighbors => gives (_x, _y, _z) 4. compute covariance matrix 5. Now I take eigen values and eigen vectors of this covariance matrix 6. I get u, v and n here from eigen vectors. u is a vector corresponding to largest eigen value v corresponding to 2nd largest n is 3rd smallest vector corresponding to smallest eigen value 7. Then for transforming the point(x,y,z) I compute matrix T T = [ui ] [u ] [x - _x] [vi ] = [v ] x [y - _y] [ni ] [n ] [z - _z] 8. for each i of the k nearest neighbors:<br> [ n1 ] [u1*u1 u1*v1 v1*v1] [ a ]<br> [ n2 ] = [u2*u2 u2*v2 v2*v2] [ b ] <br> [... ] [ ... ... ... ] [ c ] <br> [ nk ] [uk*uk uk*vk vk*vk]<br> Solve this for a, b and c with least squares 9. this equations will give me a,b,c 10. now I compute eigen values of matrix [a b b a ] 11. This will give me 2 eigen values. one is Kmin and another Kmax. **My Problem:** The output is no where close to finding the correct Ridges and Valleys. I am totally Stuck and frustrated. I am not sure where exactly I am getting it wrong. I think the normal's are not computed correctly. But I am not sure. I am very new to graphics programming and so this maths, normals, shaders go way above my head. Any help will be appreciated. **PLEASE PLEASE HELP!!** **Resources:** I am using Visual Studio 2010 + Eigen Library + ANN Library. **Other Options used** I tried using MeshLab. I used ball pivoting triangles remeshing in MeshLab and then applied the polkadot3d shader. If correctly identifies the ridges and valleys. But I am not able to code it. **My Function:** //the function outputs to ply file void getEigen() { int nPts; // actual number of data points ANNpointArray dataPts; // data points ANNpoint queryPt; // query point ANNidxArray nnIdx;// near neighbor indices ANNdistArray dists; // near neighbor distances ANNkd_tree* kdTree; // search structure //for k = 25 and esp = 2, seems to got few ridges queryPt = annAllocPt(dim); // allocate query point dataPts = annAllocPts(maxPts, dim); // allocate data points nnIdx = new ANNidx[k]; // allocate near neigh indices dists = new ANNdist[k]; // allocate near neighbor dists nPts = 0; // read data points ifstream dataStream; dataStream.open(inputFile, ios::in);// open data file dataIn = &dataStream; ifstream queryStream; queryStream.open("input/query.
pts", ios::in);// open data file queryIn = &queryStream; while (nPts < maxPts && readPt(*dataIn, dataPts[nPts])) nPts++; kdTree = new ANNkd_tree( // build search structure dataPts, // the data points nPts, // number of points dim); // dimension of space while (readPt(*queryIn, queryPt)) // read query points { kdTree->annkSearch( // search queryPt, // query point k, // number of near neighbors nnIdx, // nearest neighbors (returned) dists, // distance (returned) eps); // error bound double x = queryPt[0]; double y = queryPt[1]; double z = queryPt[2]; double _x = 0.0; double _y = 0.0; double _z = 0.0; #pragma region Compute covariance matrix for (int i = 0; i < k; i++) { _x += dataPts[nnIdx[i]][0]; _y += dataPts[nnIdx[i]][1]; _z += dataPts[nnIdx[i]][2]; } _x = _x/k; _y = _y/k; _z = _z/k; double A[3][3] = {0,0,0,0,0,0,0,0,0}; for (int i = 0; i < k; i++) { double X = dataPts[nnIdx[i]][0]; double Y = dataPts[nnIdx[i]][1]; double Z = dataPts[nnIdx[i]][2]; A[0][0] += (X-_x) * (X-_x); A[0][1] += (X-_x) * (Y-_y); A[0][2] += (X-_x) * (Z-_z); A[1][0] += (Y-_y) * (X-_x); A[1][1] += (Y-_y) * (Y-_y); A[1][2] += (Y-_y) * (Z-_z); A[2][0] += (Z-_z) * (X-_x); A[2][1] += (Z-_z) * (Y-_y); A[2][2] += (Z-_z) * (Z-_z); } MatrixXd C(3,3); C <<A[0][0]/k, A[0][1]/k, A[0][2]/k, A[1][0]/k, A[1][1]/k, A[1][2]/k, A[2][0]/k, A[2][1]/k, A[2][2]/k; #pragma endregion EigenSolver<MatrixXd> es(C); MatrixXd Eval = es.eigenvalues().real().asDiagonal(); MatrixXd Evec = es.eigenvectors().real(); MatrixXd u,v,n; double a = Eval.row(0).col(0).value(); double b = Eval.row(1).col(1).value(); double c = Eval.row(2).col(2).value(); #pragma region SET U V N if(a>b && a>c) { u = Evec.row(0); if(b>c) { v = Eval.row(1); n = Eval.row(2);} else { v = Eval.row(2); n = Eval.row(1);} } else if(b>a && b>c) { u = Evec.row(1); if(a>c) { v = Eval.row(0); n = Eval.row(2);} else { v = Eval.row(2); n = Eval.row(0);} } else { u = Eval.row(2); if(a>b) { v = Eval.row(0); n = Eval.row(1);} else { v = Eval.row(1); n = Eval.row(0);} } #pragma endregion MatrixXd O(3,3); O <<u, v, n; MatrixXd UV(k,3); VectorXd N(k,1); for( int i=0; i<k; i++) { double x = dataPts[nnIdx[i]][0];; double y = dataPts[nnIdx[i]][1];; double z = dataPts[nnIdx[i]][2];; MatrixXd X(3,1); X << x-_x, y-_y, z-_z; MatrixXd T = O * X; double ui = T.row(0).col(0).value(); double vi = T.row(1).col(0).value(); double ni = T.row(2).col(0).value(); UV.row(i) << ui * ui, ui * vi, vi * vi; N.row(i) << ni; } Vector3d S = UV.colPivHouseholderQr().solve(N); MatrixXd II(2,2); II << S.row(0).value(), S.row(1).value(), S.row(1).value(), S.row(2).value(); EigenSolver<MatrixXd> es2(II); MatrixXd Eval2 = es2.eigenvalues().real().asDiagonal(); MatrixXd Evec2 = es2.eigenvectors().real(); double kmin, kmax; if(Eval2.row(0).col(0).value() < Eval2.row(1).col(1).value()) { kmin = Eval2.row(0).col(0).value(); kmax = Eval2.row(1).col(1).value(); } else { kmax = Eval2.row(0).col(0).value(); kmin = Eval2.row(1).col(1).value(); } double thresh = 0.0020078; if (kmin < thresh && kmax > thresh ) cout << x << " " << y << " " << z << " " << 255 << " " << 0 << " " << 0 << endl; else cout << x << " " << y << " " << z << " " << 255 << " " << 255 << " " << 255 << endl; } delete [] nnIdx; delete [] dists; delete kdTree; annClose(); } Thanks, NISHA…
ng is deciding how and where to store your data. If you're writing textual code using any one of a huge number of programming languages there are a lot of different options, each with its own benefits and drawbacks. Sometimes you just need to store a single data point. At other times you may need a list of exactly one hundred data points. At other times still circumstances may demand a list of a variable number of data points.
In programming jargon, lists and arrays are typically used to store an ordered collection of data points, where each item is directly accessible. Bags and hash sets are examples of unordered data storage. These storage mechanisms do not have a concept of which data comes first and which next, but they are much better at searching the data set for specific values. Stacks and queues are ordered data structures where only the youngest or oldest data points are accessible respectively. These are popular structures for code designed to create and execute schedules. Linked lists are chains of consecutive data points, where each point knows only about its direct neighbours. As a result, it's a lot of work to find the one-millionth point in a linked list, but it's incredibly efficient to insert or remove points from the middle of the chain. Dictionaries store data in the form of key-value pairs, allowing one to index complicated data points using simple lookup codes.
The above is a just a small sampling of popular data storage mechanisms, there are many, many others. From multidimensional arrays to SQL databases. From readonly collections to concurrent k-dTrees. It takes a fair amount of knowledge and practice to be able to navigate this bewildering sea of options and pick the best suited storage mechanism for any particular problem. We did not wish to confront our users with this plethora of programmatic principles, and instead decided to offer only a single data storage mechanism.*
Data storage in Grasshopper
In order to see what mechanism would be optimal for Grasshopper, it is necessary to first list the different possible ways in which components may wish to access and store data, and also how families of data points flow through a Grasshopper network, often acquiring more complexity over time.
A lot of components operate on individual values and also output individual values as results. This is the simplest category, let's call it 1:1 (pronounced as "one to one", indicating a mapping from single inputs to single outputs). Two examples of 1:1 components are Subtraction and Construct Point. Subtraction takes two arguments on the left (A and B), and outputs the difference (A-B) to the right. Even when the component is called upon to calculate the difference between two collections of 12 million values each, at any one time it only cares about three values; A, B and the difference between the two. Similarly, Construct Point takes three separate numbers as input arguments and combines them to form a single xyz point.
Another common category of components create lists of data from single input values. We'll refer to these components as 1:N. Range and Divide Curve are oft used examples in this category. Range takes a single numeric domain and a single integer, but it outputs a list of numbers that divide the domain into the specified number of steps. Similarly, Divide Curve requires a single curve and a division count, but it outputs several lists of data, where the length of each list is a function of the division count.
The opposite behaviour also occurs. Common N:1 components are Polyline and Loft, both of which consume a list of points and curves respectively, yet output only a single curve or surface.
Lastly (in the list category), N:N components are also available. A fair number of components operate on lists of data and also output lists of data. Sort and Reverse List are examples of N:N components you will almost certainly encounter when using Grasshopper. It is true that N:N components mostly fall into the data management category, in the sense that they are mostly employed to change the way data is stored, rather than to create entirely new data, but they are common and important nonetheless.
A rare few components are even more complex than 1:N, N:1, or N:N, in that they are not content to operate on or output single lists of data points. The Divide Surface and Square Grid components want to output not just lists of points, but several lists of points, each of which represents a single row or column in a grid. We can refer to these components as 1:N' or N':1 or N:N' or ... depending on how the inputs and outputs are defined.
The above listing of data mapping categories encapsulate all components that ship with Grasshopper, though they do not necessarily minister to all imaginable mappings. However in the spirit of getting on with the software it was decided that a data structure that could handle individual values, lists of values, and lists of lists of values would solve at least 99% of the then existing problems and was thus considered to be a 'good thing'.
Data storage as the outcome of a process
If the problems of 1:N' mappings only occurred in those few components to do with grids, it would probably not warrant support for lists-of-lists in the core data structure. However, 1:N' or N:N' mappings can be the result of the concatenation of two or more 1:N components. Consider the following case: A collection of three polysurfaces (a box, a capped cylinder, and a triangular prism) is imported from Rhino into Grasshopper. The shapes are all exploded into their separate faces, resulting in 6 faces for the box, 3 for the cylinder, and 5 for the prism. Across each face, a collection of isocurves is drawn, resembling a hatching. Ultimately, each isocurve is divided into equally spaced points.
This is not an unreasonably elaborate case, but it already shows how shockingly quickly layers of complexity are introduced into the data as it flows from the left to the right side of the network.
It's no good ending up with a single huge list containing all the points. The data structure we use must be detailed enough to allow us to select from it any logical subset. This means that the ultimate data structure must contain a record of all the mappings that were applied from start to finish. It must be possible to select all the points that are associated with the second polysurface, but not the first or third. It must also be possible to select all points that are associated with the first face of each polysurface, but not any subsequent faces. Or a selection which includes only the fourth point of each division and no others.
The only way such selection sets can be defined, is if the data structure contains a record of the "history" of each data point. I.e. for every point we must be able to figure out which original shape it came from (the cube, the cylinder or the prism), which of the exploded faces it is associated with, which isocurve on that face was involved and the index of the point within the curve division family.
A flexible mechanism for variable history records.
The storage constraints mentioned so far (to wit, the requirement of storing individual values, lists of values, and lists of lists of values), combined with the relational constraints (to wit, the ability to measure the relatedness of various lists within the entire collection) lead us to Data Trees. The data structure we chose is certainly not the only imaginable solution to this problem, and due to its terse notation can appear fairly obtuse to the untrained eye. However since data trees only employ non-negative integers to identify both lists and items within lists, the structure is very amenable to simple arithmetic operations, which makes the structure very pliable from an algorithmic point of view.
A data tree is an ordered collection of lists. Each list is associated with a path, which serves as the identifier of that list. This means that two lists in the same tree cannot have the same path. A path is a collection of one or more non-negative integers. Path notation employs curly brackets and semi-colons as separators. The simplest path contains only the number zero and is written as: {0}. More complicated paths containing more elements are written as: {2;4;6}. Just as a path identifies a list within the tree, an index identifies a data point within a list. An index is always a single, non-negative integer. Indices are written inside square brackets and appended to path notation, in order to fully identify a single piece of data within an entire data tree: {2,4,6}[10].
Since both path elements and indices are zero-based (we start counting at zero, not one), there is a slight disconnect between the ordinality and the cardinality of numbers within data trees. The first element equals index 0, the second element can be found at index 1, the third element maps to index 2, and so on and so forth. This means that the "Eleventh point of the seventh isocurve of the fifth face of the third polysurface" will be written as {2;4;6}[10]. The first path element corresponds with the oldest mapping that occurred within the file, and each subsequent element represents a more recent operation. In this sense the path elements can be likened to taxonomic identifiers. The species {Animalia;Mammalia;Hominidea;Homo} and {Animalia;Mammalia;Hominidea;Pan} are more closely related to each other than to {Animalia;Mammalia; Cervidea;Rangifer}** because they share more codes at the start of their classification. Similarly, the paths {2;4;4} and {2;4;6} are more closely related to each other than they are to {2;3;5}.
The messy reality of data trees.
Although you may agree with me that in theory the data tree approach is solid, you may still get frustrated at the rate at which data trees grow more complex. Often Grasshopper will choose to add additional elements to the paths in a tree where none in fact is needed, resulting in paths that all share a lot of zeroes in certain places. For example a data tree might contain the paths:
{0;0;0;0;0}
{0;0;0;0;1}
{0;0;0;0;2}
{0;0;0;0;3}
{0;0;1;0;0}
{0;0;1;0;1}
{0;0;1;0;2}
{0;0;1;0;3}
instead of the far more economical:
{0;0}
{0;1}
{0;2}
{0;3}
{1;0}
{1;1}
{1;2}
{1;3}
The reason all these zeroes are added is because we value consistency over economics. It doesn't matter whether a component actually outputs more than one list, if the component belongs to the 1:N, 1:N', or N:N' groups, it will always add an extra integer to all the paths, because some day in the future, when the inputs change, it may need that extra integer to keep its lists untangled. We feel it's bad behaviour for the topology of a data tree to be subject to the topical values in that tree. Any component which relies on a specific topology will no longer work when that topology changes, and that should happen as seldom as possible.
Conclusion
Although data trees can be difficult to work with and probably cause more confusion than any other part of Grasshopper, they seem to work well in the majority of cases and we haven't been able to come up with a better solution. That's not to say we never will, but data trees are here to stay for the foreseeable future.
* This is not something we hit on immediately. The very first versions of Grasshopper only allowed for the storage of a single data point per parameter, making operations like [Loft] or [Divide Curve] impossible. Later versions allowed for a single list per parameter, which was still insufficient for all but the most simple algorithms.
** I'm skipping a lot of taxonometric classifications here to keep it simple.…
Added by David Rutten at 2:22pm on January 20, 2015
1 JUN to 31 DECBetween hours 1:00 to 24:00Current document units is in MetersConversion to Meters will be applied = 1.000[1 of 7] Writing simulation parameters...Ground temperature data contains monthly average temperatures at 3 different depths .5 meters (1st)2 meters (2nd)4meters (3rd)respectively[2 of 6] No context surfaces...[3 of 6] Writing geometry...[4 of 6] Writing materials and constructions...[5 of 7] Writing schedules...[6 of 7] Writing loads and ideal air system...[7 of 7] Writing outputs......... idf file is successfully written to : c:\ladybug\unnamed\EnergyPlus\unnamed.idf
Analysis is running!...c:\ladybug\unnamed\EnergyPlus\eplusout.csv......
Done! Read below for errors and warnings:
Program Version,EnergyPlus, Version 8.3.0-6d97d074ea, YMD=2015.05.24 11:32,IDD_Version 8.3.0
** Warning ** IP: Note -- Some missing fields have been filled with defaults. See the audit output file for details.
** Warning ** Version: in IDF="'8.1.0'" not the same as expected="8.3"
************* Beginning Zone Sizing Calculations
** Severe ** GetSurfaceData: Some Outward Facing angles of subsurfaces differ significantly from base surface.
** ~~~ ** ...use Output:Diagnostics,DisplayExtraWarnings; to show more details on individual surfaces.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=AW0 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=AW0 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=AW0 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=AW0 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=AW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=AW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=AW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=AW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=AW2 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=AW2 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=AW2 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=AW2 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=AW3 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=AW3 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=EW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=EW1 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=GLZ_0_EW1_1F6383543B434F648813 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=0.9038)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=GLZ_0_EW1_1F6383543B434F648813 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=0.9038)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=GLZ_0_EW1_1F6383543B434F648813 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=16.0967)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=GLZ_0_EW1_1F6383543B434F648813 is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=16.0967)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 6 of back surface=FLOOR is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 7 of back surface=FLOOR is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 8 of back surface=FLOOR is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 9 of back surface=FLOOR is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 5 of back surface=CIELING is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 6 of back surface=CIELING is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=17.1101)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 7 of back surface=CIELING is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 8 of back surface=CIELING is in front of receiving surface=EW0
** ~~~ ** (Dot Product indicator=30.0900)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=AW6 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=AW6 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=WALLW1 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=WALLW1 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=WALLW1 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=WALLW1 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=GLZ_0_WALLW1_103854D39BEF453D8A4E is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=GLZ_0_WALLW1_103854D39BEF453D8A4E is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=GLZ_0_WALLW1_103854D39BEF453D8A4E is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=GLZ_0_WALLW1_103854D39BEF453D8A4E is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=EW0 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=EW0 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=GLZ_0_EW0_6AEDE94222384E5B8950 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=1.4709)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=GLZ_0_EW0_6AEDE94222384E5B8950 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=1.4709)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=GLZ_0_EW0_6AEDE94222384E5B8950 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=15.6696)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 4 of back surface=GLZ_0_EW0_6AEDE94222384E5B8950 is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=15.6696)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 1 of back surface=FLOOR is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=FLOOR is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 2 of back surface=CIELING is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Severe ** Problem in interior solar distribution calculation (CHKBKS)
** ~~~ ** Solar Distribution = FullInteriorExterior will not work in Zone="APRATMENT1"
** ~~~ ** because vertex 3 of back surface=CIELING is in front of receiving surface=EW1
** ~~~ ** (Dot Product indicator=17.0963)
** ~~~ ** Check surface geometry; if OK, use Solar Distribution = FullExterior instead.
** Warning ** ManageSizing: For a plant sizing run, there must be at least 1 Sizing:Plant object input. SimulationControl Plant Sizing option ignored.
************* Testing Individual Branch Integrity
************* All Branches passed integrity testing
************* Testing Individual Supply Air Path Integrity
************* All Supply Air Paths passed integrity testing
************* Testing Individual Return Air Path Integrity
************* All Return Air Paths passed integrity testing
************* No node connection errors were found.
************* Beginning Simulation
************* Simulation Error Summary *************
** Warning ** The following Report Variables were requested but not generated
** ~~~ ** because IDF did not contain these elements or misspelled variable name -- check .rdd file
************* Key=*, VarName=ZONE PACKAGED TERMINAL HEAT PUMP TOTAL COOLING ENERGY, Frequency=Hourly
************* Key=*, VarName=ZONE PACKAGED TERMINAL HEAT PUMP TOTAL HEATING ENERGY, Frequency=Hourly
************* Key=*, VarName=CHILLER ELECTRIC ENERGY, Frequency=Hourly
************* Key=*, VarName=BOILER HEATING ENERGY, Frequency=Hourly
************* Key=*, VarName=FAN ELECTRIC ENERGY, Frequency=Hourly
************* Key=*, VarName=ZONE VENTILATION FAN ELECTRIC ENERGY, Frequency=Hourly
************* Key=*, VarName=ZONE VENTILATION TOTAL HEAT LOSS ENERGY, Frequency=Hourly
************* Key=*, VarName=ZONE VENTILATION TOTAL HEAT GAIN ENERGY, Frequency=Hourly
************* There are 1 unused schedules in input.
************* There are 1 unused week schedules in input.
************* There are 3 unused day schedules in input.
************* Use Output:Diagnostics,DisplayUnusedSchedules; to see them.
************* EnergyPlus Warmup Error Summary. During Warmup: 0 Warning; 0 Severe Errors.
************* EnergyPlus Sizing Error Summary. During Sizing: 1 Warning; 49 Severe Errors.
************* EnergyPlus Completed Successfully-- 4 Warning; 49 Severe Errors; Elapsed Time=00hr 00min 4.59sec
Thanks Abraham.I really appreciate it.
Another thing ' I posted a discussion few days ago and got no replies.And this forum is the only 'Hope' for me..Can you quickly check it?thanks.
N
http://www.grasshopper3d.com/group/ladybug/forum/topics/free-form-external-wall-with-glazing-workflow?xg_source=activity
…
rring to the above image)
Area
effective
effective
Second
Elastic
Elastic
Plastic
Radius
Second
Elastic
Plastic
Radius
of
Vy shear
Vz shear
Moment
Modulus
Modulus
Modulus
of
Moment
Modulus
Modulus
of
Section
Area
Area
of Area
upper
lower
Gyration
of Area
Gyration
(strong axis)
(strong axis)
(strong axis)
(strong axis)
(strong axis)
(weak axis)
(weak axis)
(weak axis)
(weak axis)
A
Ay
Az
Iy
Wy
Wy
Wply
i_y
Iz
Wz
Wplz
i_z
cm2
cm2
cm2
cm4
cm3
cm3
cm3
cm
cm4
cm3
cm3
cm
I have a very similar table which I could import to the Karamba table. But I have i_v or i_u values as well as radius of inertia for instance.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
dimensjon
Masse
Areal
akse
Ix
Wpx
ix
akse
Iy
Wpy
iy
akse
Iv
Wpv
iv
Width
Thickness
Radius R
[kg/m]
[mm2]
[mm4]
[mm3]
[mm]
[mm4]
[mm3]
[mm]
[mm4]
[mm3]
[mm]
[mm]
[mm]
[mm]
L 20x3
0.89
113
x-x
4,000
290
5.9
y-y
4,000
290
5.9
v-v
1,700
200
3.9
20
3
4
L 20x4
1.15
146
x-x
5,000
360
5.8
y-y
5,000
360
5.8
v-v
2,200
240
3.8
20
4
4
L 25x3
1.12
143
x-x
8,200
460
7.6
y-y
8,200
460
7.6
v-v
3,400
330
4.9
25
3
4
L 25x4
1.46
186
x-x
10,300
590
7.4
y-y
10,300
590
7.4
v-v
4,300
400
4.8
25
4
4
L 30x3
1.37
175
x-x
14,600
680
9.1
y-y
14,600
680
9.1
v-v
6,100
510
5.9
30
3
5
L 30x4
1.79
228
x-x
18,400
870
9.0
y-y
18,400
870
9.0
v-v
7,700
620
5.8
30
4
5
L 36x3
1.66
211
x-x
25,800
990
11.1
y-y
25,800
990
11.1
v-v
10,700
760
7.1
36
3
5
L 36x4
2.16
276
x-x
32,900
1,280
10.9
y-y
32,900
1,280
10.9
v-v
13,700
930
7.0
36
4
5
L 36x5
2.65
338
x-x
39,500
1,560
10.8
y-y
39,500
1,560
10.8
v-v
16,500
1,090
7.0
36
5
5
I have diagonals (bracings) which can buckle in these "non-regular" directions too, and they do. If I could add those values then in the Karamba model I could assign specific buckling scenarios..... I can see another challenge which will be at the ModifyElement component, I will not be able to choose these buckling lengths, in these directions.
Do you think this functionality can be added within short, or should I try to find another way to model these members?
Br, Balazs
…