C# Класс ImprovedNormalMapDistribution.OutputPanel

Clean up any resources being used.

Computes the intersection of the normal vector with the curve Z=(1-x²)(1-y²) using Newton-Raphson We can parametrize the Normal path as: x = Nx.t y = Ny.t z = Nz.t Injecting this in f(x,y) = (1-x²)(1-y²) we get: f(t) = (1-Nx².t²)(1-Ny².t²) To find the intersection with the normal we subtract Nz.t: f(t) = (1-Nx².t²)(1-Ny².t²) - Nz.t Expanding into: f(t) = Nx².Ny².t^4 - (Nx²+Ny²).t² - Nz.t + 1 And try to find the root f(t) = 0, we need the derivative of f(t): f'(t) = 4.Nx².Ny².t^3 - 2.(Nx²+Ny²).t - Nz.t We perform several iterations of the Newton-Raphson algorithm (http://en.wikipedia.org/wiki/Newton's_method): Starting from t0 = 0; t1 = t0 - f(t0) / f'(t0) t2 = t1 - f(t1) / f'(t1) etc. Until f(t) < epsilon ...

Required method for Designer support - do not modify the contents of this method with the code editor.