46.1 数学推导
书上有给出超级椭圆面的方程：
同时也给出了参考图：
只有当足够接近真实值时，迭代才会收敛，才能求得满足精确条件的方程解。
对于超级椭圆，我们采用的的迭代初值是光线于如下四个长方体交点的t_near, t_far的值：
vertex_l[0] = vec3(center.x()-intercept_x, center.y()-intercept_y, center.z()-intercept_z);
vertex_h[0] = vec3(center.x()+intercept_x, center.y()+intercept_y, center.z()+intercept_z);
vertex_l[1] = vec3(center.x()-intercept_x/2, center.y()-intercept_y, center.z()-intercept_z);
vertex_h[1] = vec3(center.x()+intercept_x/2, center.y()+intercept_y, center.z()+intercept_z);
vertex_l[2] = vec3(center.x()-intercept_x, center.y()-intercept_y/2, center.z()-intercept_z);
vertex_h[2] = vec3(center.x()+intercept_x, center.y()+intercept_y/2, center.z()+intercept_z);
vertex_l[3] = vec3(center.x()-intercept_x, center.y()-intercept_y, center.z()-intercept_z/2);
vertex_h[3] = vec3(center.x()+intercept_x, center.y()+intercept_y, center.z()+intercept_z/2);
其中intercept_x, intercept_y, intercept_z分别为“式子三”中的a1, a2, a3。对应的四个box如下图：
注意：迭代得到的方程解的大小和迭代初值的大小是没有关系的。
不存在：初值越大，方程的解越大。然后以此来确定方程的大根和小根，是不对的。
这里，我们只求一个根（管他大根还是小根。这种做法欠妥：实际需要的是小根，但是求出来的根不确定是大根还是小根。此处留个bug）。
46.2 看C++代码实现
----------------------------------------------superellipsoid.h ------------------------------------------
superellipsoid.h
#ifndef SUPERELLIPSOID_H
#define SUPERELLIPSOID_H
#include <hitable.h>
#include "material.h"
#include "log.h"
class superellipsoid : public hitable
{
public:
superellipsoid() {}
superellipsoid(vec3 cen, float a1, float a2, float a3, float e1, float e2, int in, float tol, material *m) :
center(cen), intercept_x(a1), intercept_y(a2), intercept_z(a3), p_e1(e1), p_e2(e2),
initial_number(in), tolerance(tol), ma(m) {}
/*
f(x,y,z)=( (x/a1)^(2/e2) + (z/a3)^(2/e2) )^(e2/e1) + (y/a2)^(2/e1) -1 = 0
in: initial number
tol: tolerance
*/
virtual bool hit(const ray& r, float tmin, float tmax, hit_record& rec) const;
vec3 center;
float intercept_x, intercept_y, intercept_z;
float p_e1, p_e2;
int initial_number;
float tolerance;
material *ma;
};
#endif // SUPERELLIPSOID_H
----------------------------------------------superellipsoid.cpp ------------------------------------------
superellipsoid.cpp
#include "superellipsoid.h"
#include <iostream>
#include <limits>
#include "float.h"
#include "log.h"
using namespace std;
bool ray_hit_box(const ray& r, const vec3& vertex_l, const vec3& vertex_h, float& t_near, float& t_far) {
/*若光线撞击到box，则可以得到t_near, t_far。我们有四个box，所以会四次调用该函数。该函数的算法，参考“33.2”*/
t_near = (numeric_limits<float>::min)();
t_far = (numeric_limits<float>::max)();
vec3 direction = r.direction();
vec3 origin = r.origin();
vec3 bl = vertex_l;
vec3 bh = vertex_h;
float array1[6];
if(direction.x() == 0) {
if((origin.x() < bl.x()) || (origin.x() > bh.x())) {
#if SUPERELLIPSOID_LOG == 1
std::cout << "the ray is parallel to the planes and the origin X0 is not between the slabs. return false" <<endl;
#endif // SUPERELLIPSOID_LOG
return false;
}
array1[0] = (numeric_limits<float>::min)();
array1[1] = (numeric_limits<float>::max)();
}
if(direction.y() == 0) {
if((origin.y() < bl.y()) || (origin.y() > bh.y())) {
#if SUPERELLIPSOID_LOG == 1
std::cout << "the ray is parallel to the planes and the origin Y0 is not between the slabs. return false" <<endl;
#endif // SUPERELLIPSOID_LOG
return false;
}
array1[2] = (numeric_limits<float>::min)();
array1[3] = (numeric_limits<float>::max)();
}
if(direction.z() == 0) {
if((origin.z() < bl.z()) || (origin.z() > bh.z())) {
#if SUPERELLIPSOID_LOG == 1
std::cout << "the ray is parallel to the planes and the origin Z0 is not between the slabs. return false" <<endl;
#endif // SUPERELLIPSOID_LOG
return false;
}
array1[4] = (numeric_limits<float>::min)();
array1[5] = (numeric_limits<float>::max)();
}
if((direction.x() != 0) && (direction.y() != 0) && (direction.z() != 0)) {
array1[0] = (bl.x()-origin.x())/direction.x();
array1[1] = (bh.x()-origin.x())/direction.x();
array1[2] = (bl.y()-origin.y())/direction.y();
array1[3] = (bh.y()-origin.y())/direction.y();
array1[4] = (bl.z()-origin.z())/direction.z();
array1[5] = (bh.z()-origin.z())/direction.z();
}
for (int i=0; i<6; i=i+2){
if(array1[i] > array1[i+1]) {
float t = array1[i];
array1[i] = array1[i+1];
array1[i+1] = t;
}
#if SUPERELLIPSOID_LOG == 1
std::cout << "array1[" << i << "]:" << array1[i] <<endl;
std::cout << "array1[" << i+1 << "]:" << array1[i+1] <<endl;
#endif // SUPERELLIPSOID_LOG
if(array1[i] >= t_near) {t_near = array1[i];}
if(array1[i+1] <= t_far) {t_far = array1[i+1];}
if(t_near > t_far) {
#if SUPERELLIPSOID_LOG == 1
std::cout << "No.(0=X;2=Y;4=Z):" << i << " :t_near > t_far. return false" <<endl;
#endif // SUPERELLIPSOID_LOG
return false;
}
if(t_far < 0) {
#if SUPERELLIPSOID_LOG == 1
std::cout << "No.(0=X;2=Y;4=Z):" << i << " :t_far < 0. return false" <<endl;
#endif // SUPERELLIPSOID_LOG
return false;
}
}
if (t_near != t_near) {
t_near = t_near * 1;
}
return true;
}
bool get_superellipsoid_function_and_derivative(float a1, float a2, float a3, float e1, float e2, float xo, float yo, float zo, float xd, float yd, float zd, double t, double& f, double& fd) {
/*这个函数就是求“式子三”（g(t)）和“式子五”（g’(t)）*/
double a1_r = double(a1);
double a2_r = double(a2);
double a3_r = double(a3);
double e1_r = double(e1);
double e2_r = double(e2);
double xo_r = double(xo);
double yo_r = double(yo);
double zo_r = double(zo);
double xd_r = double(xd);
double yd_r = double(yd);
double zd_r = double(zd);
double pow_x, pow_y, pow_z, pow_x_d, pow_y_d, pow_z_d;
double xd_a1, yd_a2, zd_a3;
/*注意到“式子五”中有三处正负号需要判断*/
if ((xo_r+xd_r*t) < 0) {
xd_a1 = -xd_r/a1_r;
}
else {
xd_a1 = xd_r/a1_r;
}
if ((yo_r+yd_r*t) < 0) {
yd_a2 = -yd_r/a2_r;
}
else {
yd_a2 = yd_r/a2_r;
}
if ((zo_r+zd_r*t) < 0) {
zd_a3 = -zd_r/a3_r;
}
else {
zd_a3 = zd_r/a3_r;
}
/*这里零值的判断，是避免pow()函数计算报错*/
if ((xo_r+xd_r*t) == 0) {/**/
pow_x = 0;
pow_x_d = 0;
}
else {
pow_x = pow(fabs(xo_r/a1_r + xd_r*t/a1_r), (2/e2_r));
pow_x_d = pow(fabs(xo_r/a1_r + xd_r*t/a1_r), ((2/e2_r)-1));
}
if ((yo_r+yd_r*t) == 0) {
pow_y = 0;
pow_y_d = 0;
}
else {
pow_y = pow(fabs(yo_r/a2_r + yd_r*t/a2_r), (2/e1_r));
pow_y_d = pow(fabs(yo_r/a2_r + yd_r*t/a2_r), ((2/e1_r)-1));
}
if ((zo_r+zd_r*t) == 0) {
pow_z = 0;
pow_z_d = 0;
}
else {
pow_z = pow(fabs(zo_r/a3_r + zd_r*t/a3_r), (2/e2_r));
pow_z_d = pow(fabs(zo_r/a3_r + zd_r*t/a3_r), ((2/e2_r)-1));
}
/*下面的f即为“式子三”，fd即为“式子五”*/
if ((pow_x+pow_z) == 0) {
f = pow_y - 1;
fd = (2/e1_r)*pow_y_d*yd_a2;
}
else {
f = pow(pow_x+pow_z, (e2_r/e1_r)) + pow_y - 1;
fd = (2/e1_r)*(pow(pow_x+pow_z, ((e2_r/e1_r)-1))*(pow_x_d*xd_a1+pow_z_d*zd_a3) + pow_y_d*yd_a2);
}
return true;
}
bool get_roots_by_newton_iteration(const ray& r, vec3 c, float a1, float a2, float a3, float e1, float e2, int in, float tol, float x0[9], float (&roots)[2]) {
/*这个函数实现“牛顿迭代法”*/
float xo = r.origin().x() - c.x();
float yo = r.origin().y() - c.y();
float zo = r.origin().z() - c.z();
float xd = r.direction().x();
float yd = r.direction().y();
float zd = r.direction().z();
double t_k, t_k1, ft_k, ft_d_k;
int j=0, in_r;
if (in > int(x0[0])) {
in_r = int(x0[0]);
}
else {
in_r = in;
}
for (int i=1; i<in_r; i++) {//通过x0传进来若干个迭代初值
t_k = double(x0[i]);
for (int k=0; k<50; k++) {//最多迭代50次
if (!(isnan(t_k))) {
/*计算过程中可能出现nan的情况，所以此处加这个条件*/
get_superellipsoid_function_and_derivative(a1, a2, a3, e1, e2, xo, yo, zo, xd, yd, zd, t_k, ft_k, ft_d_k);
if ((ft_d_k != 0) && !(isnan(ft_k)) && !(isnan(ft_d_k))) {
t_k1 = t_k - ft_k/ft_d_k;/*这个是迭代格式，对应“式子四”*/
// if (fabs(t_k1) >= 1) {
if (fabs((t_k1 - t_k)/t_k1) < tol) {
//判断迭代后的值是否在误差范围内
roots[j+1] = float(t_k1);
j++;
break; //若在误差范围内，此次迭代结束；根的个数+1
}
else {
t_k = t_k1;
//若不在误差范围内，将迭代后的值作为下一次迭代初值，进行下一次迭代
}
}
else {
break;
}
}
else {
break;
}
}
if (j == 1) {//求得一个解，就推出。这个解不知道是大根还是小根
break;
}
}
roots[0] = float(j);
if (j == 0) {
}
return true;
}
bool superellipsoid::hit(const ray& r, float t_min, float t_max, hit_record& rec) const {
#if SUPERELLIPSOID_LOG == 1
std::cout << "-------------superellipsoid::hit----------------" << endl;
#endif // SUPERELLIPSOID_LOG
vec3 vertex_l[4], vertex_h[4];
vertex_l[0] = vec3(center.x()-intercept_x, center.y()-intercept_y, center.z()-intercept_z);
vertex_h[0] = vec3(center.x()+intercept_x, center.y()+intercept_y, center.z()+intercept_z);
vertex_l[1] = vec3(center.x()-intercept_x/2, center.y()-intercept_y, center.z()-intercept_z);
vertex_h[1] = vec3(center.x()+intercept_x/2, center.y()+intercept_y, center.z()+intercept_z);
vertex_l[2] = vec3(center.x()-intercept_x, center.y()-intercept_y/2, center.z()-intercept_z);
vertex_h[2] = vec3(center.x()+intercept_x, center.y()+intercept_y/2, center.z()+intercept_z);
vertex_l[3] = vec3(center.x()-intercept_x, center.y()-intercept_y, center.z()-intercept_z/2);
vertex_h[3] = vec3(center.x()+intercept_x, center.y()+intercept_y, center.z()+intercept_z/2);
float roots[2], x0_near[9];
float t_near = 0;
float t_far = 0;
int num_t = 0;
float ts[9];
for (int i=0; i<4; i++) {
//求出光线与四个box相交的四组t_near, t_far。（不一定和每个box都相交）
if (ray_hit_box(r, vertex_l[i], vertex_h[i], t_near, t_far)) {
ts[num_t+1] = t_near;
ts[num_t+2] = t_far;
num_t = num_t + 2;
}
}
ts[0] = float(num_t);
if (ts[0] > 0.0001) {
float temp_t;
for (int i=1; i<int(ts[0]); i++) {//对所有的t_near, t_far进行从小到大的排序
for (int j=i+1; j<int(ts[0])+1; j++) {
if (ts[i] > ts[j]) {
temp_t = ts[i];
ts[i] = ts[j];
ts[j] = temp_t;
}
}
}
int num_tss = 1;
float tss[9];
tss[1] = ts[1];
for (int i=2; i<int(ts[0]); i++) {
//剔除数组中相同的值：各组t_near, t_far之间会有重合。
if ((ts[i] - tss[num_tss]) >= 0.001) {
tss[num_tss+1] = ts[i];
num_tss++;
}
}
tss[0] = float(num_tss);
if (tss[0] > 0.0001) {
for (int i=1; i<(int(tss[0])+1); i++) {
x0_near[i] = tss[i];
}
}
x0_near[0] = float(num_tss);
get_roots_by_newton_iteration(r, center, intercept_x, intercept_y, intercept_z, p_e1, p_e2, initial_number, tolerance, x0_near, roots);
}
float temp;
if (roots[0] > 0.0001) {
for (int i=1; i<int(roots[0]); i++) {
//这里是对所有根进行排序。其实只求了一个根，这小段code是多余的。
for (int j=i+1; j<int(roots[0])+1; j++) {
if (roots[i] > roots[j]) {
temp = roots[i];
roots[i] = roots[j];
roots[j] = temp;
}
}
}
double nx, ny, nz, pow_x, pow_z, pow_x_d, pow_z_d, pow_y_d, pow_x_z_d;
float d_a1 = intercept_x;
float d_a2 = intercept_y;
float d_a3 = intercept_z;
vec3 pc;
for (int k=1; k<int(roots[0])+1; k++) {
if (roots[k] < t_max && roots[k] > t_min) {
rec.t = roots[k];
rec.p = r.point_at_parameter(rec.t);
/*接下来求法向量，对应上面“式子二”。主要pow()函数有本身的限制：基数小于0时，指数不能为非整数；基数不能等于0；计算结果可能超出数据类型对应的最大值。*/
pc = rec.p - center;
if (pc.x() < 0) {d_a1 = -intercept_x;}
if (pc.y() < 0) {d_a2 = -intercept_y;}
if (pc.z() < 0) {d_a3 = -intercept_z;}
if (pc.x() == 0) {
pow_x = 0;
pow_x_d = 0;
}
else {
pow_x = pow(double(fabs(pc.x()/d_a1)), double(2/p_e2));
pow_x_d = pow(double(fabs(pc.x()/d_a1)), double(2/p_e2-1));
}
if (pc.y() == 0) {
pow_y_d = 0;
}
else {
pow_y_d = pow(double(fabs(pc.y()/d_a2)), double(2/p_e1-1));
}
if (pc.z() == 0) {
pow_z = 0;
pow_z_d = 0;
}
else {
pow_z = pow(double(fabs(pc.z()/d_a3)), double(2/p_e2));
pow_z_d = pow(double(fabs(pc.z()/d_a3)), double(2/p_e2-1));
}
if ((pow_x+pow_z) == 0) {
pow_x_z_d = 0;
}
else {
pow_x_z_d = pow(pow_x+pow_z, double(p_e2/p_e1-1));
}
nx = double(2/p_e1) * pow_x_z_d * pow_x_d / d_a1;
ny = double(2/p_e1) * pow_y_d / d_a2;
nz = double(2/p_e1) * pow_x_z_d * pow_z_d / d_a3;
if (isnan(nx)) {
/*这句code只是为了设置断点拦截nx出现nan的情况，以便分析。不过，此处的断点停得不太准，貌似*/
nx = nx * 1;
}
/*因为后面需要将法向量保存为float，所以先标准化一下*/
nx = nx/sqrt(nx*nx+ny*ny+nz*nz);
ny = ny/sqrt(nx*nx+ny*ny+nz*nz);
nz = nz/sqrt(nx*nx+ny*ny+nz*nz);
rec.normal = unit_vector(vec3(float(nx), float(ny), float(nz)));
if(dot(r.direction(), rec.normal) > 0) {
rec.normal = - rec.normal;
}
rec.mat_ptr = ma;
rec.u = -1.0;
rec.v = -1.0;
return true;
}
}
return false;
}
else {
return false;
}
return false;
}
----------------------------------------------main.cpp ------------------------------------------
main.cpp
hitable *list[1];
list[0] = new superellipsoid(vec3(0, 3, 0), 3, 4.5, 3, 1, 1, 6, 0.0001, new lambertian(vec3(0.0, 1.0, 0.0)));
hitable *world = new hitable_list(list,1);
vec3 lookfrom(10, 20, 20);
vec3 lookat(0, 3, 0);
float dist_to_focus = (lookfrom - lookat).length();
float aperture = 0.0;
camera cam(lookfrom, lookat, vec3(0,1,0), 30, float(nx)/float(ny), aperture, 0.7*dist_to_focus);
输出图片如下：
e1=1, e2=1,
e1=0.5, e2=1,
e1=0.1, e2=1,
e1=0.1, e2=0.1,
e1=0.1, e2=2,
e1=0.5, e2=2,
e1=1, e2=2,
e1=1, e2=4,
e1=0.1, e2=4,
e1=0.1, e2=3,
e1=2, e2=4,
e1=3, e2=4,
e1=4, e2=4,
e1=4, e2=2,
e1=4, e2=1
e1=2, e2=4,
e1=2, e2=2,
e1=2, e2=1,
46.3 问题分析
根少了：原因一，误差太小；原因二，迭代初值离真实值太远。
根多了：原因一，误差太大。
前面之所以要选四个box，而不是一个或者2两个，原因就是对于某些像素点，迭代初始值离真实值太远，导致迭代无法收敛，导致无法求得方程的解，导致解少了。
如下这组图片，可以看出初始值对图片效果的影响（这组图片是“问题四十七”的）：
只有最大的box，且只用t_near时的图片：
4个box，且只用t_near时的图片：
4个box，且用t_near和t_far时的图片：
接下来，这组图片，我们可以看看误差对图片的影响：
e1=0.1, e2=4,误差0.00001
e1=0.1, e2=4,误差0.0001
e1=0.1, e2=4,误差0.001
扫一扫
2175
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
