If I understand your question correctly, you can try making 2d images
of your points, then map the images into the cube by assigning their
vertices.
There are ways to do this, without creating temporary 2d image
files, see the response to the link below, but it requires the latest
CVS version of PDL.
See:
http://perlmonks.org?node_id=591731
I'm afraid that's not exactly what I'm looking for. After
re-analyzing the problem and reading chapter 3 of the PDL book, I
realize what I actually need to do is find or write a "primitive" code
that will project a line into a plane, and then let threading take
care of doing that to each line in my image and give me a cube. I
think I can manage that, but I haven't worked with c much, and I'm not
sure I understand how to use PP completely, but hopefully I'll learn.
Sort of on that note, I was hoping to use the code for, say, diagonal,
or some other similar code, as an example, but I can't find it.
Core.pm and Slices.pm have references to diagonal and diagonalI, but
I'm not sure where to follow those. Where can I find out about how
the code is structured/where the source is?
Thanks,
Adam
_______________________________________________
Perldl mailing list
[email protected]
http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
