Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site Shasta.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!allegra!oliveb!Glacier!Shasta!samadani
From: samadani@Shasta.ARPA
Newsgroups: net.math,net.graphics
Subject: Re: peano curve
Message-ID: <1549@Shasta.ARPA>
Date: Thu, 21-Nov-85 22:45:22 EST
Article-I.D.: Shasta.1549
Posted: Thu Nov 21 22:45:22 1985
Date-Received: Sat, 23-Nov-85 05:47:23 EST
References: <4591@alice.UUCP>
Reply-To: samadani@Shasta.UUCP (Ramin Samadani)
Organization: Stanford University
Lines: 17
Xref: watmath net.math:2554 net.graphics:1302
Summary: 

I recently wrote a program that takes an image in TV scan order and
puts it in a scan order which approximates the peano curve. This 
brings up a couple of questions which I don't know enough to solve:

Considering images to be of size M = N*N, where N is of the form 2^n,
we can think of the transformation to be a permutation "peano(m)"
where m = 0,1,...,M - 1. 

What I am interested in is, given the group of permutations of M elements,
what is the order of the permutation peano(m)? How does one find the
inverse to this permutation? Are there easy general results regarding
finding the inverse of a permutation?


Ramin Samadani				202 Durand Building, STARLAB	
...ucbvax!shasta!samadani (UUCP)	Stanford University
samadani@su-shasta.ARPA   (ARPA)	Stanford, CA 94305