Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site brl-tgr.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!gatech!seismo!brl-tgr!gwyn
From: gwyn@brl-tgr.ARPA (Doug Gwyn <gwyn>)
Newsgroups: net.graphics
Subject: Re: bitmap rotation algorithm needed
Message-ID: <35@brl-tgr.ARPA>
Date: Mon, 25-Nov-85 09:42:35 EST
Article-I.D.: brl-tgr.35
Posted: Mon Nov 25 09:42:35 1985
Date-Received: Tue, 26-Nov-85 20:53:55 EST
References: <4224@topaz.RUTGERS.EDU> <2809@watcgl.UUCP>
Organization: Ballistic Research Lab
Lines: 6

> The classic algorithm is due to Bob Floyd.  It computes the transpose of
> a matrix in something like n log n time (where n is the number of entries
> in the matrix).  This will handle the case of 90 degrees.

I would appreciate an explanation of how in-place transposition
of a matrix can be used to rotate a bitmap in-place by 90 degrees.