ven if the number of panels inside each cell varies. The current solution works when the number of panels inside each cell is always two or other same numbers, but it wouldn't work if the number of panels inside frames are different in each cell. It would be perfect, if numbering of panels are automatically added correctly next to the cell number based on the number of panel division instead of feeding the fixed number.
To take an example, let's assume that the cell #80 has three panels and the #81 has two ones. In this case, three panels within the cell #80 would be numbered like 80-1, 80-2, 80-3, while two panels within the #81 would be numbered such as 81-1 and 81-2 automatically. …
ded a circle and been able to draw the two lines and cull out the correct distances but do not know how to pull out those two original lines - the one from the starting point to the circle division + the circle division to the end point.
To recap - I'm looking for a way to have 2 lines = 80" when the direct path between two points is 60". I do not want the 2 new lines to be equal in length but variable lengths.
thanks!
_patrick
…
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.…
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.…