How to Calculate Rotation of Points Between Two 3D Points?

  • Thread starter Thread starter simchris111
  • Start date Start date
  • Tags Tags
    Formula Rotation
simchris111
Messages
2
Reaction score
0
I'm working with 3D applications, and I'm trying to figure out how to calculate the rotation of x number of points between two points.

I've made a video to illustrate what I mean:
https://www.youtube.com/watch?v=CmIk8I8itrQ

So the thing is, I need to find some kind of formula that calculates the rotation of the red points based on the rotation of the green ones. The middle red point should always be 50% between the top and the low point, but the red points below and above the middle should bias the rotation towards their closest green point. In this case I have 5 red points, it would be awesome if the formula also worked on more points.


So the formula has to work only from knowing the number of red points, and the rotation of the upper and lower green point.


I'm sorry if this is stupidly simple, but I can't seem to wrap my head around it.
 
Mathematics news on Phys.org
The middle red point seems to be just the average of the two green points, so that's easy. As for the other red points, unless there's some complexity I'm missing, you could probably just take them to be the weighted average of the rotation of the middle red point and the nearest green point; the weight will determine how biased it is towards the green point.
 
Number Nine said:
The middle red point seems to be just the average of the two green points, so that's easy. As for the other red points, unless there's some complexity I'm missing, you could probably just take them to be the weighted average of the rotation of the middle red point and the nearest green point; the weight will determine how biased it is towards the green point.
Thanks for your reply :)

That could work, however I'm limited to my 3D-application's native math-nodes (Autodesk Maya), and it doesn't seem to have a node that can do a weighted average operation. It has an average node, but not a weighted average node.

I'm sorry I forgot to say that in the first post, the math-functionality I can use is limited to these:
Plus, Minus, Avarage, Multiply, Divide, Power, Compose Matrix, Decompose Matrix, Transpose Matrix, Inverse Matrix, Vector Product
 
If you can add, multiply and divide, you can compute a weighted average.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top