计算机图形学computergraphics课件6.pptVIP

* Surface vs Volume Subdvision In our example, we divided the surface of each face We could also divide the volume using the same midpoints The midpoints define four smaller tetrahedrons, one for each vertex Keeping only these tetrahedrons removes a volume in the middle See text for code * subdivision code void divide_tetra(GLfloat *a, GLfloat *b, GLfloat *c, GLfloat *d, int m) { GLfloat mid[6][3]; int j; if(m0) { /* compute six midpoints */ for(j=0; j3; j++) mid[0][j]=(a[j]+b[j])/2; for(j=0; j3; j++) mid[1][j]=(a[j]+c[j])/2; for(j=0; j3; j++) mid[2][j]=(a[j]+d[j])/2; for(j=0; j3; j++) mid[3][j]=(b[j]+c[j])/2; for(j=0; j3; j++) mid[4][j]=(c[j]+d[j])/2; for(j=0; j3; j++) mid[5][j]=(b[j]+d[j])/2; /* create 4 tetrahedrons by subdivision */ divide_tetra(a,mid[0],mid[1],mid[2], m-1); divide_tetra(mid[0],b,mid[3],mid[5], m-1); divide_tetra(mid[1],mid[3],c,mid[4], m-1); divide_tetra(mid[2],mid[4],d,mid[5], m-1); } else tetra(a,b,c,d); /* draw tetrahedron at end of recursion */ } * Volume Subdivision Plotting implicit functions 2D: f(x,y)=0; 3D: f(x,y,z)=0; Sphere x^2+y^2+z^2-1=0; Advantages: Smooth Can easily to decide one point is in implicit surface or not Topology change freely Disadvantage Hard to render, ray casting is slow * Plotting implicit functions Solving method: Polygonization (Marching cubes) * 2D: Marching Squares * 2D: Marching Squares * 2D: Marching Squares * 2D: Marching Squares x=xi+(a-c)△x/(a-b) * 2D: Marching Squares f(x,y)=(x^2+y^2+a^2)^2-4a^2x^2-b^4 a=0.49, b=0.5 * Sampling on implicit surface * f=x^4-10*r^2*x^2+y^4-10*r^2*y^2+z^4-10*r^2*z^2 r=0.13 Sampling on implicit surface * Sampling on implicit surface * Sampling on implicit surface * Shell space triangulation * Marching cubes * * Programming with OpenGLPart 3: Three Dimensions Yuanfeng Zhou Shandong University * Review Keywords: Development State machine Functions (formats), callback function Simple cube program Simple viewing Ope