Search Results - 小米速7软件下载【38883.top】rZgko.html

Topic: Sort Faces according to normals: onstruct the Brep to understand which faces are planar which aren't. 2. I get the normal vector of each planar faces. 3. I deconstruct N into its component parts, 4. I put them on absolute values because i need to sort them by their parallelism in space not their actual side. 5. I merge the values together and create a set of only unique elements. 6. Partition the list by the third of its length 7. Flip matrix and concatenate the 3 values to get the unique code of their parallelism. 8. After, with another create set and a sift component i can sort them according to their N or -N direction. The problem is that i don't want to use a sift pattern because it's not a very parametric way to get data; With it I have to manually change its number of outputs, I need a component that gives me x number of lists of surfaces parallel to one another. Like a "dispatch multiple component" but only with one ouput ? Also I'm thinking that this code could be much clever if there's a tolerance parameter to put similar surfaces into the same lists even if their not perfectly parallel one to another Thanks in advance for your help and your time. …; Added by Nenov Ivo at 10:27am on May 7, 2017

Event: Co-de-iT - Conditional Proliferations – GH Workshop - Roma: dello spazio. In dipendenza dal proprio modo di interazione ambientale, gli edifici possono essere distrubuiti e/o aggregati in modalità appropriate in modo da accumulare o disperdere gli effetti della loro interazione e il proprio impatto sull'evoluzione delle relazioni future. A livelli più bassi si può, ad esempio, considerare la distribuzione di componenti o caratteristiche lungo un involucro. Approcci basati su unità funzionali operano una proliferazione basata sulla ripetizione indifferenziata e insensibile all'ambiente, risultando in una discretizzazione di matrice convenzionale e nella separazione tra edifici, edifici e contesto o spazi interni ed esterni; un diverso tipo di approccio, basato sulla condizione (termine usato nella sua doppia accezione di indicatore dinamico della tendenza di sviluppo dell'ecosistema e in quella causale – if a then b), introduce una forma di proliferazione che sfida e scioglie la dicotomia artificiale: molte piante crescono ovunque le condizioni portino ad esse beneficio, senza riguardo per limiti codificati nello spazio in cui si sviluppano. Le implicazioni sulla negoziazione dello spazio e sulla definizione di soglia sono notevoli; il sistema produce un campo armonicamente articolato e differenziato di fenotipi a partire dal genotipo attraverso un processo di "estetica delle forze" guidata attraverso lo strumento digitale. A livello urbano questo può tradursi nella proliferazione di infrastrutture o di spazi che mettono in discussione la concezione statica di "confine" e "unità" in favore di modelli in grado di generare una gamma più estesa di inflessioni tra livelli di complessità e indirizzarli per abilitare e rendere accessibili potenzialità d'uso a loro volta articolate e complesse. Il tema sarà dipanato attraverso le giornate del workshop sviluppando aspetti teorici e tecnici dell'approccio parametrico generativo, con particolare attenzione a strategie di design urbano basate su caratteristiche endogene (vincoli interni del sistema) ed esogene (fattori ambientali) allo scopo di stimolare l'esplorazione di soluzioni sistemiche innovative. Il numero dei partecipanti è stabilito tra le 15 e le 20 persone per offrire un tutoraggio proficuo ed una effettiva esperienza di learning ad ogni iscritto. [.] Temi . teoria . condizione, genotipo/fenotipi, transizione, mappatura, eleganza, sensibilità, spazio . tecnica . dati:gestione, manipolazione, visualizzazione . generazione di geometria da dati . logiche parametriche applicate al design . genotipo/fenotipi . attrattori, mappers, drivers e tecniche di modulazione [.] Dettagli Istruttori: Alessio Erioli + Andrea Graziano + Davide Del Giudice – Co-de-iT (GH & design tutors). Si richiede esperienza di base nella modellazione in Rhino (equivalente a Rhino training Level 1, il Level 2 è gradito – la documentazione per il training è disponibile gratuitamente all'indirizzo: http://download.rhino3d.com/download.asp?id=Rhino4Training&language=it). Luogo : presso NETFORM – via Alessandro Cialdi 7, Roma Orario : 9.00-18.00. info: info@a-m-u-r-i.it Phone: +39 338 4201162 iscrizioni: http://www.cesarch.it/…; Added by Andrea Graziano at 1:27am on May 7, 2010

Comment on: Topic 'path mapper help': ems in the same way. Lofting was particularly difficult, you had to have a separate loft component for every lofted surface that you wanted to generate because the component would/could only see one large list of inputs. Then came along the data structures in GH v0.6 which allowed for the segregation of multiple input sets. If you go to Section 8: The Garden of Forking Paths of the Grasshopper Primer 2nd Edition you will find the image above describing the storing of data. Here you will notice a similarity between the path {0;0;0;0}(N=6) and the pathmapper Mask {A;B;C;D}(i). A is a placeholder for all of the first Branch structures (in this case just 0). B is a place holder for all the second branch structures possibly either 0, 1 or 2 in this case. And so forth. (i) is a place holder for the index of N. If you think of it like a for loop the i plays the same role. For the example {A;B;C;D}(i) --> {i\3} {0;0;0;0}(0) --> {0\3} = {0} {0;0;0;0}(1) --> {1\3} = {0} {0;0;0;0}(2) --> {2\3} = {0} {0;0;0;0}(3) --> {3\3} = {1} {0;0;0;0}(4) --> {4\3} = {1} {0;0;0;0}(5) --> {5\3} = {1} {0;0;0;1}(0) --> {0\3} = {0} {0;0;0;1}(1) --> {1\3} = {0} {0;0;0;1}(2) --> {2\3} = {0} {0;0;0;1}(3) --> {3\3} = {1} {0;0;0;1}(4) --> {4\3} = {1} {0;0;0;1}(5) --> {5\3} = {1} {0;0;0;1}(6) --> {6\3} = {2} {0;0;0;1}(7) --> {7\3} = {2} {0;0;0;1}(8) --> {8\3} = {2} ... {0;2;1;1}(8) --> {8\3} = {2} I'm not entirely sure why you want to do this particular exercise but it goes some way towards describing the process. The reason for the tidy up: every time the data stream passes through a component that influences the path structure it adds a branch. This can get very unwieldy if you let it go to far. some times I've ended up with structures like {0;0;1;0;0;0;3;0;0;0;14}(N=1) and by remapping the structure to {A;B;C} you get {0;0;1}(N=15) and is much neater to deal with. If you ever need to see what the structure is there is a component called Param Viewer on the first Tab Param>Special Icon is a tree. It has two modes text and visual double click to switch between the two. Have a look at this example of three scenarios in three situations to see how the data structure changes depending on what components are doing. …; Added by Danny Boyes at 3:03am on April 7, 2011

Comment on: Topic 'replace information in string': er(s); sb[7] = 'p'; s = sb.ToString(); …; Added by Chris Walsh at 7:57am on May 6, 2011

Comment on: Topic 'How to Marshal a variable sized array of ON_3dPoint to C#': _1 = resZ+1; /*if((resX_1)*(resY_1)*(resZ_1) != sizeof(data) / sizeof(data[0])) { *outNum = 0; return NULL; }*/ int sliceXY = (resX_1)*(resY_1); double intervalX = 1.0/resX; double intervalY = 1.0/resY; double intervalZ = 1.0/resZ; ON_BoundingBox box = ON_BoundingBox(*minCorner,*maxCorner); ON_Box refBox = ON_Box(box); //Get corners of a single voxel ON_3dPoint corners[8]; corners[0] = refBox.PointAt(0.0,0.0,0.0); corners[1] = refBox.PointAt(intervalX,0.0,0.0); corners[2] = refBox.PointAt(intervalX,intervalY,0.0); corners[3] = refBox.PointAt(0.0,intervalY,0.0); corners[4] = refBox.PointAt(0.0,0.0,intervalZ); corners[5] = refBox.PointAt(intervalX,0.0,intervalZ); corners[6] = refBox.PointAt(intervalX,intervalY,intervalZ); corners[7] = refBox.PointAt(0.0,intervalY,intervalZ); double d[8]; ON_3dPoint intersectionPoints[16]; int minCornerIndex= 0; vector<ON_3dPoint> pts; for (int z = 0; z < resZ; z++) { for (int y = 0; y < resY; y++) { for (int x = 0; x < resX; x++) { minCornerIndex = z * sliceXY + y * resX_1 + x; d[0] = data[minCornerIndex]; d[1] = data[minCornerIndex + 1]; d[2] = data[minCornerIndex + 1 + resX_1]; d[3] = data[minCornerIndex + resX_1]; d[4] = data[minCornerIndex + sliceXY]; d[5] = data[minCornerIndex + 1 + sliceXY]; d[6] = data[minCornerIndex + 1 + resX_1 + sliceXY]; d[7] = data[minCornerIndex + resX_1 + sliceXY]; ON_3dVector translate = refBox.PointAt(x * intervalX, y * intervalY, z * intervalZ) - corners[0]; int num = VoxelBox::GetFaces(corners, d, iso, intersectionPoints); if (num > 0) { for (int i = 0; i < num; i += 3) { pts.push_back(ON_3dPoint(intersectionPoints[i].x + translate.x, intersectionPoints[i].y + translate.y, intersectionPoints[i].z + translate.z)); pts.push_back(ON_3dPoint(intersectionPoints[i + 1].x + translate.x, intersectionPoints[i + 1].y + translate.y, intersectionPoints[i + 1].z + translate.z)); pts.push_back(ON_3dPoint(intersectionPoints[i + 2].x + translate.x, intersectionPoints[i + 2].y + translate.y, intersectionPoints[i + 2].z + translate.z)); *outNum += 3; } } } } } ON_3dPoint* result = new ON_3dPoint[pts.size()](); for(unsigned int i =0;i<pts.size();i++) { result[i].Set(pts[i].x,pts[i].y,pts[i].z); } return result; } I think it's slow in tow places. 1. using vector<> to hold all the points first, then copy them to the array. 2. in c#, List<double> .ToArray The first time I tested the code in Grasshopper, a warning "can''t find entry point blahblah..." came up. Then I did some google, used extern "C"__declspec(dllexport) and a .DEF file. If more code is added in, updating the .DEF file manually will be annoying. How is RhinoCommon manage all the exported functions? …; Added by Ian Chan at 3:55am on October 27, 2012

Topic: Laptops as workstation for working with Grasshopper: s with Rhino & Grasshopper and Cinema 4d(rendering). I found this two good laptops! Hp Elitebook Windows® 7 Professional autentico 64Processor Intel® Core™ i7-720QM (1,60 GHz, 6 MB L3 di cache)8 GB di SDRAM DDR3 a 1333 MHzSATA II da 500 GB a 7200 rpmScheda grafica NVIDIA Quadro FX 2800M con 1 GB di memoria video dedicata GDDR3 Price 2.200 Euro SONY VPCF12S1EWindows® 7 Professional autentico 64Processore Intel® Core™ i7-740QM8 GB di SDRAM DDR3 a 1333 MHzSerial ATA da 500 GB a 7200 rpmScheda grafica NVIDIA® GeForce® GT 330M con 1 GB di memoria video dedicata GDDR3Price 1.400 Euro Looking at the price, I would buy the second one…but I would ask you one thing....Considering that using Grasshopper I will create really complex works, using a GeForce instead a Quadro processor could it be a problem??…; Added by Emanuele Mozzo at 8:48am on August 2, 2010

Topic: Planarization, Smoothing, Equilateralization etc.: ns about them. It's a direction for Kangaroo I very much intend to continue developing - and I am still getting to grips with the possibilities and experimenting with how different optimization and fairing forces work in combination with one another, so I would value your input and experience. For those interested in some background reading material - [1] http://www.cs.caltech.edu/~mmeyer/Research/FairMesh/implicitFairing.pdf [2] http://mesh.brown.edu/taubin/pdfs/taubin-eg00star.pdf [3] http://www.pmp-book.org/download/slides/Smoothing.pdf [4] http://graphics.stanford.edu/courses/cs468-05-fall/slides/daniel_willmore_flow_fall_05.pdf [5] http://www.evolute.at/technology/scientific-publications.html [6] http://www.math.tu-berlin.de/~bobenko/recentpapers.html [7] http://spacesymmetrystructure.wordpress.com/2011/05/18/pseudo-physical-materials/ [8] http://www.evolute.at/technology/scientific-publications/34.html [9] http://www.evolute.at/software/forum/topic.html?id=18 At the moment the Laplacian smoothing is uniformly weighted, which tends to even out the edge lengths as well as smoothing the form, which is sometimes desirable, and sometimes not. It also tends to significantly shrink meshes when the edges are not fixed. I plan to try some of the other weighting possibilities, such as Fujiwara or cotangent weighting (see [1] and [3]), as well as other fairing approaches, such as Taubin smoothing [2], Willmore flow[4], and so on. This also has applications in the simulation of bending of thin shells. Planar quad panels are often desirable, but I'm finding that planarization forces alone are sometimes unstable, or cause undesirable crumpling, so need to be combined with some sort of fairing/smoothing, but the different types have quite different effects, and the balance is sometimes tricky. There's also the whole issue of meshes which are circular (I posted a demo of circularization on the examples page), or conical (this one still isn't working quite right yet), and their relationship with principal curvature grids and placement of irregular vertices, all of which is rather different when the whole form is up for change, rather than having a fixed target surface [7]. I'm also trying to get to grips with ways of making surfaces of planar hexagons, which need to become concave in regions of negative Gaussian curvature (see this discussion) and I hope to release soon a component for calculating CP meshes, as described in [8], which I think could have many exciting construction implications. While there are a number of well developed smoothing algorithms, their main area of application so far seems to be in processing and improving 3D scan data, so using them in design in this way is somewhat new territory. There can be structural, fabrication or performance reasons for certain types of smoothness, but of course the aesthetic reasons are also often important, and I think there are some interesting discussions to be had here about the aesthetics of smoothness. Anyway, that's enough rambling from me, hopefully something there triggers some discussion - I'm really keen to hear about how all of you envision these tools might be used and developed. …; Added by Daniel Piker to Kangaroo at 8:15am on July 9, 2011

Topic: Honeybee Severe Error Issue - 25 Invalid Number in Numeric Field#1 (Heating Sizing Factor): NONE, in SIZING:PARAMETERS". I'm not sure of where to start in troubleshooting this. I've attached the file. Thank you, See the errors and warnings below: {0;0;0} 0. Current document units is in Meters 1. Conversion to Meters will be applied = 1.000 2. [1 of 8] Writing simulation parameters... 3. [2 of 8] Writing context surfaces... 4. [2 of 8] Writing context surfaces... 5. [3 of 8] Writing geometry... 6. [4 of 8] Writing Electric Load Center - Generator specifications ... 7. [5 of 8] Writing materials and constructions... 8. [6 of 8] Writing schedules... 9. [7 of 8] Writing loads and ideal air system... 10. [8 of 8] Writing outputs... 11. ... ... idf file is successfully written to : R:\Green\SuRG\Building_Performance_Analysis\2016_analysis_studies\Energy_Analysis_Comparison\Honeybee_+_Ladybug\tutorial01\EnergyPlus\tutorial01.idf 12. 13. Analysis is running!... 14. ... ... Done! Read below for errors and warnings: 15. 16. Program Version,EnergyPlus, Version 8.5.0-c87e61b44b, YMD=2016.10.31 11:39,IDD_Version 8.5.0 17. 18. ************* IDF Context for following error/warning message: 19. 20. ************* Note -- lines truncated at 300 characters, if necessary... 21. 22. ************* 24 Sizing:Parameters, 23. 24. ************* Only last 1 lines before error line shown..... 25. 26. ************* 25 None, !- Heating Sizing Factor 27. 28. ** Severe ** IP: IDF line~25 Invalid Number in Numeric Field#1 (Heating Sizing Factor), value=NONE, in SIZING:PARAMETERS 29. 30. ** Warning ** IP: Note -- Some missing fields have been filled with defaults. See the audit output file for details. 31. 32. ** ~~~ ** Possible Invalid Numerics or other problems 33. 34. ** Fatal ** IP: Errors occurred on processing IDF file. Preceding condition(s) cause termination. 35. 36. ...Summary of Errors that led to program termination: 37. 38. ..... Reference severe error count=1 39. 40. ..... Last severe error=IP: IDF line~ , value=NONE, in SIZING:PARAMETERS 41. 42. ************* Warning: Node connection errors not checked - most system input has not been read (see previous warning). 43. 44. ************* Fatal error -- final processing. Program exited before simulations began. See previous error messages. 45. 46. ************* EnergyPlus Warmup Error Summary. During Warmup: 0 Warning; 0 Severe Errors. 47. 48. ************* EnergyPlus Sizing Error Summary. During Sizing: 0 Warning; 0 Severe Errors. 49. 50. ************* EnergyPlus Terminated--Fatal Error Detected. 1 Warning; 1 Severe Errors; Elapsed Time=00hr 00min 9.34sec 51.…; Added by Reid Weber to Ladybug Tools at 2:45pm on October 31, 2016

Blog Post: CURSO DE MODELACIÓN PARAMÉTRICA. PUC. CHILE.