steps based on the same domain? For example if I wanted the first step at 12, the second step at 10, etc - based on my input? (number slider or string panel)
Thanks…
there was a way of offsetting curves and pairing them up in the code. I currently have a simple program done with variables in the g-code itself to solve the issue but it doesn't work with curves. :-(
…
6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, etc
In addition to the components in the attached file, I have also tried using Cull Index but that did not do much. I tried using a number slider set to whole numbers with the range equal to the values I have set up in the integer, but it just increases the size by 1 every time. Any help on steps in the right direction would be great thanks.…
d send it in the same format to another VB. Attached file show two possibility, first with DataTree, second with ArrayList type. How to make it correct?
Please some help, Best
Joach…
Added by Jachym Pesek at 12:22pm on September 20, 2009
d sequentially.
In your case, your question is a bit vague: you divide each circle into 4 points, so if you were to connect all your points horizontally, you would end up with 9 horizontal curves (3 for each circle) and 12 verticals (3 for each circle again). But you mention only 3 & 4 curves. Is this what you want the surface to look like (Blue Lines)?
…
elated with the Topology outputs:
So let's try to do (via components) the face reconstruction stage (the missing 4 as above):
Alias crenelatedEdgesTree as polylineTree.
Imagine a Lst that samples all the edges per Face ("changed" and "unchanged") as Curves.
1. Let's take face 3: this is surrounded by edges 10,11,12,13 and 37.
2. Has edge 10 "changed" (to polyline) ? No because in the polylineTree there's no branch {10} ... thus sample edge 10 from the EList (Note: apparently that's a boundary edge). Has edge 11 "changed" ? No ... blah, blah.
3. Has edge 12 "changed" ? Yes because in the polylineTree there's a branch {12} ... thus sample the item from that branch. Same for 13 ... etc etc.
4. Thus we have sampled all the surrounding edges as Curves and the next step is to join them > yielding a closed Curve.
5. Then we must "planarize" that Curve (by projecting it into the corresponding Brep Face plane) ... and the rest are history.
So ... try it and report any issue encountered.…
ng (It's a bit similar to the Knapsack problem):
I have a Variable --> XandI Have fix numbers (can we call "pieces") 9,12,15,18
I'd like to reach the X, with the summing of these numbers and using the minimum pieces ,it can't be lower than X, but it can be higher, maximum with 3.After this it has to found the most optimal combination which mostly use the same pieces
E.G.
X=98
The wrong solution is like = 1pcs of 18 = 9pcs of 9
Sum of pieces are 10
OR
= 3pcs of 18 = 1pcs of 15 = 1pcs of 12 = 2pcs of 9
Sum of pieces are 7
The right solution in this case = 5pcs of 18 = 1pcs of 9
(5*18)+(1*9)=99 it's good beacuse it's over with maximum 3 and uses the minimum pieces
Then it sends to a list like18 : 5pcs15 : 0pcs12 : 0pcs9 : 1pcsCan somebody help me ? Or is it possible to make this ?
Thank you…
Added by Petrik Kollár at 1:09am on November 10, 2017