3d.htm

关于windows游戏编程的一些文章还有相关图形

<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>sin(a)</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>cos(a)</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>1</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
</TABLE>
</center>

<P>Matrix to rotate around z axis:

<center>
<TABLE BORDER=0>
<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>1</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>cos(a)</TD>
<TD ALIGN=CENTER>-sin(a)</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>sin(a)</TD>
<TD ALIGN=CENTER>cos(a)</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
<TR>
<TD ALIGN=CENTER>[</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>0</TD>
<TD ALIGN=CENTER>1</TD>
<TD ALIGN=CENTER>]</TD>
</TR>
</TABLE>
</center>

<p>Note: When you calculate the cos and sin, the functions use radians.  Therefore, you must convert from degrees to radians.  The equation to convert degrees to radians is angle*PI/180.

<P>You will experiment some problems in your rotations if you keep the code as is is to rotate your points in all axis.  The reason is, once you calculated the Z and X in the yaw rotation, you must use those new coordinates into your y rotation and z rotation.. and so on.  To avoid this problem, I created some temporary variables that act as the new X, Y, and Z.  These new X, Y, and Z variables are then used in the next rotations.  Follow the  ',","' used to differenciate from the original x,y,and z.

<H3><FONT COLOR=YELLOW><I>Perspective View</I></FONT></H3>

<P>Perspective view is composed of two things: converting 3D coordinates into 2D coordinates (screen), and making the perspective view.  To convert 3D to 2D, there is a simple equation:

<BLOCKQUOTE>
<PRE><FONT SIZE=2 COLOR=RED>
	X = x / z
	Y = y / z
</FONT></PRE>
</BLOCKQUOTE>

<P>Where X, Y are your coordinates on the screen, and x,y,z is a 3D point.

<P>The next part, making the perspective view.  To explain this concept, look into a shiny door knob.  See how your nose is 2x bigger than normal, and the rest of your face is smaller than normal.  This is the fish eye concept.  Having a fish eye view, is like an exaggerated perspective view.  That is, things that are closer become bigger, and things that are farther become smaller.  This concept is used to make 3D games look 3D and not flat.  Although your screen is flat, perspective view creates a depth into your screen.  To do this, you multiply the x and y by the width of your screen in pixels.  That is if you are using 320x200 resolution, you would multiply it by 320, so your formula becomes:<p>

<BLOCKQUOTE>
<PRE><FONT SIZE=2 COLOR=RED>
	X = 320 * x / z
	Y = 320 * y / z
</FONT></PRE>
</BLOCKQUOTE>

<P>The reason why I choose the screen width is because it has to do with how far your face is from the screen.  Have you ever tried while playing a 3D game to brind your head really close to the screen and really far from the screen?  What you will notice is that the game does not look real anymore.  It either looks fish eye (too close) or flat (too far).  Using the screen width is a good ratio.  That means your head is about a foot away from the screen, which is reasonably good.

<H3><FONT COLOR=YELLOW><I>Z-Sort</I></FONT></H3>

<P>When you finally draw your polygons, they must be in an order from furthest to closest.  If this isn't dont, your objects wont even look like they really are because the back faces are being drawn after the front faces.  There are many ways to sort them.  The easiest would be to take every center of every object and sort that and draw the objects in that order.  But this isn't precise enough.  So I took every face on every object and threw them into a huge array.  Then I sort them.  You might ask how would I determine which face belongs to which object after it is sorted?  Well I developed a simple algorithm.

