用C++绘制的一朵逼真的玫瑰花
一、前言
时光匆匆逝，不过所幸自己依然未变，一如当初。在这三节(空军建军节+双十一节+光棍节)日，自己理应用所学的知识写点什么。那么写点什么呢？既然这一段时间正在上计算机图形学的课，外加自己目前仍在单身状态，那就索性用C++绘制一朵逼真的玫瑰花，赠给未来的你吧。
二、自己写的代码演示结果(详细代码在下面)
三、详细代码
#include <graphics.h>
#include <conio.h>
#include <math.h>
int rosesize = 500;
int h = -250;
struct DOT
{
double x;
double y;
double z;
double red;
double green;
};
bool calc(double a,double b,double c,DOT &d)
{
double j, n, o, w, z;
if(c > 60)
{
d.x = sin(a * 7) * (13 + 5 / (0.2 + pow(b * 4, 4))) - sin(b) * 50;
d.y = b * rosesize + 50;
d.z = 625 + cos(a * 7) * (13 + 5 / (0.2 + pow(b * 4, 4))) + b * 400;
d.red = a * 1 - b / 2;
d.green = a;
return true;
}
double A = a * 2 - 1;
double B = b * 2 - 1;
if(A * A + B * B < 1)
{
if(c > 37)
{
j = (int(c) & 1);
n = j ? 6 : 4;
o = 0.5 / (a + 0.01) + cos(b * 125) * 3 - a * 300;
w = b * h;
d.x = o * cos(n) + w * sin(n) + j * 610 - 390;
d.y = o * sin(n) - w * cos(n) + 550 - j * 350;
d.z = 1180 + cos(B + A) * 99 - j * 300;
d.red = 0.4 - a * 0.1 + pow(1 - B * B, -h * 6) * 0.15 - a * b * 0.4 + cos(a + b) / 5 + pow(cos((o * (a + 1) + (B > 0 ? w : -w)) / 25), 30) * 0.1 * (1 - B * B);
d.green = o / 1000 + 0.7 - o * w * 0.000003;
return true;
}
if(c > 32)
{
c = c * 1.16 - 0.15;
o = a * 45 - 20;
w = b * b * h;
z = o * sin(c) + w * cos(c) + 620;
d.x = o * cos(c) - w * sin(c);
d.y = 28 + cos(B * 0.5) * 99 - b * b * b * 60 - z / 2 - h;
d.z = z;
d.red = (b * b * 0.3 + pow((1 - (A * A)), 7) * 0.15 + 0.3) * b;
d.green = b * 0.7;
return true;
}
o = A * (2 - b) * (80 - c * 2);
w = 99 - cos(A) * 120 - cos(b) * (-h - c * 4.9) + cos(pow(1 - b, 7)) * 50 + c * 2;
z = o * sin(c) + w * cos(c) + 700;
d.x = o * cos(c) - w * sin(c);
d.y = B * 99 - cos(pow(b, 7)) * 50 - c / 3 - z / 1.35 + 450;
d.z = z;
d.red = (1 - b / 1.2) * 0.9 + a * 0.1;
d.green = pow((1 - b), 20) / 4 + 0.05;
return true;
}
return false;
}
void main()
{
short*zBuffer;
intx, y, z, zBufferIndex;
DOTdot;
initgraph(640, 480);
setbkcolor(WHITE);
cleardevice();
zBuffer = new short[rosesize * rosesize];
memset(zBuffer, 0, sizeof(short) * rosesize * rosesize);
for(int j = 0; j < 2000 && !_kbhit(); j++)
{
for(int i = 0; i < 10000; i++)
if(calc(double(rand()) / RAND_MAX, double(rand()) / RAND_MAX, rand() % 46 / 0.74, dot))
{
z = int(dot.z + 0.5);
x = int(dot.x * rosesize / z - h + 0.5);
y = int(dot.y * rosesize / z - h + 0.5);
if (y >= rosesize) continue;
zBufferIndex = y * rosesize + x;
if(!zBuffer[zBufferIndex] || zBuffer[zBufferIndex] > z)
{
zBuffer[zBufferIndex] = z;
int red = ~int((dot.red * h));
if (red < 0)
red = 0;
if (red > 255)
red = 255;
int green = ~int((dot.green * h));
if (green < 0)
green = 0;
if (green > 255)
green = 255;
int blue = ~int((dot.red * dot.red * -80));
if (blue < 0)
blue = 0;
if (blue > 255)
blue = 255;
putpixel(x + 50, y - 20, RGB(red, green, blue));
}
}
Sleep(1);
}
delete []zBuffer;
getch();
closegraph();
}
四、备注
自己改编自学习JavaScript的一份算法。主要参考资料，链接如下：http://wenku.baidu.com/link?url=xof189CH7mFYI9sMMYXCPdylk-3awad00gGx5RxILp9jhsERUbvz2qm-GR62NcAHJgbmqDYThicbsOlZoE0VyvhGCh5ulx0ldF3mcBLXV4W
