home *** CD-ROM | disk | FTP | other *** search
- Path: informatik.tu-muenchen.de!fischerj
- From: fischerj@informatik.tu-muenchen.de (Juergen "Rally" Fischer)
- Newsgroups: comp.sys.amiga.programmer
- Subject: Re: Q: C2P MUCH FASTER?
- Date: 12 Feb 1996 18:03:46 GMT
- Organization: Technische Universitaet Muenchen, Germany
- Distribution: world
- Message-ID: <4fnve2$glv@sunsystem5.informatik.tu-muenchen.de>
- References: <311B354C.FD@munich.netsurf.de>
- NNTP-Posting-Host: hphalle5.informatik.tu-muenchen.de
- Originator: fischerj@hphalle5.informatik.tu-muenchen.de
-
-
- In article <311B354C.FD@munich.netsurf.de>, ML <Manfred.Linzner@munich.netsurf.de> writes:
- |> I trying to find a fast c2p routine which produces 2*1 in 256 colors.
- |>
- |> Question:
- |> ---------
- |> Is there any sense to use an superhires (1024*y) screen for a c2p
- |> conversion?? This means you could write a byte at once to
- |> get a double-width lowres pixel.
- |> Could this be faster than normal c2p routines with an ordinary 320*y
- |> screen?
-
- well, you get a 2 color chunky screen, or, with dithering,
- some more. this can be faster for some fancy fx, but for
- games it doesn't give you advantages vs a good done 256
- color c2p routine.
-
- ------------------------------------------------------------------------
- fischerj@Informatik.TU-Muenchen.DE (Juergen "Rally" Fischer) =:)
-
-