<P>To identify which face I am looking at, I multiply the object number (that I'm currently looking at) with MAXFACES+1 (that is the maximum amount of faces a polygon can have) and add the face number.  This means that if I'm looking at face 5 on object 3 and MAXFACES was 16 it would be 3*(16+1)+5 = 56.

<P>So to find this face with 56 is the same but do the opposite.  That is substract MAXFACES+1 until the number is smaller than MAXFACES+1 and that will give you the object you are looking at.  then what is left is your face number.

<P>This will sometimes cause some faces to be drawn in the wrong order.  To go even further you can divide every face  into smaller pieces and sort that.  If this isn't precise enough, you can sort by pixels.  This is the most precise way, but also the slowest.

<H3><FONT COLOR=YELLOW><I>Z-Buffering</I></FONT></H3>

<P>Blasting your way to fame and glory in one of the latest 3-D computer games,
it might not enter your mind that the world being presented to you on the
computer sceen is not real -- but virtual -- and that every element therein
is simulated. &nbsp;The programmers went to great extremes making sure that
you stopped correctly when you ran into a wall, that you fell when jumping
from a height, and that closer objects correctly obscure objects in the distance.
&nbsp;The former two illusions are created by collision detection and physics
simulation, respectively, whereas the latter is created through one of a
number of visual surface determination (VSD) algorithms, which deal with
the tricky problem of determining which parts of a world are visibile from
a given viewpoint.

<P>Computer games primarily use one of three VSD algorithms: BSP trees, depth
sorting, and z-buffering. &nbsp;BSP trees partition a scene according to
the plane of polygons, enabling correct sorting of static polygons. &nbsp;Depth
sorting (of the traditional variety), sorts polygons according to their depth,
displaying them in back to front order. &nbsp;Z-buffering performs VSD at
the pixel level, testing the depth of each pixel in every polygon against
the depth of the pixel previously written to the same location.

<P>BSP trees are good for static polygons, but are difficult to use in moving
environments. &nbsp;Depth sorting produces ugly artifacts which are difficult
to resolve (obviously, just sorting polygons won't do any good if you have
an array of overlapping or intersecting polygons). &nbsp;In contrast to these
algorithms, the z-buffer algorithm allows for dynamic scenes and overlapping,
intersecting polygons. &nbsp;The only disadvantage: in a software implementation,
it consumes memory and processor time.

<P>The Z-buffer algorithm interpolates z (or 1/z) coordinates across polygon
rows as the polygons are being rasterized, and compares them to the z (or
1/z) values in a z-buffer. &nbsp;If the new values are closer to the viewer
than the old ones, than the old pixel is replaced and the new value is stored
in the z-buffer. &nbsp;Simple, elegant, but not exactly fast.

<P>Today's hardware for 3D acceleration usually supports z-buffering in hardware.
&nbsp;This enables applications to gain all the luxuries of the z-buffer
without the time-consuming overhead.

<P>Since Z-buffering supports features like polygon intersection, if you're
designing a game that will support Direct3D, QuickDraw 3D, or your own custom
library that supports z-buffers, you can have your artists design scenes
to take advantage of this fact. &nbsp;For example, instead of using four
polygons to create the letter 'X', you could use two.

<P>If your target platform is unaccelerated, then you definitely want to provide
your own z-bufferer. &nbsp;The ones in Direct3D are just too slow to be of
any use. &nbsp;I recommend interpolating fixed-point numbers (integers that
can represent real numbers) and using at the very least the clear reduction
optimization, both documented in my book Cutting Edge 3-D Game Programming with C++.</P>

<!--Bottom Navigation-->
<A NAME="bottom"></A>
<!--End Bottom Navigation-->
</STRONG>
</FONT>
<!--End Body-->
<!--Bottom-->
<BR>
<IMG SRC="gradbar.jpg">
<BR>
<FONT SIZE=2 COLOR=#8B8B8B FACE=Helvetica>
<I><font color="#FBFBFB">T</font><font color="#F7F7F7">h</font><font color="#F3F3F3">e</font><font color="#EFEFEF"> </font><font color="#EBEBEB">G</font><font color="#E7E7E7">a</font><font color="#E3E3E3">m</font><font color="#DFDFDF">e</font><font color="#DBDBDB"> </font><font color="#D7D7D7">P</font><font color="#D3D3D3">r</font><font color="#CFCFCF">o</font><font color="#CBCBCB">g</font><font color="#C7C7C7">r</font><font color="#C3C3C3">a</font><font color="#BFBFBF">m</font><font color="#BBBBBB">m</font><font color="#B7B7B7">i</font><font color="#B3B3B3">n</font><font color="#AFAFAF">g</font><font color="#ABABAB"> </font><font color="#A7A7A7">M</font><font color="#A3A3A3">e</font><font color="#9F9F9F">g</font><font color="#9B9B9B">a</font><font color="#979797">S</font><font color="#939393">i</font><font color="#8F8F8F">t</font><font color="#8B8B8B">e</font> -