2022-02-11 13:53:21 +01:00
|
|
|
/* SPDX-License-Identifier: Apache-2.0
|
|
|
|
|
* Copyright 2011-2022 Blender Foundation */
|
2017-03-23 12:47:27 +01:00
|
|
|
|
|
|
|
|
#ifndef __UTIL_MATH_INTERSECT_H__
|
|
|
|
|
#define __UTIL_MATH_INTERSECT_H__
|
|
|
|
|
|
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
|
|
|
|
|
|
/* Ray Intersection */
|
|
|
|
|
|
|
|
|
|
ccl_device bool ray_sphere_intersect(float3 ray_P,
|
2017-03-23 12:53:45 +01:00
|
|
|
float3 ray_D,
|
|
|
|
|
float ray_t,
|
|
|
|
|
float3 sphere_P,
|
|
|
|
|
float sphere_radius,
|
Cycles: Kernel address space changes for MSL
This is the first of a sequence of changes to support compiling Cycles kernels as MSL (Metal Shading Language) in preparation for a Metal GPU device implementation.
MSL requires that all pointer types be declared with explicit address space attributes (device, thread, etc...). There is already precedent for this with Cycles' address space macros (ccl_global, ccl_private, etc...), therefore the first step of MSL-enablement is to apply these consistently. Line-for-line this represents the largest change required to enable MSL. Applying this change first will simplify future patches as well as offering the emergent benefit of enhanced descriptiveness.
The vast majority of deltas in this patch fall into one of two cases:
- Ensuring ccl_private is specified for thread-local pointer types
- Ensuring ccl_global is specified for device-wide pointer types
Additionally, the ccl_addr_space qualifier can be removed. Prior to Cycles X, ccl_addr_space was used as a context-dependent address space qualifier, but now it is either redundant (e.g. in struct typedefs), or can be replaced by ccl_global in the case of pointer types. Associated function variants (e.g. lcg_step_float_addrspace) are also redundant.
In cases where address space qualifiers are chained with "const", this patch places the address space qualifier first. The rationale for this is that the choice of address space is likely to have the greater impact on runtime performance and overall architecture.
The final part of this patch is the addition of a metal/compat.h header. This is partially complete and will be extended in future patches, paving the way for the full Metal implementation.
Ref T92212
Reviewed By: brecht
Maniphest Tasks: T92212
Differential Revision: https://developer.blender.org/D12864
2021-10-14 13:53:40 +01:00
|
|
|
ccl_private float3 *isect_P,
|
|
|
|
|
ccl_private float *isect_t)
|
2017-03-23 12:47:27 +01:00
|
|
|
{
|
2017-03-23 12:53:45 +01:00
|
|
|
const float3 d = sphere_P - ray_P;
|
|
|
|
|
const float radiussq = sphere_radius * sphere_radius;
|
|
|
|
|
const float tsq = dot(d, d);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-23 12:53:45 +01:00
|
|
|
if (tsq > radiussq) {
|
|
|
|
|
/* Ray origin outside sphere. */
|
|
|
|
|
const float tp = dot(d, ray_D);
|
|
|
|
|
if (tp < 0.0f) {
|
|
|
|
|
/* Ray points away from sphere. */
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
2021-09-23 22:06:49 +10:00
|
|
|
const float dsq = tsq - tp * tp; /* Pythagoras. */
|
2017-03-23 12:53:45 +01:00
|
|
|
if (dsq > radiussq) {
|
|
|
|
|
/* Closest point on ray outside sphere. */
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
|
|
|
|
const float t = tp - sqrtf(radiussq - dsq); /* pythagoras */
|
2017-03-23 12:47:27 +01:00
|
|
|
if (t < ray_t) {
|
|
|
|
|
*isect_t = t;
|
|
|
|
|
*isect_P = ray_P + ray_D * t;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ccl_device bool ray_aligned_disk_intersect(float3 ray_P,
|
2017-03-23 12:53:45 +01:00
|
|
|
float3 ray_D,
|
|
|
|
|
float ray_t,
|
|
|
|
|
float3 disk_P,
|
|
|
|
|
float disk_radius,
|
Cycles: Kernel address space changes for MSL
This is the first of a sequence of changes to support compiling Cycles kernels as MSL (Metal Shading Language) in preparation for a Metal GPU device implementation.
MSL requires that all pointer types be declared with explicit address space attributes (device, thread, etc...). There is already precedent for this with Cycles' address space macros (ccl_global, ccl_private, etc...), therefore the first step of MSL-enablement is to apply these consistently. Line-for-line this represents the largest change required to enable MSL. Applying this change first will simplify future patches as well as offering the emergent benefit of enhanced descriptiveness.
The vast majority of deltas in this patch fall into one of two cases:
- Ensuring ccl_private is specified for thread-local pointer types
- Ensuring ccl_global is specified for device-wide pointer types
Additionally, the ccl_addr_space qualifier can be removed. Prior to Cycles X, ccl_addr_space was used as a context-dependent address space qualifier, but now it is either redundant (e.g. in struct typedefs), or can be replaced by ccl_global in the case of pointer types. Associated function variants (e.g. lcg_step_float_addrspace) are also redundant.
In cases where address space qualifiers are chained with "const", this patch places the address space qualifier first. The rationale for this is that the choice of address space is likely to have the greater impact on runtime performance and overall architecture.
The final part of this patch is the addition of a metal/compat.h header. This is partially complete and will be extended in future patches, paving the way for the full Metal implementation.
Ref T92212
Reviewed By: brecht
Maniphest Tasks: T92212
Differential Revision: https://developer.blender.org/D12864
2021-10-14 13:53:40 +01:00
|
|
|
ccl_private float3 *isect_P,
|
|
|
|
|
ccl_private float *isect_t)
|
2017-03-23 12:47:27 +01:00
|
|
|
{
|
2017-03-23 12:53:45 +01:00
|
|
|
/* Aligned disk normal. */
|
2017-03-23 12:47:27 +01:00
|
|
|
float disk_t;
|
2017-03-23 12:53:45 +01:00
|
|
|
const float3 disk_N = normalize_len(ray_P - disk_P, &disk_t);
|
|
|
|
|
const float div = dot(ray_D, disk_N);
|
|
|
|
|
if (UNLIKELY(div == 0.0f)) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
|
|
|
|
/* Compute t to intersection point. */
|
|
|
|
|
const float t = -disk_t / div;
|
|
|
|
|
if (t < 0.0f || t > ray_t) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
|
|
|
|
/* Test if within radius. */
|
2017-03-23 12:47:27 +01:00
|
|
|
float3 P = ray_P + ray_D * t;
|
2017-03-23 12:53:45 +01:00
|
|
|
if (len_squared(P - disk_P) > disk_radius * disk_radius) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
2017-03-23 12:47:27 +01:00
|
|
|
*isect_P = P;
|
|
|
|
|
*isect_t = t;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2021-11-24 14:04:34 +01:00
|
|
|
ccl_device bool ray_disk_intersect(float3 ray_P,
|
|
|
|
|
float3 ray_D,
|
|
|
|
|
float ray_t,
|
|
|
|
|
float3 disk_P,
|
|
|
|
|
float3 disk_N,
|
|
|
|
|
float disk_radius,
|
|
|
|
|
ccl_private float3 *isect_P,
|
|
|
|
|
ccl_private float *isect_t)
|
|
|
|
|
{
|
|
|
|
|
const float3 vp = ray_P - disk_P;
|
|
|
|
|
const float dp = dot(vp, disk_N);
|
|
|
|
|
const float cos_angle = dot(disk_N, -ray_D);
|
|
|
|
|
if (dp * cos_angle > 0.f) // front of light
|
|
|
|
|
{
|
|
|
|
|
float t = dp / cos_angle;
|
|
|
|
|
if (t < 0.f) { /* Ray points away from the light. */
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
float3 P = ray_P + t * ray_D;
|
|
|
|
|
float3 T = P - disk_P;
|
|
|
|
|
if (dot(T, T) < sqr(disk_radius) /*&& t > 0.f*/ && t <= ray_t) {
|
|
|
|
|
*isect_P = ray_P + t * ray_D;
|
|
|
|
|
*isect_t = t;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-17 22:19:54 +01:00
|
|
|
ccl_device_forceinline bool ray_triangle_intersect(float3 ray_P,
|
2017-03-27 17:06:37 +02:00
|
|
|
float3 ray_dir,
|
|
|
|
|
float ray_t,
|
2017-03-23 17:15:54 +01:00
|
|
|
const float3 tri_a,
|
|
|
|
|
const float3 tri_b,
|
|
|
|
|
const float3 tri_c,
|
Cycles: Kernel address space changes for MSL
This is the first of a sequence of changes to support compiling Cycles kernels as MSL (Metal Shading Language) in preparation for a Metal GPU device implementation.
MSL requires that all pointer types be declared with explicit address space attributes (device, thread, etc...). There is already precedent for this with Cycles' address space macros (ccl_global, ccl_private, etc...), therefore the first step of MSL-enablement is to apply these consistently. Line-for-line this represents the largest change required to enable MSL. Applying this change first will simplify future patches as well as offering the emergent benefit of enhanced descriptiveness.
The vast majority of deltas in this patch fall into one of two cases:
- Ensuring ccl_private is specified for thread-local pointer types
- Ensuring ccl_global is specified for device-wide pointer types
Additionally, the ccl_addr_space qualifier can be removed. Prior to Cycles X, ccl_addr_space was used as a context-dependent address space qualifier, but now it is either redundant (e.g. in struct typedefs), or can be replaced by ccl_global in the case of pointer types. Associated function variants (e.g. lcg_step_float_addrspace) are also redundant.
In cases where address space qualifiers are chained with "const", this patch places the address space qualifier first. The rationale for this is that the choice of address space is likely to have the greater impact on runtime performance and overall architecture.
The final part of this patch is the addition of a metal/compat.h header. This is partially complete and will be extended in future patches, paving the way for the full Metal implementation.
Ref T92212
Reviewed By: brecht
Maniphest Tasks: T92212
Differential Revision: https://developer.blender.org/D12864
2021-10-14 13:53:40 +01:00
|
|
|
ccl_private float *isect_u,
|
|
|
|
|
ccl_private float *isect_v,
|
|
|
|
|
ccl_private float *isect_t)
|
2017-03-23 13:30:18 +01:00
|
|
|
{
|
2021-11-22 20:41:19 +01:00
|
|
|
#define dot3(a, b) dot(a, b)
|
2017-03-27 17:06:37 +02:00
|
|
|
const float3 P = ray_P;
|
|
|
|
|
const float3 dir = ray_dir;
|
2017-03-23 13:30:18 +01:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
/* Calculate vertices relative to ray origin. */
|
|
|
|
|
const float3 v0 = tri_c - P;
|
|
|
|
|
const float3 v1 = tri_a - P;
|
|
|
|
|
const float3 v2 = tri_b - P;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
/* Calculate triangle edges. */
|
|
|
|
|
const float3 e0 = v2 - v0;
|
|
|
|
|
const float3 e1 = v0 - v1;
|
|
|
|
|
const float3 e2 = v1 - v2;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
/* Perform edge tests. */
|
|
|
|
|
const float U = dot(cross(v2 + v0, e0), ray_dir);
|
|
|
|
|
const float V = dot(cross(v0 + v1, e1), ray_dir);
|
|
|
|
|
const float W = dot(cross(v1 + v2, e2), ray_dir);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
const float minUVW = min(U, min(V, W));
|
|
|
|
|
const float maxUVW = max(U, max(V, W));
|
|
|
|
|
|
|
|
|
|
if (minUVW < 0.0f && maxUVW > 0.0f) {
|
2017-03-23 13:30:18 +01:00
|
|
|
return false;
|
|
|
|
|
}
|
2017-11-29 02:02:17 +01:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
/* Calculate geometry normal and denominator. */
|
|
|
|
|
const float3 Ng1 = cross(e1, e0);
|
2019-05-01 21:14:11 +10:00
|
|
|
// const Vec3vfM Ng1 = stable_triangle_normal(e2,e1,e0);
|
2017-03-27 17:06:37 +02:00
|
|
|
const float3 Ng = Ng1 + Ng1;
|
|
|
|
|
const float den = dot3(Ng, dir);
|
|
|
|
|
/* Avoid division by 0. */
|
|
|
|
|
if (UNLIKELY(den == 0.0f)) {
|
2017-03-23 13:30:18 +01:00
|
|
|
return false;
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
/* Perform depth test. */
|
|
|
|
|
const float T = dot3(v0, Ng);
|
|
|
|
|
const int sign_den = (__float_as_int(den) & 0x80000000);
|
|
|
|
|
const float sign_T = xor_signmask(T, sign_den);
|
|
|
|
|
if ((sign_T < 0.0f) || (sign_T > ray_t * xor_signmask(den, sign_den))) {
|
2017-03-23 13:30:18 +01:00
|
|
|
return false;
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
const float inv_den = 1.0f / den;
|
|
|
|
|
*isect_u = U * inv_den;
|
|
|
|
|
*isect_v = V * inv_den;
|
|
|
|
|
*isect_t = T * inv_den;
|
2017-03-23 13:30:18 +01:00
|
|
|
return true;
|
|
|
|
|
|
2017-03-27 17:06:37 +02:00
|
|
|
#undef dot3
|
|
|
|
|
}
|
2017-03-23 13:01:42 +01:00
|
|
|
|
Cycles/Eevee: Implement disk and ellipse shapes for area lamps
The implementation is pretty straightforward.
In Cycles, sampling the shapes is currently done w.r.t. area instead of solid angle.
There is a paper on solid angle sampling for disks [1], but the described algorithm is based on
simply sampling the enclosing square and rejecting samples outside of the disk, which is not exactly
great for Cycles' RNG (we'd need to setup a LCG for the repeated sampling) and for GPU divergence.
Even worse, the algorithm is only defined for disks. For ellipses, the basic idea still works, but a
way to analytically calculate the solid angle is required. This is technically possible [2], but the
calculation is extremely complex and still requires a lookup table for the Heuman Lambda function.
Therefore, I've decided to not implement that for now, we could still look into it later on.
In Eevee, the code uses the existing ltc_evaluate_disk to implement the lighting calculations.
[1]: "Solid Angle Sampling of Disk and Cylinder Lights"
[2]: "Analytical solution for the solid angle subtended at any point by an ellipse via a point source radiation vector potential"
Reviewers: sergey, brecht, fclem
Differential Revision: https://developer.blender.org/D3171
2018-05-24 03:50:16 +02:00
|
|
|
/* Tests for an intersection between a ray and a quad defined by
|
|
|
|
|
* its midpoint, normal and sides.
|
|
|
|
|
* If ellipse is true, hits outside the ellipse that's enclosed by the
|
|
|
|
|
* quad are rejected.
|
|
|
|
|
*/
|
2017-03-23 12:53:45 +01:00
|
|
|
ccl_device bool ray_quad_intersect(float3 ray_P,
|
|
|
|
|
float3 ray_D,
|
|
|
|
|
float ray_mint,
|
|
|
|
|
float ray_maxt,
|
|
|
|
|
float3 quad_P,
|
|
|
|
|
float3 quad_u,
|
|
|
|
|
float3 quad_v,
|
|
|
|
|
float3 quad_n,
|
Cycles: Kernel address space changes for MSL
This is the first of a sequence of changes to support compiling Cycles kernels as MSL (Metal Shading Language) in preparation for a Metal GPU device implementation.
MSL requires that all pointer types be declared with explicit address space attributes (device, thread, etc...). There is already precedent for this with Cycles' address space macros (ccl_global, ccl_private, etc...), therefore the first step of MSL-enablement is to apply these consistently. Line-for-line this represents the largest change required to enable MSL. Applying this change first will simplify future patches as well as offering the emergent benefit of enhanced descriptiveness.
The vast majority of deltas in this patch fall into one of two cases:
- Ensuring ccl_private is specified for thread-local pointer types
- Ensuring ccl_global is specified for device-wide pointer types
Additionally, the ccl_addr_space qualifier can be removed. Prior to Cycles X, ccl_addr_space was used as a context-dependent address space qualifier, but now it is either redundant (e.g. in struct typedefs), or can be replaced by ccl_global in the case of pointer types. Associated function variants (e.g. lcg_step_float_addrspace) are also redundant.
In cases where address space qualifiers are chained with "const", this patch places the address space qualifier first. The rationale for this is that the choice of address space is likely to have the greater impact on runtime performance and overall architecture.
The final part of this patch is the addition of a metal/compat.h header. This is partially complete and will be extended in future patches, paving the way for the full Metal implementation.
Ref T92212
Reviewed By: brecht
Maniphest Tasks: T92212
Differential Revision: https://developer.blender.org/D12864
2021-10-14 13:53:40 +01:00
|
|
|
ccl_private float3 *isect_P,
|
|
|
|
|
ccl_private float *isect_t,
|
|
|
|
|
ccl_private float *isect_u,
|
|
|
|
|
ccl_private float *isect_v,
|
Cycles/Eevee: Implement disk and ellipse shapes for area lamps
The implementation is pretty straightforward.
In Cycles, sampling the shapes is currently done w.r.t. area instead of solid angle.
There is a paper on solid angle sampling for disks [1], but the described algorithm is based on
simply sampling the enclosing square and rejecting samples outside of the disk, which is not exactly
great for Cycles' RNG (we'd need to setup a LCG for the repeated sampling) and for GPU divergence.
Even worse, the algorithm is only defined for disks. For ellipses, the basic idea still works, but a
way to analytically calculate the solid angle is required. This is technically possible [2], but the
calculation is extremely complex and still requires a lookup table for the Heuman Lambda function.
Therefore, I've decided to not implement that for now, we could still look into it later on.
In Eevee, the code uses the existing ltc_evaluate_disk to implement the lighting calculations.
[1]: "Solid Angle Sampling of Disk and Cylinder Lights"
[2]: "Analytical solution for the solid angle subtended at any point by an ellipse via a point source radiation vector potential"
Reviewers: sergey, brecht, fclem
Differential Revision: https://developer.blender.org/D3171
2018-05-24 03:50:16 +02:00
|
|
|
bool ellipse)
|
2017-03-23 12:47:27 +01:00
|
|
|
{
|
2017-03-23 12:53:45 +01:00
|
|
|
/* Perform intersection test. */
|
2017-03-23 12:47:27 +01:00
|
|
|
float t = -(dot(ray_P, quad_n) - dot(quad_P, quad_n)) / dot(ray_D, quad_n);
|
2017-03-23 12:53:45 +01:00
|
|
|
if (t < ray_mint || t > ray_maxt) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
|
|
|
|
const float3 hit = ray_P + t * ray_D;
|
|
|
|
|
const float3 inplane = hit - quad_P;
|
Cycles/Eevee: Implement disk and ellipse shapes for area lamps
The implementation is pretty straightforward.
In Cycles, sampling the shapes is currently done w.r.t. area instead of solid angle.
There is a paper on solid angle sampling for disks [1], but the described algorithm is based on
simply sampling the enclosing square and rejecting samples outside of the disk, which is not exactly
great for Cycles' RNG (we'd need to setup a LCG for the repeated sampling) and for GPU divergence.
Even worse, the algorithm is only defined for disks. For ellipses, the basic idea still works, but a
way to analytically calculate the solid angle is required. This is technically possible [2], but the
calculation is extremely complex and still requires a lookup table for the Heuman Lambda function.
Therefore, I've decided to not implement that for now, we could still look into it later on.
In Eevee, the code uses the existing ltc_evaluate_disk to implement the lighting calculations.
[1]: "Solid Angle Sampling of Disk and Cylinder Lights"
[2]: "Analytical solution for the solid angle subtended at any point by an ellipse via a point source radiation vector potential"
Reviewers: sergey, brecht, fclem
Differential Revision: https://developer.blender.org/D3171
2018-05-24 03:50:16 +02:00
|
|
|
const float u = dot(inplane, quad_u) / dot(quad_u, quad_u);
|
|
|
|
|
if (u < -0.5f || u > 0.5f) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
const float v = dot(inplane, quad_v) / dot(quad_v, quad_v);
|
|
|
|
|
if (v < -0.5f || v > 0.5f) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
Cycles/Eevee: Implement disk and ellipse shapes for area lamps
The implementation is pretty straightforward.
In Cycles, sampling the shapes is currently done w.r.t. area instead of solid angle.
There is a paper on solid angle sampling for disks [1], but the described algorithm is based on
simply sampling the enclosing square and rejecting samples outside of the disk, which is not exactly
great for Cycles' RNG (we'd need to setup a LCG for the repeated sampling) and for GPU divergence.
Even worse, the algorithm is only defined for disks. For ellipses, the basic idea still works, but a
way to analytically calculate the solid angle is required. This is technically possible [2], but the
calculation is extremely complex and still requires a lookup table for the Heuman Lambda function.
Therefore, I've decided to not implement that for now, we could still look into it later on.
In Eevee, the code uses the existing ltc_evaluate_disk to implement the lighting calculations.
[1]: "Solid Angle Sampling of Disk and Cylinder Lights"
[2]: "Analytical solution for the solid angle subtended at any point by an ellipse via a point source radiation vector potential"
Reviewers: sergey, brecht, fclem
Differential Revision: https://developer.blender.org/D3171
2018-05-24 03:50:16 +02:00
|
|
|
if (ellipse && (u * u + v * v > 0.25f)) {
|
2017-03-23 12:47:27 +01:00
|
|
|
return false;
|
2017-03-23 12:53:45 +01:00
|
|
|
}
|
|
|
|
|
/* Store the result. */
|
|
|
|
|
/* TODO(sergey): Check whether we can avoid some checks here. */
|
|
|
|
|
if (isect_P != NULL)
|
|
|
|
|
*isect_P = hit;
|
|
|
|
|
if (isect_t != NULL)
|
|
|
|
|
*isect_t = t;
|
Cycles/Eevee: Implement disk and ellipse shapes for area lamps
The implementation is pretty straightforward.
In Cycles, sampling the shapes is currently done w.r.t. area instead of solid angle.
There is a paper on solid angle sampling for disks [1], but the described algorithm is based on
simply sampling the enclosing square and rejecting samples outside of the disk, which is not exactly
great for Cycles' RNG (we'd need to setup a LCG for the repeated sampling) and for GPU divergence.
Even worse, the algorithm is only defined for disks. For ellipses, the basic idea still works, but a
way to analytically calculate the solid angle is required. This is technically possible [2], but the
calculation is extremely complex and still requires a lookup table for the Heuman Lambda function.
Therefore, I've decided to not implement that for now, we could still look into it later on.
In Eevee, the code uses the existing ltc_evaluate_disk to implement the lighting calculations.
[1]: "Solid Angle Sampling of Disk and Cylinder Lights"
[2]: "Analytical solution for the solid angle subtended at any point by an ellipse via a point source radiation vector potential"
Reviewers: sergey, brecht, fclem
Differential Revision: https://developer.blender.org/D3171
2018-05-24 03:50:16 +02:00
|
|
|
if (isect_u != NULL)
|
|
|
|
|
*isect_u = u + 0.5f;
|
|
|
|
|
if (isect_v != NULL)
|
|
|
|
|
*isect_v = v + 0.5f;
|
2017-03-23 12:47:27 +01:00
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
CCL_NAMESPACE_END
|
|
|
|
|
|
|
|
|
|
#endif /* __UTIL_MATH_INTERSECT_H__ */
|