9 8 7 6
5 4 3 2 1 0
I am triangulating this surface. I want to select just the red vertices. As you can note, I just need the inner vertices of this surface. I could do it mannually, but if I want to change the mesh density later, I will have to pick all of them manually again later.
Can someone help me?
Tks
…
a seed, and instead creating a pattern where each color has a seed/control slider for each row? For example, row 1: brown 2, tan 6, yellow 7, purple 3, repeat. row 2: brown 6, tan 1, yellow 4, purple 10, repeat. row 3: yellow 5, purple 1, brown 3, tan 10, repeat. row 4: purple 2, brown 7, tan 3, yellow 4, repeat. Then repeat that sequence up the wall? For each color, the number in the sequence should be adjustable.
Thank you again for your help!…
onnected to 10 points --> 3 of 10 Lines have an intersection with the brep
point "1" is connected to 10 points --> 5 of 10 Lines have an intersection with the brep
point "2" is connected to 10 points --> 2 of 10 Lines have an intersection with the brep
I actually got this information but as you can see the algorithm become pretty long…
Added by Robert Megel at 12:46pm on November 1, 2012
7 -18.2
8 5.02
9 12.4
10 18.1
11 7.01
12 5.11
13 2.35
this data is waveform data.
i want to pick out only climax(for example in upper data, number 1 and 10) from this data.
i have this problem...that is, i do not know to do what.
i think my English is strange...so you are difficult to understanding my question.…
1
condition: largest number<max length
then the packing would look something like this:
1 |4 |5 |7 |2
9 |6 |5 |3 |2
|5
|1
sums|10|10|10|10|10 => 100% efficiency
And the algorithm is:
1.Place first number(x=1)
2.Calculate the rest(R) in this row(10-1=9)
3.Search for closest x <= than R
3.1 If x=R -> place that number -> end of cycle
3.2 If x<=R -> place that number -> return to 2.
3.3 If x=null -> end of cycle
Something like this.
Can this be classified as brute force?
…
Added by Artyom Maxim at 11:08am on March 19, 2013