Traditional fiber scattering models, based on ray optics, are missing some important visual aspects of fiber appearance. Previous work [Xia et al. 2020] on wave scattering from ideal extrusions demonstrated that diffraction produces strong forward scattering and colorful effects that are missing from ray-based models. However, that work was unable to include some important surface characteristics such as surface roughness and tilted cuticle scales, which are known to be important for fiber appearance. In this work, we take an important step to study wave effects from rough fibers with arbitrary 3D microgeometry. While the full-wave simulation of realistic 3D fibers remains intractable, we developed a 3D wave optics simulator based on a physical optics approximation, using a GPU-based hierarchical algorithm to greatly accelerate the calculation. It simulates surface reflection and diffractive scattering, which are present in all fibers and typically dominate for darkly pigmented fibers. The simulation provides a detailed picture of first order scattering, but it is not practical to use for production rendering as this would require tabulation per fiber geometry. To practically handle geometry variations in the scene, we propose a model based on wavelet noise, capturing the important statistical features in the simulation results that are relevant for rendering. Both our simulation and practical model show similar granular patterns to those observed in optical measurement. Our compact noise model can be easily combined with existing scattering models to render hair and fur of various colors, introducing visually important colorful glints that were missing from all previous models.

Computing light reflection from rough surfaces is an important topic in computer graphics. Reflection models developed based on geometric optics fail to capture wave effects such as diffraction and interference, while existing models based on physical optics approximations give erroneous predictions under many circumstances (e.g. when multiple scattering from the surface cannot be ignored). We present a scalable 3D full-wave simulator for computing reference solutions to surface scattering problems, which can be used to evaluate and guide the development of approximate models for rendering. We investigate the range of validity for some existing wave optics based reflection models; our results confirm these models for low-roughness surfaces but also show that prior rendering methods do not accurately predict the scattering behavior of some types of surfaces. Our simulator is based on the boundary element method (BEM) and accelerated using the adaptive integral method (AIM), and is implemented to execute on modern GPUs. We demonstrate the simulator on domains up to 60 × 60 × 10 wavelengths, involving surface samples with significant height variations. Furthermore, we propose a new system for efficiently computing BRDF values for large numbers of incident and outgoing directions at once, by combining small simulations to characterize larger areas. Our simulator will be released as an open-source toolkit for computing surface scattering.

Existing fiber scattering models in rendering are all based on tracing rays through fiber geometry, but for small fibers diffraction and interference are non-negligible, so relying on ray optics can result in appearance errors. This paper presents the first wave optics based fiber scattering model, introducing an azimuthal scattering function that comes from a full wave simulation. Solving Maxwell's equations for a straight fiber of constant cross section illuminated by a plane wave reduces to solving for a 3D electromagnetic field in a 2D domain, and our fiber scattering simulator solves this 2.5D problem efficiently using the boundary element method (BEM). From the resulting fields we compute extinction, absorption, and far-field scattering distributions, which we use to simulate shadowing and scattering by fibers in a path tracer. We validate our path tracer against the wave simulation and the simulation against a measurement of diffraction from a single textile fiber. Our results show that our approach can reproduce a wide range of fibers with different sizes, cross sections, and material properties, including textile fibers, animal fur, and human hair. The renderings include color effects, softening of sharp features, and strong forward scattering that are not predicted by traditional ray-based models, though the two approaches produce similar appearance for complex fiber assemblies under many conditions.

A high-order accurate and efficient full-wave, 2D numerical algorithm is exploited to analyze electromagnetic waves propagating over irregular terrain. The algorithm derives its accuracy from the use of a locally corrected Nyström scheme for discretizing the PMCHWT combined field integral equation, and its efficiency from the use of a fast multipole technique for speeding up the evaluation of far field interactions. The convergence rate of the solution is fully controllable, which renders the solver an attractive tool for simulating long-distance, overterrain propagation and diffraction phenomena; for example, it is demonstrated that solutions with 8 digits of precision can be attained with as few as 8 surface discretization points per wavelength for a 1000-wavelength terrain profile.

A fast Fourier transform-accelerated integral-equation based algorithm to efficiently analyze transient scattering from planar perfect electrically conducting objects residing above or inside a potentially lossy dielectric half-space is presented. The algorithm requires O(N/sub t/N/sub s/(logN/sub s/+log/sup 2/N/sub t/)) CPU and O(N/sub t/N/sub s/) memory resources when analyzing electromagnetic wave interactions with uniformly meshed planar structures. Here, N/sub t/ and N/sub s/ are the numbers of simulation time steps and spatial unknowns, respectively. The proposed scheme is therefore far more efficient than classical time-marching solvers, the CPU and memory requirements of which scale as O(N/sub t//sup 2/N/sub s//sup 2/) and O(N/sub t/N/sub s//sup 2/). In the proposed scheme, all pertinent time-domain half-space Green functions are (pre) computed from their frequency-domain counterparts via inverse discrete Fourier transformation. In this process, in-band aliasing is avoided through the application of a smooth and interpolatory window. Numerical results demonstrate the accuracy and efficiency of the proposed algorithm.

A novel algorithm for fast computation of tomographic image projections is presented. The method comprises a decomposition of an image into sub-images followed by an aggregation of projections computed for the sub-images. The multilevel domain decomposition algorithm is formulated as a recursive procedure. The computational cost of the proposed algorithm is comparable to that of FFT-based techniques but it provides better accuracy and more flexibility.

A novel algorithm for fast computation of tomographic image projections is presented. The method comprises a decomposition of an image into subimages followed by an aggregation of projections computed for the subimages. The multilevel domain decomposition algorithm is formulated as a recursive procedure. The computational cost of the proposed algorithm is comparable to that of FFT-based techniques while it appears to be more flexible than the latter. Numerical results demonstrate the effectiveness of the method.

A new technique, the steepest descent-fast multipole method (SDFMM), is developed to efficiently analyze scattering from perfectly conducting random rough surfaces. Unlike other prevailing methods, this algorithm has linear computational complexity and memory requirements, making it a suitable candidate for analyzing scattering from large rough surfaces as well as for carrying out Monte Carlo simulations. The method exploits the quasiplanar nature of rough surfaces to efficiently evaluate the dyadic Green's function for multiple source and observation points. This is achieved through a combination of a Sommerfeld steepest descent integral and a multilevel fast multipole-like algorithm based on inhomogeneous plane wave expansions. The fast evaluation of the dyadic Green's function dramatically speeds up the iterative solution of the integral equation for rough surface scattering. Several numerical examples are presented to demonstrate the efficacy and accuracy of the method in analyzing scattering from extremely large finite rough surfaces.