home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!mailer.cc.fsu.edu!sun13!cm.cf.ac.uk
- From: David.Beasley@cm.cf.ac.uk (David Beasley)
- Newsgroups: comp.graphics.research
- Subject: Multiplication of quaternion numbers
- Message-ID: <11533@sun13.scri.fsu.edu>
- Date: 14 Dec 92 22:17:08 GMT
- Sender: news@sun13.scri.fsu.edu
- Lines: 23
- Approved: murray@vs6.scri.fsu.edu
- X-Submissions-To: graphics@scri1.scri.fsu.edu
- X-Administrivia-To: graphics-request@scri1.scri.fsu.edu
-
- Quaternion numbers can be quite handy for representing points in 3-D
- space. The multiplication of one quaternion by another performs the
- job of 3-D rotation. But since quaternions are 4-component numbers,
- a trivial algorithm requires 16 real-number multiplications to be done.
-
- However, I have devised an algorithm which achieves quaternion
- multiplication with only 10 real-number multiplications. Does anyone
- know if an algorithm such as this has been published before, or have
- I discovered something new here?
-
- I'd be interested to hear from anyone using quaternions for 3-D
- manipulations.
-
-
- David Beasley (David.Beasley@cm.cf.ac.uk)
- Department of Computing Mathematics
- University of Wales College of Cardiff __o
- PO Box 916 \<,
- CARDIFF CF2 4YN ___________________()/ ()___
-
- --
- Moderated by SCRI Vis <> Submissions to: graphics@scri1.scri.fsu.edu
- Guy, John R. Murray <> Administrivia to: graphics-request@scri1.scri.fsu.edu
-