tries, of different types, both annotation objects and curves, won't it be slow to iterate through all these objects for each rectangle?
I use 0.6.X but i'm soon making the shift to 0.7.X…
ve is most impacted by the characteristics of the vector field...If accuracy is not so important, you can use the curve re-sampling components to create a smoothe curve.…
ose space to make the louver look dense at some part.
Here' my method toward those space creating.
First, i create a numeric combination, so i got 3,9,15,30.
Second, i repeated the data until the length i want, and jitter them. Here's what i get:
30,3,9,3,15,9,30,30,15,3,3,15,30,9,3,3,15,3,3,9,9,3,15
Actually what i`m trying to achieve shown below:
3,9,3,3,30,3,15,9,15,30,30,15,30,3,9,15,9,3,3,15,3,9,3
My idea is, to make the center part look no so dense compare to others part, somehow
it's no a absolute looking in the final. What i mean is, maybe more [30] like 80% drop at the center part, 80% of [3] drop at the start and the end, meanwhile the others 20% [3] and [30] appear to be random in whole series.
Last, i will weave this set with other set which stand of the dimensions of sticks.…
"surfaces" ? Our teacher said to place the truncation according to this relation : Capture%20d%E2%80%99%C3%A9cran%202016-05-01%20%C3%A0%2008.03.46.png I already make the five platonic polyhedrons in Rhino.
Best,
Nastia …
This equation has the same issue as the code I posted. While the curve is the same, the units are off, as seen in my screenshot where the ymax goes well above 80
a spline? In a more general setting of semi-algebraic sets there is the Tarski-Seidenberg Theorem http://en.wikipedia.org/wiki/Tarski%E2%80%93Seidenberg_theorem that says the projection of a semi-algebraic set is itself a semi-algebraic set. As nurbs surfaces and breps defined by them are semi-algrbaric sets this means that the projection must be reasonably nice. I could not discover whether it is always a spline. There are however reasonably nice ways to get splines from algebraic curves, though we are back to an approximation. It would be nice to have an algorithm that is guaranteed to give the precise splines when they exist (as in the example above) and will otherwise give a good approximation, I was not able to find if one has been written, even in the theoretical literature.…