Distance on arrays of unit-quaternions

  • Thread starter mnb96
  • Start date
  • Tags
    Arrays
In summary, distance on arrays of unit-quaternions is a measure of difference between two sets of unit-quaternions, taking into account rotations and translations represented by the unit-quaternions. It is important in scientific research as it allows for quantitative comparison between different sets of rotations and translations. Some common applications include motion planning, protein structure analysis, and animation. The most commonly used method for calculation is the geodesic distance, but other methods may also be used. Limitations include not considering the order of rotations and computational expense for large arrays or high-dimensional data.
  • #1
mnb96
715
5
Hello,
let's take the algebra of quaternions [itex]\mathcal{C}\ell_{3,0}^+[/itex] and consider only the sub-algebra of unit-quaternions.
When we wanted to define a https://www.physicsforums.com/showpost.php?p=2911801&postcount=6" we used the fact that unit-quaternions lie on the [itex]\mathcal{S}^3[/itex] sphere.

Now, what happens if we instead consider the whole set of finite "arrays" [itex](q_1,\ldots,q_n)[/itex], in which each entry qi is a unit-quaternion?

Is it possible that an n-tuple [itex](q_1,\ldots,q_n)[/itex] represent a point on some manifold?
If so, how can we compute the geodesic distance between two n-tuples?

Thanks!


EDIT:
a simplified question could be: given a vector of unit complex numbers, can we consider this vector as a point of some manifold?
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
mnb96 said:
Hello,
let's take the algebra of quaternions [itex]\mathcal{C}\ell_{3,0}^+[/itex] and consider only the sub-algebra of unit-quaternions.
When we wanted to define a https://www.physicsforums.com/showpost.php?p=2911801&postcount=6" we used the fact that unit-quaternions lie on the [itex]\mathcal{S}^3[/itex] sphere.

Now, what happens if we instead consider the whole set of finite "arrays" [itex](q_1,\ldots,q_n)[/itex], in which each entry qi is a unit-quaternion?

Is it possible that an n-tuple [itex](q_1,\ldots,q_n)[/itex] represent a point on some manifold?
Yes. We can simply consider direct products. Here are some equivalent presentations:
https://www.physicsforums.com/insights/journey-manifold-su2mathbbc-part/
If so, how can we compute the geodesic distance between two n-tuples?
Depends on the metric considered.
Thanks!EDIT:
a simplified question could be: given a vector of unit complex numbers, can we consider this vector as a point of some manifold?
There is a difference between a vector and a point so your question is a bit unclear. Every point described via coordinates can be considered a point of a manifold. Which manifold might be the more interesting question as there is no unique answer.
 

FAQ: Distance on arrays of unit-quaternions

What is the concept of distance on arrays of unit-quaternions?

The distance on arrays of unit-quaternions is a measure of the difference between two sets of unit-quaternions. It takes into account the rotations and translations represented by the unit-quaternions in the arrays, and calculates how much they differ from each other.

Why is distance on arrays of unit-quaternions important in scientific research?

Distance on arrays of unit-quaternions is important in scientific research because it allows for a quantitative comparison between different sets of rotations and translations. This can be useful in a variety of fields such as computer graphics, robotics, and molecular biology.

What are some common applications of distance on arrays of unit-quaternions?

Distance on arrays of unit-quaternions can be used in applications such as motion planning for robots, protein structure analysis, and animation in video games and movies. It can also be applied in data analysis and machine learning algorithms.

How is distance on arrays of unit-quaternions calculated?

The most commonly used method for calculating distance on arrays of unit-quaternions is the geodesic distance, which takes into account the shortest path between two points on a curved surface. Other methods, such as the Euclidean distance, may also be used depending on the specific application.

Are there any limitations or challenges when using distance on arrays of unit-quaternions?

One limitation of using distance on arrays of unit-quaternions is that it does not take into account the order of the rotations in the arrays. This can be challenging when comparing sets of unit-quaternions with different orders of rotations. Additionally, the calculation of distance can be computationally expensive for large arrays or high-dimensional data.

Similar threads

Replies
10
Views
3K
Replies
15
Views
2K
2
Replies
39
Views
11K
2
Replies
61
Views
7K
2
Replies
42
Views
8K
6
Replies
175
Views
22K
Replies
1
Views
2K
Back
Top