The Datafile PD-CD 3

home *** CD-ROM | disk | FTP | other *** search

/ The Datafile PD-CD 3 / PDCD_3.iso / utilities / utilsf / graphtext / 3D_Prog / text0000.txt < prev

Wrap

Text File | 1995-03-22 | 27.2 KB | 663 lines

Archive-name: 3d-programmer-info Version: $Id: .header,v 1.8 1994/05/23 15:55:59 pat Exp pat $ O O ---+ +---- F A Q ------------------+ +------- F A Q ---------------+ +--- %[%| |X$HOOR$H\[[8@DoooDDDDD8@@[%[%| |X$HOOR$H\[[8@DoooDDDDD8@@[%[%| |X$H [[%| |$C$OOR$H\%[8DooooDDDD8D@@[[[%| |$C$OOR$H\%[8DooooDDDD8D@@[[[%| |$C$ [[%| |X$HHRR$H@[ 88@@[[%| |X$HHRR DDDD88@@[[%| |X$H [[[| |$$$HRR$H@%[@8ooooD 888@[[[[| |$$$HRR$H@%[@8o DDDD888@[[[[| |$$$ [[[| |X$$H / / 88[[[[| |X$ / / D888[[[[| |X$$ [%[| |XC$H \%[@8DDD DD @[[%[| |XC $H\%[@ DDDD 88@[[%[| |XC$ [[%| |XC$H \%%@8DD DDDD @[[%| |XC $H\%% DDDDDD 8@@[[%| |XC$ [%[| |X$$H \%%@88DDD D8 @[%[| |X$ $H\%%@8 DDD8 8@@[%[| |X$$ [%[| |CX$H \%%[88DDD88 D @[%[| |CX $H\%%[88D 88D 8@@[%[| |CX$ [%[| |X$CH \%[[@888D8D8 | @[%[| |X$ _$H\%[[@888 88 88@[%[| |X$C [%[| |XXCH | [@888D888 | @@[%[| |XX | H\@[[@888 8 88@@[%[| |XXC [%[| |XC$$ \ \ | |88@[%[| |XC \ \ | | 8888@[%[| |XC$ [%[| |XX$HOR$HH@ [@88888 8D8@@[%[| |XX$HOR H@[%[@8 @8888D8@@[%[| |XX$ [%[| |X$CHOR$H\@% @@@@Y 8888@@[%[| |X$CHOR$ @%%[Y @8888888@@[%[| |X$C [%[| |CX$$OR$HH@%% .d8D88@@[%[| |CX$$OR$H .d@@888D88@@[%[| |CX$ [[[| |X$$HOR$HH@%%[[@@@@88D8D88@[[[| |X$$HOR$HH@%%[[@@@@88D8D88@[[[| |X$$ [%[| |CX$HOR$HH\%[%[@@@@888D88@@[%[| |CX$HOR$HH\%[%[@@@@888D88@@[%[| |CX$ ---+ +--------------- F A Q -------+ +------------------ F A Q ----+ +--- Contents: 1) General references for 3-d graphics questions. 2) How do I define an object? 3) How do I define space? 4) How do I define position? 5) How do I define orientation? 6) How do I define a velocity? 7) Drawing three-dimensional objects on a two-dimensional screen. 8) Vector Math - Dot Product and Cross-Product. 9) Matrix Math 10) Collisions. 11) Perspective. 12) Z-Buffering & the Painters Algorithm & BSP-Trees. 13) Shading. 14) 3-space clipping. 15) 3-d scanning. 16) Publically available source-code. 17) Books on the topics. 18) Other forums. 19) Current Contents of Archive ftp.csh.rit.edu::/pub/3dfaq Last update: 23May94 What's new? Description of Z-Buffering, Painter's Algorithm, and BSP-trees. 1) General references for 3-d graphics questions. Well, this FAQ is just getting off the ground. Hopefully it will touch on most of the bases you need to get started for now, and hopefully it will expand at least as fast as you need it too. But... regardless, things you'll want to locate for more help are Matrix Algebra books, Physics books talking about Eulerian motion, and some books on the Graphics Hardware you want to program for. The code examples included in this FAQ will most likely be in C with pseudo-code in comments. One of the most popular references, (and one of my favorites), is: Computer Graphics: Principles and Practice ------------------------------------------ Foley, van Dam, Feiner, and Hughes Addison Wesley -- Reading, Massachusetts (c) 1990. ISBN 0-201-12110-7 But, you'll also want to definitely check out the FAQ for comp.graphics. That FAQ touches mainly on 2-D needs, but some 3-D aspects are reviewed there, too. 2) How do I define an object? There are lots of ways to define objects. One of the most commonly used is the OFF (Object File Format). The OFF toolkit and a library of objects are available via anonymous ftp from gatekeeper.dec.com -- XXX ??? (I can't find it anymore. I found it here once about 2 years ago, but I haven't found it since). The format provides easy methods for extensions and a base set of things you can expect for each object. The toolkit is a bit bulky, but the file format (in ascii) is easy enough to parse by hand. The OFF.aoff file contains information about the object. The most important one there is the location of the surface specification file (usually object name.geom). This file also contains other attributes - and file names relevant to this object. The OFF surface specification begins with the number of points, the number of polygons and the number of segments. npts nplys nsegs This line is followed by the floating point coordinates for the points that make up the object. x1 y1 z1 x2 y2 z2 x3 y3 z3 . x(npts) y(npts) z(npts) Then, it gets a bit more complicated. The following lines begin with a number to indicate the number of vertices in this polygon. That number is followed by that many numbers, one for each vertex. These are given in an order specified in the .aoff (usually conter-clockwise). So, for example, a triangle and a pentagon which share a side are shown below. 3 1 3 4 5 2 4 3 6 7 Here is some quick and dirty sample code to read in the .geom file: struct polygon { int nvert; /* Number of vertices in this polygon */ int *verts; /* Vertices in this polygon */ }; struct object { int npts; /* The number of points */ int npolys; /* The number of polygons */ int nsegs; /* The number of segments */ double *point x,*point y,*point z; - - - struct polygon *polys; }; int read geom file( char *geom file, struct object *obj ) - - - { FILE *fp; int i,j; if (!(fp = fopen(geom file,"r"))) /* Open the .geom file */ - return -1; /* Get header information */ fscanf(fp,"%d %d %d",&obj.npts,&obj.npolys,&obj.nsegs); /* ** Allocate room for the points. */ obj.point x = (double *)malloc(obj.npts*sizeof(double)); - obj.point y = (double *)malloc(obj.npts*sizeof(double)); - obj.point z = (double *)malloc(obj.npts*sizeof(double)); - for (i=0;i<obj.npts;++i) fscanf(fp,"%lf %lf %lf",&obj.point x[i], - &obj.point y[i], - &obj.point z[i]); - /* Allocate room for the polygons. */ obj.polys = (struct polygon *)malloc(obj.npolys*sizeof(struct polygon)); for (i=0;i<obj.npts;++i) { /* See how many vertices this has */ fscanf(fp,"%d",&obj.polys[i].nvert); /* Allocate room for vertices */ obj.polys[i].verts = (int *)malloc(obj.npolys*sizeof(int)); /* Get each vertex */ for (j=0;j<obj.polys[i].nvert;++j) fscanf(fp,"%d",&obj.polys[i].verts[j]); } } 3) How do I define space? There are several things to consider when picking a coordinate system. Most important of these is how you intend to handle objects. If your objects are defined in terms of <x,y,z> triplets, it will require a fair bit of work on reading them in to turn them into spherical coordinates. If you're looking to this FAQ for information on how to define the space your objects will be in, I'd strongly suggest using rectangular coordinates and some derivative of the OFF-format. For starters, let me just throw in that while our universe may be infinite in all directions, that doesn't make for good programming. We have to limit ourselves to small enough numbers that we can multiply them together without overflowing them, we can divide them without crashing our systems, and we can add them without accidentally flipping a sign bit. Now, the fun begins. The simplest form of defining the Universe is to flat out say that the Universe stretches over these coordinates, say in the bounding box of <-65536, -65536, -65536> to <65536, 65536, 65536>. This is often referred to as a Universal Coordinate system or an Absolute Coordinate system. Then, each object in the Universe will be centered about some coordinate in that range. This includes your viewpoint. Several strategies are available for dealing with the edge of the Universe. One can make the Universe wrap around so that an object leaving the cube at < X, Y, 65536> will re-appear in the Universe at < X, Y, -65536>. Or, one can make objects bounce or stop at the edge of the Universe. And, given any approach, one can have the edge of the Universe be transparent or opaque. In an Absolute Coordinate system, all objects must be shown from the position of your viewpoint. This involves lots of interesting math that we'll get into later. But, in general, an objects position with respect to you is it's absolute position - your absolute position (with all kinds of hell breaking loose if you can see past the edge of the Universe). Then, after this position is calculated, it must be rotated based on your orientation in the Universe. Another possibility for defining space is a Relative Coordinate system or a View-Centered Coordinate system. In this sort of system, the Viewpoint is always at coordinates <0,0,0> and everything else in the Universe is based relatively to this home position. This causes funky math to come into play when dealing with velocities of objects, but... it does wonders for not having to deal with the 'edge of the Universe'. This is the Schroedinger's cat method of the 'edge of the Universe'.... in the truest sense of out of sight is out of mind. Small provisions have to be made if objects aren't to wrap around. But... a Relative Coordinate system can be used to give the illusion of infinite space on a finite machine. (Yes, even your 486/66DX is finite). I'll leave spherical coordinates to a later version if people think they'll be of use... 4) How do I define position? Position in an Absolute Coordinate system is easy. Each object has three coordinates. These are often stored in a data-type called a vector to abstract further the notion that these numbers belong together. typedef struct { long x; long y; long z; } VECT; Usually, each object in the Universe is defined about its center with each coordinate on its surface being centered at its own <0,0,0>. This helps tremendously in rotating the object, and I would highly recommend this. Then, the object as a whole is given a position in space. When it comes time to draw this object, its points' coordinates get added on to its position. In a Relative Coordinate system, position is also fairly straight forward. The view-point always has position VECT={ 0, 0, 0 };. Other objects follow the same sort of system that they would in Absolute Coordinate systems. 5) How do I define orientation? Orientation can be quite tricky. I interchange some of the terms here quite often. In 3-space, orientation must be defined be two-and- a-half angles. "Two and a half?" you say. Well, almost everyone uses three because two just isn't enough, but if you want to be technical, one of those angles only has to range from 0 - 180 degrees (0 - PI/2 radians). But, taking that for granted now.... you have to pick an orientation for your view. I personally prefer to have the X-axis run >from left to right across the center of my screen. I also like to have the Y-axis run from the bottom of my screen; and I also like to have the Z-axis running from me straight into my screen. With some tweaking of plus and minus signs and a bit of re-ordering, all of the math here-in can be modified to reflect any orientation of the coordinate system. Some people prefer to have the Y-axis heading into the screen with the Z-axis going vertically. It's all a matter of how you want to define stuff. Given that you've agreed with me that Z can go into the screen, what 3-angles do you need? (Here's where I stand the biggest chance of mucking up the terms.) You need roll, pitch, and yaw. (I often mix up roll and yaw and such... so if you can follow along without getting locked into my terminology, future FAQ's will correct it.) Look at your monitor as you're reading this. Now tilt your head so that your right ear is on your right shoulder. This change in orientation is roll (or yaw... but I call it roll). Ok, now sit up straight again. Now bring your chin down to meet your chest. (Hmmm... LOOK BACK NOW!!!, whew... glad you heard me.) That motion was pitch. Ok, now look over your right shoulder keeping your head vertical to see who's behind you. (LOOK BACK AGAIN!!.) Ok... that was yaw (or roll, but I call it yaw). That's the basics. Now, what do I do with them? Well, here's where a nice book on Matrix Arithmetic will help you out. You have to use these three angles to make a Transformation matrix. [See the section on Matrix Math]. Here is a typical method of doing these transformations: [Note, if you don't have Z going into your screen you'll have to munge these considerably]. typedef double matrix[4][4]; double sr,sp,sy,cr,cp,cy; matrix mr, mp, my; /* individual transformations */ matrix s; /* final matrix */ sr = sin( roll ); cr = cos( roll ); sp = sin( pitch ); cp = cos( pitch ); sy = sin( yaw ); cy = cos( yaw ); /* clear all matrixes ** [See the section on Matrix Math] */ identity( &mr ); identity( &mp ); identity( &my ); /* prepare roll matrix */ mr[0][0] = mr[1][1] = cr; mr[1][0] = - (mr[0][1] = sr); /* prepare pitch matrix */ mp[1][1] = mp[2][2] = cp; mp[1][2] = - (mp[2][1] = sp); /* prepare yaw matrix */ my[0][0] = my[2][2] = cy; my[0][2] = - (my[2][0] = sy); multiply( &mr, &my, &s ); multiply( &s, &mp, &s ); 6) How do I define a velocity? Sticky question. I'll get to it in the next rev. 7) Drawing three-dimensional objects on a two-dimensional screen. Modified from comp.graphics FAQ: "There are many ways to do this. Some approaches map the viewing rectangle onto the scene, by shooting rays through each pixel center and assigning color according to the object hit by the ray. Other approaches map the scene onto the viewing rectangle, by drawing each object into the region, keeping track of which object is in front of which. The mapping mentioned above is also referred to as a 'projection', and the two most popular projections are perspective projection and parallel projection. For example, to do a parallel projection of a scene onto a viewing rectangle, you can just discard the Z coordinate, and 'clip' the objects to the viewing rectangle (discard portions that lie outside the region). To do a perspective projection, dividing each the x and the y by some multiple or the Z-depth is the usual approach. For details on 3D rendering, the Foley, van Dam, Feiner and Hughes book, reading. Chapter 6 is 'Viewing in 3D', and chapter 15 is 'Visible-Surface Determination'. For more information go to chapter 16 for shading, chapter 19 for clipping, and branch out from there." 8) Vector Math - Dot Product and Cross-Product. Adding and subtracting vectors is as easy as subtracting their respective parts: <A,B,C> + <D,E,F> = <A+D, B+E, C+F> <A,B,C> - <D,E,F> = <A-D, B-E, C-F> Scaling vectors is as simple as multiplying each part by a constant: S * <A,B,C> = <S*A, S*B, S*C> The Dot-Product of two vectors is simply the sum of the products of their respective parts: <A,B,C> . <D,E,F> = A*D + B*E + C*F Note that this value is not a vector. The Cross-Product of two vectors is a bit more complex (it is the determinant of the matrix with the direction vector as the first row, the first vector as the second row, and the second vector as the third row): <A,B,C> X <D,E,F> = <B*F - C*E, C*D - A*F, A*E - B*D> Note that: <A,B,C> X <D,E,F> = -1 * ( <D,E,F> X <A,B,C> ) -and- (<A,B,C> X <D,E,F>) . <A,B,C> = (<A,B,C> X <D,E,F>) . <D,E,F> = 0 More later. 9) Matrix Math The identity matrix is a square matrix (same number of rows as columns) with all elements {i,j} given by: { 1.0 if i == j m[i][j] = { { 0.0 otherwise Multiplication of matrices: if X is a matrix that is m rows and n columns (an m-by-n (or mxn) matrix) and Y is a matrix that is n rows and r columns (nxr), then the product X * Y ==> m[i][j] = sum{ a=0, a<n, X[i][a] * Y[a][j] }; As you can see in this example, the result is a matrix with m rows and r columns (an mxr) matrix. The most usual case in basic 3-d graphics is multiplication of 3x3 or 4x4 matrices to each other. Some important things to remember about matrix multiplication: (The following assume X and Y and Z are matrices and I is an identity matrix) X * Y rarely equals Y * X. but, X * ( Y * Z ) equals ( X * Y ) * Z X * I = I * X = X if (X * Y = I) then (Y * X = I) Multiplication of a Matrix and a Vector is simply a special case of multiplying two matrixes. It just so happens that a vector is a matrix with only one column. So, in order to multiply an mxn matrix by a vector, you have to have an nx1 matrix ("an n-vector" or "a vector in n"). The result is a vector in m. As a quick example: [ a b ] [ g ] [ a*g + b*h ] [ c d ] x [ h ] = [ c*g + d*h ] [ e f ] [ e*g + f*h ] 10) Collisions. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 11) Perspective. (Message nova:2746) From: Raul Deluth Miller <rockwell@nova.umd.edu> Perspective is easy: realize that the viewpoint isn't on the surface of the screen but is some distance back. Then, [a] convert to a relative coordinate system centered around the viewpoint, oriented so that x and y are like this: y | ----+----x | and z is the distance into the screen. Now, divide your coordinates by z. That's all. Ok, sure, you don't really have to call your directions x y and z, but that's just changing the description which fits the math. And, sure, you have to decide what to do about things that are "the other direction from the screen" -- but that's really something different. And, ok, you have to decide how many game units the viewpoint is, behind the screen [this is something you add to the z coordinate before dividing]. And, ok, maybe you want to scale things a bit to make it look nicer. But none of that is really all that hard to deal with. What's annoying is that you don't want to do division for every pixel that you draw on the screen. That means, for instance, that you might have a line where both ends are off the screen but part of the line [in the middle] are visible. However, that's related to the problem of detecting collisions. Or, better yet, clipping. Yeah, that's it take a look at the section on clipping... Raul D. Miller n =: p*q NB. prime p, q, e <rockwell@nova.umd.edu> NB. public e, n, y y =: n&|&(*&x)^:e 1 x -: n&|&(*&y)^:d 1 NB. 1 < (d*e) +.&<: (p,q) 12) Z-Buffering & the Painters Algorithm & BSP-Trees. There are several methods available for displaying polygons in a 3-d object so as to assure that what's behind is behind and what's in front is in front. Each, however, has its pros and cons. With each of these methods, it is often useful to implement backface culling. Backface culling is simply not rendering surfaces which aren't facing you. The Painter's Algorithm is probably the most intuitive for the beginner, one of the easiest to implement, and the hardest to get right. The Painter's Algorithm, quite simply, is Paint the from back to front. Once it has been determined which polygons will be drawn, it is necessary to sort them from furthest away to closest. Then, starting with the furthest polygon and moving to the closest, draw them. The tricky part of the Painter's Algorithm is determining when one polygon is closer or farther than another. The closest to satisfactory method I've found uses this criteria -- Surface A is further away then surface B if: 1) The furthest point of A is further away than the furthest point of B. 2) B faces you more directly than A. 3) The closest point of A is further than the closest point of B. 4) Surface B is more "important" than surface A. These are to be taken in order until a decision is reached. But, I've yet to find good enough criteria to work well on most objects that people design. If you keep these criteria in mind when making the objects, it can help. But, if you're using 3rd party objects, I'd suggest a different method. Z-Buffering is a buzzword that's finally come down to reality. It's been replaced by 'texture-mapping' and 'bump-mapping' and 'realtime raytracing' as the 'what's fancy' buzzword. Z-buffering is costly in terms of memory and processing time, but gives beautiful results. If you've got some freedom with your memory usage and a bit of processor time to spare, and you're ok with filling your own polygons, then Z- buffering may be for you. To Z-buffer, one keeps a 2d-array of numbers (shorts or ints usually) the same dimensions as the viewport. As each <X,Y,Z> point is prepared for display, the final value is compared to the Z value already in the <X,Y> position in the Z-buffer array. If the new Z is less than the one already in the buffer, the pixel-color is placed in the Screen- Buffer at position <X,Y> and the new Z is copied into position <X,Y> of the Z-Buffer. The expense of Z-Buffering is having to set each element to the MAX Z VALUE after each frame and keeping track of the Z-value for every - - pixel in the Screen Buffer and every pixel in the polygon you're drawing. In most applications, it is unnecessary to keep track of the Z-values of any more than the vertices of a polygon. And, my favorite of the bunch (but the nastiest to store in an object file, is BSP-trees. BSP-tree stands for Binary Space Partition tree. They are based the idea that surfaces of most objects don't change positions relative to each other. Objects whose surfaces change relative positions cannot be (to my knowledge) easily used with BSP- trees. The first step in using BSP-trees is to break up your object into a 'good' object. But, I can't think of a way to describe a 'good' object without just telling you how to make one. So, here's a general algorithm for making a BSP-tree object from ye average object: 1) Pick a surface to call the root node. 2) Compare every other surface in the set of surfaces to the root node. 3) If a surface is In-Front-Of the root node, then put it in the 'Front Heap'. If a surface is Behind the root node, then put it in the 'Back Heap'. If neither of the above is true, chop up the surface into smaller surfaces that are all either In-Front-Of or Behind the root node. (This is the tricky bit). 4) Repeat these steps with the 'Front Heap' and the 'Back Heap'. As an interesting note, I can see no advantage at all to trying to keep a relatively balanced tree. Now comes the interesting bit. Now that the object is a 'good' BSP-tree object, it is time for the drawing algorithm. This is fairly straight- forward. 1) Compare the root node with you. 2) If you are In-Front-Of the root node, draw 'Root->Back', then the Root surface, then 'Root->Front'. If you are Behind the root node, draw 'Root->Front', then the Root surface (unless you're backface culling), then 'Root->Back'. I fully admit that I didn't believe BSP-trees would work when I first read about them in Foley-van Dam, nor did I believe they would work after seeing them work for me. Now, three months later, I fully believe they work, and I can even say I understand why. I may soon attempt an explanation here, but suffice it for now to say, 'they can be grokked'. 13) Shading. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 14) 3-space clipping. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 15) 3-d scanning. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 16) Publically available source-code. Well, I've started a collection at ftp.csh.rit.edu::/pub/3dfaq/src. Feel free to upload relevant stuff (that I can't find on archie in under twenty minutes). Some other sites of interest: stereograms: ftp.comlab.ox.ac.uk::pub/Documents/3d http://enigma.phys.utk.edu/stereo/index.html Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 17) Books on the topics. Computer Graphics: Principles and Practice Foley, van Dam, Feiner, and Hughes; Addison Wesley -- Reading, Massachusetts; (c) 1990. ISBN 0-201-12110-7. I highly reccomend this book for the person seriously interested in understanding Computer Graphics concepts for 2-D image-generation and 3-D representation. As a warning though, if you're struggling to follow vector math and such, you might not spend the $60-$80 bucks on this one yet. Programming in 3 Dimensions Christopher D. Watkins and Larry Sharp; Barnes & Noble. I've never seen this book. I've got an add for it in front of me. (Sorry, no ISBN number listed). I would guess it's a very low- density version of some of the 3-D things from Foley. The book boasts sample source code on MS/PC-DOS floppy included. "This one is for all graphics enthusiasts who want a detailed look at 3-D graphics and modeling. Also features discussions of popular ray tracinge methods and computer animation." [sic] Computer Graphics Handbook: Geometry and Mathematics, Michael E. Mortenson. ISBN 0-8311-1002-3 I've never seen this one, but it comes net-recommended. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 18) Other forums. Sorry... This is a FAQ in-progress. Will do more later. Please feel free to send me a paragraph for this section. 19) Current Contents of Archive ftp.csh.rit.edu::/pub/3dfaq 2 -rw-r--r-- 1 pat member 219 Apr 2 20:40 README 16 -rw-r--r-- 1 pat member 7787 Mar 28 19:11 DoomTechniques.gz 10 -rw-r--r-- 1 pat member 4243 May 23 12:34 bsp.gz 14 -rw-r--r-- 1 pat vr 6266 Apr 2 20:38 imath.gz 22 -rw-r--r-- 1 pat vr 11262 Apr 2 20:43 imath.tar.gz -- To find out more about the random service, send mail to help@rANdom.PenIt.fo. Due to the double-random, any mail replies to this message will be randomized, and a random id will be allocated automatically. You have been warned. Please report any problems, inappropriate use etc. to admin@ranDoM.pIneT.fum.