資源簡介
絕對能運行的通,計算機圖形學的邊界標志算法。根據張彩明課本上的算法寫的。
代碼片段和文件信息
import?java.awt.*;
import?java.applet.*;
import?java.awt.image.*;
class?Point
{
public?int?x;
public?int?y;
public?Point(int?cxint?cy)
{
x=cx;
y=cy;
}
}
public??class?draw?extends?applet?
{
??int?red=Color.blue.getRGB();
??int??yymaxyminw=200h=200;
??Image?image1;
??Image?image2;
??int??pixels1[]=new?int[w*h];
??int??pixels2[]=new?int[w*h];
??double?x;
??double?dydx;
??Point?[]p=new?Point[10];
??public?void?init()
??{
??????for(int?m=0;m ??????{
??????????pixels1[m]=Color.black.getRGB();
??????}
??????for(int?m=0;m ??????{
??????????pixels2[m]=Color.black.getRGB();
??????}
??????p[0]=new?Point(2050);
??????p[1]=new?Point(20100);
??????p[2]=new?Point(9060);
??????p[3]=new?Point(16090);
??????p[4]=new?Point(16040);
??????p[5]=new?Point(12020);
??????p[6]=new?Point(7020);
??????p[7]=p[0];?
???}
?public?Image?boundary()
???{
????for(int?i=0;i<7;i++)
????{
?????dy=p[i+1].y-p[i].y;?????
?????if(dy!=0)
?????{
???????dx=(p[i+1].x-p[i].x)/dy;
???????if(dy>0)?x=p[i].x;
???????else??x=p[i+1].x;
???????ymax=(Math.max(p[i].yp[i+1].y));
???????ymin=(Math.min(p[i].yp[i+1].y));
???????for(y=ymin+1;y<=ymax;y++)
?
- 上一篇:hibernate.jar
- 下一篇:servlet jar包
評論
共有 條評論