Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!caen!news.cs.indiana.edu!msi.umn.edu!umeecs!zip!spencer From: spencer@eecs.umich.edu (Spencer W. Thomas) Newsgroups: comp.graphics Subject: Re: Need info on Peano curves Message-ID: Date: 11 Mar 91 23:17:46 GMT References: <1991Mar11.202541.2292@ms.uky.edu> Sender: news@zip.eecs.umich.edu Organization: University of Michigan EECS Dept Lines: 16 In-Reply-To: hucaby@mri.uky.edu's message of 11 Mar 91 20:25:41 GMT In article <1991Mar11.202541.2292@ms.uky.edu> hucaby@mri.uky.edu (David Hucaby) writes: > Does anybody have references on how to generate Peano curves > via computer? A. R. Butz, "Alternative algorithm for Hilbert's space-filling curve," IEEE Trans. Comput., vol C-20, pp. 424-426, Apr. 1971. Actually, this is not quite the Peano curve, as it isn't closed. It starts in one corner of the square and ends in another. But it's pretty close. I have code that implements this in N dimensions (with the constraint that N * (the number of bits of resolution) is <= 32.) It's pretty short, I could post it if there is interest. -- =Spencer W. Thomas EECS Dept, U of Michigan, Ann Arbor, MI 48109 spencer@eecs.umich.edu 313-936-2616 (8-6 E[SD]T M-F)