On 8/5/07, Frank Buss [EMAIL PROTECTED] wrote:
Nearly anything works without thinking too much about the types, but I
don't like the use of fromInteger in the average and main functions. Is it
possible that the integers are automaticly converted to floats?
I recommend using Float or Double
Hi Conal,
I've tried some links, e.g. the pre-compiled components from
http://conal.net/Pan/Releases/2000-12-06/ or the interactive presentation
from http://conal.net/Pan/papers.htm , but file not found. Do you have the
files? Would be easier than trying to setup Haskell and Visual C++
On Tuesday 07 August 2007 21:22:00 Frank Buss wrote:
I assume to make it fast, a good idea would be to cache some calculations...
If you want to make it fast you should be using hardware acceleration.
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
I agree with Jon. And hardware acceleration is in tension with the
generality of the extreme generality of formulating images as general
(computable) functions on space (and hence arbitrary non-linear
transformations, etc).
*Unless*, you abandon the traditional acceleration of a fixed set of 2D
Hi Frank,
Pan has been bit-rotten for a while now. Besides the unfortunate dependency
on Visual C++, it used a now long-obsolete GUI library. That's one reason I
started working on Pajama (http://conal.net/Pajama).
There's no reason not to create modern, cross-platform successors to
Pan/Pajama
On 8/8/07, Conal Elliott [EMAIL PROTECTED] wrote:
*Unless*, you abandon the traditional acceleration of a fixed set of 2D
(or 3D) primitives and transformations and instead compile into graphics
processor code as in http://conal.net/Vertigo .
Wow, cool :-)
Am Montag, 6. August 2007 00:48 schrieb Frank Buss:
I've created a small program to compose images with combinators:
http://www.frank-buss.de/haskell/OlympicRings.hs.txt
...
look very smooth. And it is very slow, it needs about 40 seconds on my
computer to calculate the image. Using
Marc A. Ziegert wrote:
in that source file, you define Size and Pixel as structs of
Integers. that are neither unsigned chars (8_bit) nor ints
(32-64_bit) nor floats (32_bit) but an artificial oo_bit int
(1 int + list of bytes).
i'm sure you will gain a speedup by redefining these
I've created a small program to compose images with combinators:
http://www.frank-buss.de/haskell/OlympicRings.hs.txt
It produces TGA output, but I've converted it to PNG, because this is
smaller:
http://www.frank-buss.de/haskell/OlympicRings.png
This is my first larger Haskell program and I
On 05/08/07, Frank Buss [EMAIL PROTECTED] wrote:
Is it possible to write functions with an arbitrary number of arguments?
Would be nice if the average function would accept any number of pixel
values.
I think it's possible in some sense, because the Haskell
interpretation of printf() works in
On Mon, Aug 06, 2007 at 12:48:02AM +0200, Frank Buss wrote:
I've created a small program to compose images with combinators:
http://www.frank-buss.de/haskell/OlympicRings.hs.txt
It produces TGA output, but I've converted it to PNG, because this is
smaller:
Nearly anything works without thinking too much about the types, but I don't
like the use of fromInteger in the average and main functions. Is it
I've forgotten to attach this link:
http://www.nabble.com/Perl-style-numeric-type-t3948269.html
(perhaps use the threaded view to read all
12 matches
Mail list logo
