Return
End If
'
Dim ptlist As New list(Of Point3d)
Dim pn As point3d = p
ptlist.add(pn)
Dim k As Double = 1 / (4 * math.PI * (8.85 * 10 ^ -12))
Dim vvect As vector3d = New Vector3d(0, 0, 0)
For j As Integer = 1 To it
Dim fvect As New Vector3d(0, 0, 0)
For i As Integer = 0 To ps.Count - 1
Dim vtemp As New Vector3d(0, 0, 0)
Dim f As Double = 0
Dim val As Double = 1 - v(i)
vtemp = ps(i) - pn
Dim dist As Double = vtemp.Length
If dist < r Then dist = r
' LEY COULOMB
f = k * ((q * q * val) / (dist ^ e))
' LEY MODIFICADA
' f = k * ((q * q * val ^ e2) / (dist ^ e))
vtemp.Unitize
vtemp = vtemp * f
fvect = fvect + vtemp
Next
Dim avect As Vector3d = fvect / m
' MRUA
' vvect = vvect + avect * t
' pn = pn + vvect * t + 1 / 2 * avect * t ^ 2
'LINEAL
vvect = avect * t
pn = pn + vvect
ptlist.add(pn)
Next
a = ptlist
Inputs are 'p' as the point to move, 'ps' as a list of attractor points, 'v' as a list of charge values, 'r' as a minimum radius used for not ending up in a singularity, 'it' as number of iterations, 't' as the time increment in every iteration, the rest are related to physical properties that can be simplified.…
Added by Vicente Soler at 8:51am on October 10, 2010
at sky type you choose. See images below.
A Tregenza sky discretizes the skydome into 145 patches to simplify the calculation process. This skydome approximates the smoother Perez sky shown below. Both the Tregenza 145-patch sky and the Perez sky use climate data to create realistic skies that react to hourly solar and weather data. So there may be some differences between the two runs. Also, every unique run will have some error based on how the calc process works and what your presets are.
Tregenza 145-patch sky-…
on of the vault bottom surface, has less division curves than the vault.
I need to loft the curve from bottom with the curve from vault. But only get the original quarter vault connect to the bottom. (as the gh. file shows now)
Can someone tell me how to relate the bottom to every quarter unit, and loft the curves on them with the bottom curves;
And how to control the items number, so I can switch the loft [1] on bottom with [2]/[3]/[4].. on the vault?
Thank you very much!!
Yuge
Q_Loft.gh…
s" (the crude and fast and the right and slow) for creating the solid to test the inclusions. In your case use the crude since an insole has never the same Z for a given (X,Y) set.
2. Creating "patterns" for the circles is very easy (if you are familiar with the relative item(s) stuff). For some indications/hints see my replies on this (use the latest gh posted):
https://www.google.com/url?q=http://www.grasshopper3d.com/xn/detail...
3. Lunchbox could cut the mustard (the circle center thing) with an indirect way but it could be like shooting a mosquito with a bazooka (but why not? he he). Anyway use the logic in the "123,45 Loft examples" if you decide to use Lunchbox as the "pattern maker".
4. Paneling Tools ... er ... the bazooka thing again.
5. C# : this is the best option by a million miles > you control anything.
best, Peter
…
ons? Where are the lot (per property) constrains?
Plan A: This puzzle appears to me like the classic problem to randomly divide a trimmed surface with ... er ... "patterns" (up to a point) that comply to some topological rules. "Kinda" like a 2d Voronoi thing (add some " " more) with "restrictions". I have some stuff that does something on that matter but is solely done with code and I doubt that could be useful to you (unless you speak C#).
Plan B: Pack randomly ("suitable") generated lots collections within the defined sub-boundaries. This is rather challenging I must say and I seriously doubt if it's doable without code.
https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=4&cad=rja&uact=8&ved=0CDEQFjADahUKEwj5rZ_l94DIAhWG6CwKHa3-CBY&url=http%3A%2F%2Fcimar.mae.ufl.edu%2FCIMAR%2Fpages%2Fthesis%2FPasha_A_CISE.pdf&usg=AFQjCNE5qza1yIAqoaggdXZ9kr29JjLD6w…
lnms&tbm=isch&sa=X&ei=Ra3HUenpHomciQKnqoFw&ved=0CAkQ_AUoAQ&biw=1708&bih=815
something similar to this images
http://www.danielwidrig.com/index.php?page=Work&id=Fuzzy
Do you guys thins is possible to make something like this in grasshopper? I hope it is lately I have been coming up with ideas that can only be done in other sotfware platforms.
Thanks.
any hint comment or tip is welcome!…
= new Point3d(0, 0, 0); b = new Point3d(0, 0, l); Line x = new Line(a, b); Curve m = x.ToNurbsCurve();
if (x == null) return;
Point3d[] points; m.DivideByCount(50, true, out points);
//for (double itr = 0; itr < 50; itr = itr + 0.01) //{ double frac = 50 / 230; int itr = 0; foreach (Point3d point in points) { while (true) { double imtr = (50 - itr) / frac; itr++; Color colour = ColorFromHSV(imtr, 1, 0.5); int rgb = colour.ToArgb(); if (_hash.Contains(rgb)) continue;
_hash.Add(rgb); _points.Add(point); _colours.Add(colour); break; } //} } for (int i = 0; i < _points.Count; i++) cd.AddPoint(_points[i], _colours[i]); }
// <Custom additional code> private readonly HashSet<int> _hash = new HashSet<int>(); private readonly List<Point3d> _points = new List<Point3d>(); private readonly List<Color> _colours = new List<Color>();
/// <summary> /// This method will be called once every solution, before any calls to RunScript. /// </summary> public override void BeforeRunScript() { _hash.Clear(); _points.Clear(); _colours.Clear(); } public static Color ColorFromHSV(double hue, double saturation, double value) { int hi = Convert.ToInt32(Math.Floor(hue / 60)) % 6; double f = hue / 60 - Math.Floor(hue / 60);
value = value * 255; int v = Convert.ToInt32(value); int p = Convert.ToInt32(value * (1 - saturation)); int q = Convert.ToInt32(value * (1 - f * saturation)); int t = Convert.ToInt32(value * (1 - (1 - f) * saturation));
if (hi == 0) return Color.FromArgb(255, v, t, p); else if (hi == 1) return Color.FromArgb(255, q, v, p); else if (hi == 2) return Color.FromArgb(255, p, v, t); else if (hi == 3) return Color.FromArgb(255, p, q, v); else if (hi == 4) return Color.FromArgb(255, t, p, v); else return Color.FromArgb(255, v, p, q); }
Gives this error
1. Value was either too large or too small for an Int32. (line: 0)
…
掌握编程过程中遇到的思路方面和技术方面的问题. 内容包括以下几个方面:
反向逻辑思维能力的培养;
建立清晰的编程逻辑思维能力;
GH 的程序设计理念;
并行数据结构深入理解和控制.
Grasshopper course of McNeel Asia focus on the cultivation of students flexible use of programming techniques, the ability to solve practical problems. Our course deep into the whole process of programming, from programming thinking model, the components principle to usage details do detailed explanation, help students complete mastery programming encountered in the process of thinking and technical aspects, include the following content:
Ability of reverse logical thinking;
Establishment of clear programming logical thinking ability;
The program design concept of Grasshopper;
Understanding parallel data tree structure and how to control it.
更多详细内容... More details…
授课讲师 Instructor 课程由Grasshopper原厂McNeel公司在中国地区的两位 Rhino 原厂技术推广工程师 – Dixon、Jessesn联合授课。课程结束后对达到授课预定目标的学员颁发唯一由Grasshopper原厂认证的结业证书.
Dixon & Jessesn, McNeel Asia Support engineer, by the end of course student who achieve the intended target will get the authentication certificate from McNeel Asia.
课程报名 Register this course 课程即日开始报名, 开课一周前停止报名, 名额满提前报名结束. This course begin to sign up, stop sign up a week ago, with the quota ahead over.
在线报名参加课程...
Sign up to this course…
课程日期 Schedule 7/15-7/20 Beijing 北京 7/26-7/31 Shanghai 上海 7/07-7/12 Shenzhen 深圳
课程范例演示 Samples of Grasshopper course demo
Note: pls follow below comments by Jessesn to see the samples…
doi%3D10.1631%2Fjzus.2006.A0570&rct=j&q=nesting%20algorithme&ei=02sTTsTzFYrt-gaSj5XVDQ&usg=AFQjCNEGBoMjvncNtXA4MZX9lFYJKj1QiA&cad=rjaNesting of Complex Sheet Metal Partshttp://www.cadanda.com/CAD_4_1-4__18.PDFOptimizing Allocation of Two Dimensional Irregular Shapes using an Agent Based Approachhttp://www.waset.org/journals/waset/v11/v11-19.pdfAlgorithmes Heuristiques et Evolutionnistes :Application à la Résolution du Problème de Placement de Formes Irrégulièreshttp://sysbio.vtt.fi/members/thesisckb_oct98.pdfApplying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygonhttp://junisesafvanishere.blogspot.com/If you can afford, these are not for free :Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detectionhttp://portal.acm.org/citation.cfm?id=1326699many others $http://academic.research.microsoft.com/Publication/13335451/a-tutorial-in-irregular-shape-packing-problems…