Newsgroups: comp.compression Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!zaphod.mps.ohio-state.edu!wuarchive!m.cs.uiuc.edu!roundup.crhc.uiuc.edu!ux1.cso.uiuc.edu!uicbert.eecs.uic.edu!eddins From: eddins@uicbert.eecs.uic.edu (Steve Eddins) Subject: Re: Space filling curves Message-ID: <1991May22.132002.3860@uicbert.eecs.uic.edu> Organization: EECS Dept., University of Illinois at Chicago References: <6139@ns-mx.uiowa.edu> Date: Wed, 22 May 91 13:20:02 GMT Lines: 29 victor@watson.ibm.com (Victor Miller) writes: >Doug, the first suggestion that I know of to use space-filling curves >came from Lempel and Ziv in the Maratea conference "Combinatorial >Algorithms on Words" in June 1984. The paper "Compression of >Two-dimensional data" was subsequently published in the IEEE >Transaction is Information Theory, January 1986, vol. IT-32 number 1. >According to the journal, the manuscript was received in Dec. 1983. >-- > Victor S. Miller > Vnet and Bitnet: VICTOR at WATSON > Internet: victor@watson.ibm.com > IBM, TJ Watson Research Center Another reference of interest is J.C. Simon and J. Quinqueton, "On the Use of a Peano Scanning Im Image Processing [sic]", in {\em Issues in Digital Image Processing}, ed. R. M. Haralick and J. C. Simon, Sijthoff & Noordhoff, 1980. The authors give an algorithm for generating the Peano scan on a two-dimensional grid. They do not specifically mention compression, although they do remark that "It [the Peano scan] respects neighborhood better than a TV scanning." They give a two-dimensional data clustering application. -- Steve Eddins eddins@brazil.eecs.uic.edu (312) 996-5771 FAX: (312) 413-0024 University of Illinois at Chicago, EECS Dept., M/C 154, 1120 SEO Bldg, Box 4348, Chicago, IL 60680