Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!cunixf.cc.columbia.edu!cunixb.cc.columbia.edu!yk4 From: yk4@cunixb.cc.columbia.edu (Yong Su Kim) Newsgroups: comp.sys.apple2 Subject: 3200 Gif converters Keywords: DreamGrafix, DreamWorld, 3200 Message-ID: <1990Nov26.055040.14047@cunixf.cc.columbia.edu> Date: 26 Nov 90 05:50:40 GMT References: <1990Nov26.054401.24321@cunixf.cc.columbia.edu> Sender: news@cunixf.cc.columbia.edu (The Daily News) Organization: Columbia University Lines: 28 I was playing around with Jonah Stich's 3200 gif converter, and it struck me that there had to be a better way of converting gifs into 3200 colour pictures on the GS. Jonah's program is extremely slow in converting gifs into 3200 colour modes using the Median Cut algorithim. I don't really see why he uses the median cut algorithim since median cut algorithim involves areas. All he really has to do is use the popularity algorithim on each individual scan line. That way it's possible to cut down on a lot of processing time. Another solution might be to write a 3200 gif converter for the GS using C so that it runs under standard UNIX. The programmer could design it such that it accepts standard UNIX binary files as gifs, process them using various optimization algorithims for 3200 colour mode, and then output a binary file which can then be downloaded to my GS. All I would have to do is change the filetype and then I would be able to view the conversion. This would be much much quicker and it would probably allow for superior conversions. Anyone out there have the time to write such a program? I would do it if I had the time and the knowledge... _____________________________________________________________________________ |Internet: yk4@cunixb.cc.columbia.edu |||||||||||Yong Su Kim|||||||||||| |Bitnet : yk4@cunixc |||||The Korean from Hong Kong|||| |UUCP : uunet!rutgers!columbia!cunixc!yk4 |||||||...Apple IIGS user...|||||| |____________________________________________||||||||||||||||||||||||||||||||||