Abstract
The algorithm based on the physical-geometric optics method is developed to compute the linearization of single-scattering properties, such as extinction, absorption and scattering cross-sections, and the scattering phase matrix. The algorithm can be applied to any convex facet particles, where a new beam-splitting technique is employed. With the introduction of the winding number method, beams incident on multiple facets can be precisely divided into independent parts that are incident on single facets. The linearization algorithm is verified by the finite-difference method using the regular hexagonal prism. The sensitivities of single-scattering properties with respect to size, aspect ratio, and refractive index are discussed.
© 2022 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement
1. Introduction
Cirrus clouds have been identified as one of the most important factors influencing climate [1,2]. The optical properties of cirrus clouds directly or indirectly affect the radiative balance of the Earth atmosphere system and climate [3,4]. The distance between cirrus ice crystals is much larger than the geometric dimensions of the crystals themselves, which makes it meaningful to study the single-scattering properties (SSPs) of individual ice crystals [5,6]. However, the non-spherical nature of ice crystals and orientation issues make it difficult to study their SSPs [7].
Various ice crystal shapes have been discovered during in situ observations [8,9], and they tend to exhibit hexamorphic symmetry under ideal conditions and irregular shapes under complex atmospheric conditions [10–12]. Collisions and adhesion between multiple ice crystals can form complex aggregates and the SSPs of the aggregates are dominated by those of individual particles [13,14]. For small non-spherical particles, the SSPs can be obtained using the numerically rigorously methods, such as finite-difference time-domain method [15,16], the pseudo-spectral time-domain method [17], the discrete dipole approximations [18–20], and the T-matrix methods [21–25]. The computational resources required by the numerically rigorous methods increase dramatically with particle size parameters, so these methods perform poorly with large particles [26]. The SSPs of terrestrial ice cloud crystals are generally calculated by the geometric optics method (GOM) owing to their large size [27]. Geometries such as hexagonal prisms, plates, cylinders, droxtals, bullets, droplet and capped columns have been widely used in the GOMs for SSPs studies of non-spherical particles [11,28–34].
Light scattering by large particles involves mainly surface reflection, refraction inside particles, and far-field mapping [35]. Ray-tracing process using Snell's law and Fresnel's formula, and diffraction using Babinet’s principle are used to describe these processes in the conventional geometric optics method (CGOM) [3,11,36]. The CGOM can be improved by using the Fraunhofer diffraction to accomplish the far-field mapping [37,38]. Furthermore, the ray-tracing process inside particles can be analytically obtained for facet particles, where ray-tracing are replaced by beam-tracing to improve computational efficiency, and the mapping process can be accurately done using Maxwell’s equations in the physical-geometric optics method (PGOM) [31,39–41]. Beam splitting technique is essential to the beam-tracing process to make one beam only incident on a single facet and determines the computational efficiency of the geometric optics method. The details can be found in section 2.2. Mathematical methods and the “divide-and-conquer” algorithm of computer graphics have been used in beam splitting [31,40].
The linearization of SSPs, (i.e., the partial derivative of SSPs with respect to scattering parameters) is critical to remote sensing and retrieval [42]. For small non-spherical particles, the extended-boundary-condition method [43] and the invariant-imbedding T-matrix method [44] provide the linearization of SSPs for axisymmetric or asymmetric particles. The algorithm for the linearization of SSPs is lacking for large non-spherical particles. In this study, the linearization of the SSPs for convex facet particles is derived based on the PGOM and applied to regular hexagonal prisms for an example. Moreover, the winding number method is introduced to improve the beam splitting process [45]. For regular hexagonal prisms, the numerical results of the SSP linearization are verified by the results of the finite-difference method, and the sensitivities of SSPs to scattering parameters such as aspect ratio, effective radius, and refractive index are correspondingly discussed.
The paper is divided into four sections. The derivation of SSPs based on PGOM and the beam-splitting method are given in Sections 2.1 and 2.2, respectively. Section 2.3 provides the derivation of linearization of SSPs. In Section 3, the linearization is verified by comparison with the finite-difference method, and its sensitivity to scattering parameters is analyzed. The conclusion is presented in Section 4.
2. Method
To simplify the algorithm, only linearization for the convex and homogeneous facet particles are considered. The linearization of SSPs is the partial derivative of SSPs to the aspect ratio $\sigma $ (for regular prisms defined as 2a/h, a is the radius of the circumscribed circle of the prism bottom and h is the prism height), the effective radius ${r_e}$ (defined as the radius of spheres of equal volume), and the real and imaginary parts of the complex refractive index m. Table 1 summarizes the main variables used in this study.
2.1 Single-scattering properties
The volume-integral equation from Maxwell’s equations is used to do the far-field mapping, where the far-field ${\vec{E}^s}$ can be expressed an integration of the near-field $\vec{E}$ as [23]:
Combining Eq. (1) and Eq. (2), ${\vec{E}^s}$ can be written as [31]
The amplitude-scattering matrix S connects the incident and scattering fields as
The scattering matrix M is generated by the combination of the elements of S. Parts of M and some integral SSPs can be expressed as:
2.2 Beam-splitting method
The beam-splitting method completes the top and bottom of the sub-prism segmentation (Fig. 1). The schematic figure for a regular hexagonal prism hit by light perpendicular to its side facet is shown in Fig. 2. For convenience, only one incident facet (the red facet in Fig. 2) is discussed here. The refracted portion ${\hat{e}_1}$ of the incident light ${\hat{e}^i}$ can be divided into two parts (black and green shades; Fig. 2(a)). Beam-splitting technique ensures the two parts of ${\hat{e}_1}$ hit the black and green facets independently (Fig. 2(b)). Segmentation of the incident facet is shown in Fig. 2(c). This process can be divided into three parts: (1) projection of the next facet to the current facet; (2) polygon clipping; and (3) back-projection of the clipped polygon to the next facet. Steps 1 and 3 can be implemented with plane equations.
For step 2, simple mathematical methods can be used, but they are efficient for only those polyhedrons with a small number of facets. The Weiler-Atherton (WA) algorithm is employed in the state-of-the-art PGOM. It accomplishes polygon clipping by determining the state of the intersection points of subject polygon ${S^ \ast }$ and clipping polygon ${C^ \ast }$. There are two states for the intersection points: entry and exit. The WA requires that the vertices of both ${S^ \ast }$ and ${C^ \ast }$ are arranged clockwise or counterclockwise. For convenience, counterclockwise arrangement is used here. For example, the entry point ${I_1}$ of ${S^ \ast }$ in Fig. 3(a) means that from this point, vertices along with ${S^ \ast }$ belong to the intersecting polygon until the exit point (here is ${I_2}$). In WA algorithm, the exit point of ${S^ \ast }$ strictly corresponds to the entry point of ${C^ \ast }$. Consequently, the next point belonging to the intersecting polygon is located in another polygon ${C^ \ast }$. Since ${I_2}$ and ${I_1}$ are entry and exit points for ${C^ \ast }$, respectively, ${I_2}$, $C_1^ \ast $ and ${I_1}$ are the vertices of the intersecting polygon. The polygon clipping ends as ${I_1}$ is the entry point of ${S^ \ast }$, which has already been added to the intersecting polygon, and the vertices of the intersecting polygon are ${I_1} \to {I_2} \to C_1^ \ast $. The consecutive entry and exit points are the basis of the WA algorithm. However, the state of points could be both in enter and exit for the degradation case as shown in Fig. 3(b), where the complete-edge representation (CEP) is necessary to ensure accuracy [46]. The variety of degradation cases makes CEP complex and tedious. Since the current algorithm does not take the CEP into account, erroneous results and even program crashes occur in degradation cases and the accuracy of the PGOM is affected.
A method based on the winding number effectively handles the degradation case. The winding number $wn$ is often used to determine relationships between points and polygons, and is applied to convex, concave, and self-intersecting polygons. An efficient algorithm for winding number is presented in Appendix. For 2D polygon and an arbitrary point P, condition $wn \ne 0$ indicates that P is inside the polygon (excluding the edge) and condition $wn = 0$ means an outside point. If the vertices of polygons are arranged counterclockwise $wn$ > 1 and $wn \le - 1$ apply only to self-intersecting polygons. Examples of the winding number $wn$ are shown in Fig. 4. To simplify the calculation, only non-self-intersecting polygons are considered and the vertices of polygons are arranged counterclockwise, condition $wn ={-} 1$ was defined as the point on the edge or vertex of a polygon. Without considering self-intersecting or concave polygons, there are four relationships between the subject polygon ${S^ \ast }$ and clipping polygon ${C^ \ast }$. For convenience, $w{n_{S_i^ \ast }}$ denotes the position relationship of vertex $S_i^ \ast $ with respect to ${C^ \ast }$. Similarly, $w{n_{C_i^ \ast }}$ denotes the position relationship of vertex $C_i^ \ast $ with respect to ${S^ \ast }$. After finding the intersecting points of the two polygons, condition $w{n_{S_i^ \ast }} = w{n_{C_i^ \ast }} = 0$ indicates that the two polygons are separated (Fig. 5(a)). Conditions $w{n_{S_i^ \ast }} = 0$ and $w{n_{C_i^ \ast }} \ne 0$ imply the intersecting polygon is ${C^ \ast }$ (Fig. 5(b)), and the intersecting polygon is ${S^ \ast }$ with $w{n_{S_i^ \ast }} \ne 0$ and $w{n_{C_i^ \ast }} = 0$ (Fig. 5(c)). $w{n_{S_i^ \ast }}$ or $w{n_{C_i^ \ast }}$ is a combination of zero and non-zero, with the intersecting polygon being the common part of two polygons (Fig. 5(d)).
In the process of obtaining the intersecting polygons, it is necessary to ensure that the vertices of two polygons are arranged in the same order; i.e., they are both clockwise or counterclockwise. The vertices with $w{n_{S_i^ \ast }} \ne 0$ and $w{n_{C_i^ \ast }} \ne 0$ enclose the intersecting polygon, assuming that the vertices are arranged counterclockwise and all intersecting points are calculated. Taking Fig. 5(d) as an example and starting from the first vertex of the subject polygon ${S^ \ast }$, ${I_1}$ is the first vertex with $wn \ne 0$, and $wn$ of the next point ${I_2}$ is also non-zero. Consequently, both ${I_1}$ and ${I_2}$ are vertices of intersecting polygons, and ${I_1}$ is the entry point. Along with ${S^ \ast }$, condition $w{n_{S_4^ \ast }} = 0$ means that the next vertex of the intersecting polygon is on the other polygon ${C^ \ast }$, so it is necessary to jump from polygon ${S^ \ast }$ to polygon ${C^ \ast }$ at ${I_2}$. Along with ${C^ \ast }$, $w{n_{C_3^ \ast }}$, $w{n_{C_1^ \ast }}$ and $w{n_{C_{_{{I_1}}}^ \ast }}$ are all non-zero and belong to the vertices of the intersecting polygon. As ${I_1}$ is a duplicate of the entry point, all vertices of the intersecting polygon have been found. In the example in Fig. 5(d), the vertices of the intersecting polygons are ${I_1} \to {I_2} \to C_3^ \ast \to C_1^ \ast $. The specific $wn$ is shown in Table 2.
An example of two intersecting polygons is shown in Fig. 6. The order of the vertices of both ${S^ \ast }$ and ${C^ \ast }$ is counterclockwise. Starting from $S_1^ \ast $, ${I_1}$ and ${I_2}$ satisfy the condition of entering at an intersecting point. As $w{n_{S_3^ \ast }} = 0$, it must jump from ${S^ \ast }$ to ${C^ \ast }$ in ${I_2}$. In polygon ${C^ \ast }$, the $wn$ of $C_2^ \ast $ and ${I_1}$ are 1 and −1, respectively, and ${I_1}$ is duplicated. Hence, the vertices of the first intersecting polygon have all been found, namely ${I_1} \to {I_2} \to C_2^ \ast $. Similarly, another intersecting polygon is ${I_3} \to {I_4} \to C_1^ \ast $. The details of $wn$ are given in Table 3.
2.3 Linearization of single-scattering properties
The amplitude scattering matrix S is the key to solving for the linearization of the SSPs. With $\zeta $ representing $\sigma \textrm{ and }{r_e}$, and m represent ${m_r}\textrm{ and }{m_i}$, and using Eq. (16), the linearization of S with respect to x can be written as:
The linearization associated with ${F_p}$ can be treated in two parts. With Eq. (13), the linearization of ${\Phi _{p,j + 1}} - {\Phi _{p,j}}$ is
3. Results and discussion
The regular hexagonal prism is used as an example to verify the linearization and discuss the sensitivity of the SSPs. The linearization of SSPs is verified by using the finite-difference method. The SSPs such as the extinction, absorption, and scattering cross-sections, single scattering albedo, and Mueller matrix, and their corresponding linearization are discussed. For convenience, the incident wavelength is assumed as $2\pi $ µm and the unit for all radii is µm. All SSPs are computed in the condition of random orientations. The linearization of SSPs $\partial (\textrm{SSP)}/\partial x$ is marked as ${\partial _x}(\textrm{SSP})$ in the figures for simplification.
3.1 Comparison with the finite-difference method
For the finite-difference method, the partial derivatives of n scattering parameters can be asymptotically obtained by calculating (n + 1) times of the PGOM. However, for the geometric optics method, a tiny change of scattering parameters can cause significant changes of ray paths. Correspondingly, the difference of scattering parameters has to be extremely small to ensure that all ray paths are invariant. In the other side, the computer's round-off error might overwhelm the changes of scattering parameters. To obtain accurate results, more than n + 1 times are required in practice. Several attempts are required for the choice of suitable perturbations. In this study, the absolute increment ${10^{ - 8}}$ is used in the finite-difference method to verify the linearization results. For one orientation and four scattering parameters, the linearization method takes roughly 10 seconds while the finite-difference method totally takes around 12.5 seconds, where all simulations are conducted on a cluster with Intel Xeon Platinum 8260 CPU @2.4GHZ.
Figure 7–Fig. 10 show the comparisons between the linearization and the finite-difference results of the normalized Mueller matrix P with respect to scattering parameters $\sigma ,{r_e},{m_r},\textrm{ and }{m_i}$, respectively, where the scattering parameters are all $\sigma = 1.0$, ${r_e} = 50.0$, ${m_r} = 1.1$, and ${m_i} = 0.0001$. The solid black and dashed red lines represent the linearization and finite-difference results, respectively. The normalized Mueller matrix P is defined relative to the Mueller matrix M as follows:
Figure 11 shows the application of the linearization and finite-difference methods to the scattering cross-section ${C_{sca}}$ and absorption cross-section ${C_{abs}}$, where the solid black and dashed red lines represent the linearization and finite-difference results, respectively. The difference between the results of the linearization algorithm and the finite-difference method is described by the relative difference, which is defined as
The panels (a1)-(h1) show the comparisons of two results and the panels (a2)-(h2) are the corresponding relative differences. These lines fit extremely well, where the relative differences are much less than 1%.
Thus, the linearization algorithm of the SSPs is verified using the finite-difference method for both the differential scattering properties – the non-zero elements of the normalized scattering matrix P and the integrated scattering properties – the scattering and absorption cross-sections in Fig. 7–Fig. 11.
3.2 Sensitivity analysis
Figure 12 shows the distribution of the absorption and scattering cross-sections and their linearization results as functions of the scattering parameters. The aspect ratio $\sigma $ and equal volume radius ${r_e}$ represent the geometric parameters of a scattering particle while the real part ${m_r}$ and the imaginary part ${m_i}$ of the refractive index represent the optical parameters of the scattering particle. The particle absorption is determined by the absorption ability and path, which are related to the imaginary part of the refractive index and the particle size. Panels (a) and (b) show the absorption cross-sections ${C_{abs}}$ are sensitive to ${m_i}$ and ${r_e}$, and the increase rate can be quantitatively obtained from the corresponding linearization. The scattering cross-sections ${C_{sca}}$ are sensitive to ${m_r}$ as shown in panel (c), which fluctuates with the increasing ${m_r}$ because of the interference between diffracted and reflected-refracted rays. ${C_{sca}}$ increases with ${r_e}$ as shown in panel (d) because the geometric scattering cross-section is increased with ${r_e}$. The variations of $\sigma $ and ${r_e}$ as well cause the interference between diffracted and reflected-refracted parts. Correspondingly, holes appear in panel (d) due to large interference fluctuations.
The angular distributions of ${P_{11}}$ and its linearization as a function of scattering parameters are shown in Fig. 13. The backward scattering of ${P_{11}}$, especially ${P_{11}}({{{180}^\circ }} )$, is strongly oscillated due to interference of refracted rays, which is influenced by geometric parameters and the real part of the refractive index. The backward scattering of ${P_{11}}$ is reduced due to the absorption enhancement with the increase of the imaginary part of the refractive index. The forward scattering of ${P_{11}}$ is mainly from the diffraction contribution and the diffraction is proportional to the geometric cross-section of a scattering particle. Correspondingly, the forward scattering is sensitive to ${r_e}$ as shown in panel (b). The sensitivities and changing rate can be straightforwardly captured form the linearization results.
Figure 14 shows the extinction cross-sections ${C_{ext}}$, the single scattering albedo $SSA$, the exactly backward scattering ${P_{11}}({{{180}^\circ }} )$, and their linearization. With increasing ${r_e}$, ${C_{ext}}$ exhibits a monotonically increase but an oscillated increase rate, and $SSA$ displays a decrease tendency due to the increase of the absorption path, while ${P_{11}}({{{180}^\circ }} )$ oscillates because of the ray interference. With increasing ${m_r}$, the ${C_{ext}}$ displays an oscillation due to the interference between diffraction and refracted-reflected rays, $SSA$ shows similar features as increasing ${r_e}$, and ${P_{11}}({{{180}^\circ }} )$ shows an increase tendency because of scattering enhancement. With increasing ${m_i}$, ${C_{ext}}$, $SSA$, and ${P_{11}}({{{180}^\circ }} )$ all display significant decreasing trends due to the absorption enhancement.
4. Conclusion
The linearization of the single scattering properties is systematically derived based on the physical-geometric optics method (PGOM) and analytically obtained. Moreover, the winding number method is introduced to simplify and improve the accuracy of the beam-splitting process. The PGOM is generalized to the linearized physical-geometric optics method (LPGOM). Regular hexagonal prisms are taken as an example to study the linearization algorithm. The linearization algorithm is verified to the finite-difference method, where the relative differences of two simulations are much less than 1%. The sensitivities of extinction, absorption, scattering cross-sections, single scattering albedo, and scattering phase function with respect to aspect ratio, equal volume radius, and complex refractive index are discussed based on the LPGOM. For future work, the LPGOM can be used to generate a linearized single-scattering-property database for the potential applications in remote sensing.
Appendix: determination of winding number
If a 2D polygon is given, the winding number of any point inside the 2D plane is uniquely determined. For convenience, only the counterclockwise arrangement is discussed. Suppose the polygon consists of vertices ${V_j}({j = 1,n} )$ and ${V_1} \ne {V_n}$. An arbitrary point P can form vectors ${\vec{v}_i}({i = 1,n} )$ with the vertices of the given polygon. If the angle between vectors ${\vec{v}_i}$ can be defined as
In Fig. 15(a1), the point P is inside the polygon so the sum of ${\theta _i}$ is $2\pi $, i.e., wn = 1. In Fig. 15(b1), the sign of ${\theta _4}$ is negative so the sum of ${\theta _i}$ is 0, i.e., wn = 0. However, the function arccos is time-consuming. Another more efficient method is preferred. Suppose the polygon consists of directed edges and the length of each edge is defined as
In Fig. 15(a2), only ${\vec{l}_2}$ upward crosses L so wn = 1. In Fig. 15(b2), ${\vec{l}_1}$ and ${\vec{l}_4}$ upward and downward cross L, respectively, so wn = 0. The results are the same as those using the calculated angle. It should be noted that wn = 0 means that the point is outside the polygon, and wn ≠ 0 means that the point is inside the polygon. For convex particles, the polygons involved in the beam-splitting process do not contain self-intersecting polygons. If the polygon vertices are arranged counterclockwise, wn = 1 when the point is inside the polygon, and it is reasonable to set wn = −1 to represent the point on the edge of the polygon.
Funding
National Key Research and Development Program of China (2021YFB3900401); National Natural Science Foundation of China (41975021); Natural Science Foundation of Shanghai (19ZR1404100); Shanghai Science and Technology Development Foundation (20dz1200700).
Disclosures
The authors declare no conflicts of interest.
Data availability
Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.
References
1. K.-N. Liou, “Influence of cirrus clouds on weather and climate processes: A global perspective,” Mon. Weather Rev. 114(6), 1167–1199 (1986). [CrossRef]
2. G. L. Stephens, S.-C. Tsay, P. W. Stackhouse Jr, and P. J. Flatau, “The relevance of the microphysical and radiative properties of cirrus clouds to climate and climatic feedback,” J. Atmos. Sci. 47(14), 1742–1754 (1990). [CrossRef]
3. Q. Cai and K.-N. Liou, “Polarized light scattering by hexagonal ice crystals: theory,” Appl. Opt. 21(19), 3569–3580 (1982). [CrossRef]
4. M. Hess and M. Wiegner, “COP: a data library of optical properties of hexagonal ice crystals,” Appl. Opt. 33(33), 7740–7746 (1994). [CrossRef]
5. M. I. Mishchenko, “Vector radiative transfer equation for arbitrarily shaped and arbitrarily oriented particles: a microphysical derivation from statistical electromagnetics,” Appl. Opt. 41(33), 7114–7134 (2002). [CrossRef]
6. L. Tsang, J. A. Kong, and R. T. Shin, Theory of microwave remote sensing (Wiley, New York, 1985).
7. R. F. Coleman and K.-N. Liou, “Light scattering by hexagonal ice crystals,” J. Atmos. Sci. 38(6), 1260–1271 (1981). [CrossRef]
8. D. O. C. Starr, “A cirrus-cloud experiment: Intensive field observations planned for FIRE,” Bull. Am. Meteorol. Soc. 68(2), 119–124 (1987). [CrossRef]
9. E. Raschke, J. Schmetz, and J. Heintzenberg, “The International Cirrus Experiment (ICE). A joint European effort,” ESA J. 14, 193–199 (1990).
10. A. Macke, J. Mueller, and E. Raschke, “Single scattering properties of atmospheric ice crystals,” J. Atmos. Sci. 53(19), 2813–2825 (1996). [CrossRef]
11. A. Macke, “Scattering of light by polyhedral ice crystals,” Appl. Opt. 32(15), 2780–2788 (1993). [CrossRef]
12. C. Krupp, “Holographische Messungen an Eiskristallen in Cirruswolken während ICE,” (Master Thesis: Institute for Physics, University to Cologne, Germany, 1991).
13. J. Iaquinta, H. Isaka, and P. Personne, “Scattering phase function of bullet rosette ice crystals,” J. Atmos. Sci. 52(9), 1401–1413 (1995). [CrossRef]
14. Y. Takano and K. Liou, “Radiative transfer in cirrus clouds. Part III: Light scattering by irregular ice crystals,” J. Atmos. Sci. 52(7), 818–837 (1995). [CrossRef]
15. K. Yee, “Numerical solution of initial boundary value problems involving Maxwell's equations in isotropic media,” IEEE Trans. Antennas Propag. 14(3), 302–307 (1966). [CrossRef]
16. P. Yang and K. Liou, “Finite-difference time domain method for light scattering by small ice crystals in three-dimensional space,” J. Opt. Soc. Am. A 13(10), 2072–2085 (1996). [CrossRef]
17. Q. H. Liu, “The pseudospectral time-domain (PSTD) algorithm for acoustic waves in absorptive media,” IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control (1998).
18. E. M. Purcell and C. R. Pennypacker, “Scattering and absorption of light by nonspherical dielectric grains,” Astrophys. J. 186, 705–714 (1973). [CrossRef]
19. B. T. Draine, “The discrete-dipole approximation and its application to interstellar graphite grains,” Astrophys. J. 333, 848–872 (1988). [CrossRef]
20. M. A. Yurkin and A. G. Hoekstra, “The discrete dipole approximation: an overview and recent developments,” J. Quant. Spectrosc. Radiat. Transfer 106(1-3), 558–589 (2007). [CrossRef]
21. P. Waterman, “Matrix formulation of electromagnetic scattering,” Proc. IEEE 53(8), 805–812 (1965). [CrossRef]
22. P. C. Waterman, “Symmetry, unitarity, and geometry in electromagnetic scattering,” Phys. Rev. D 3(4), 825–839 (1971). [CrossRef]
23. M. I. Mishchenko, L. D. Travis, and A. A. Lacis, Scattering, absorption, and emission of light by small particles (Cambridge University Press, Cambridge, 2002).
24. L. Bi, P. Yang, G. W. Kattawar, and M. I. Mishchenko, “Efficient implementation of the invariant imbedding T-matrix method and the separation of variables method applied to large nonspherical inhomogeneous particles,” J. Quant. Spectrosc. Radiat. Transfer 116, 169–183 (2013). [CrossRef]
25. B. Sun, L. Bi, P. Yang, M. Kahnert, and G. Kattawar, Invariant Imbedding T-matrix method for light scattering by nonspherical and inhomogeneous particles (Elsevier, Amsterdam, 2019).
26. L. Bi, P. Yang, G. W. Kattawar, Y. Hu, and B. A. Baum, “Diffraction and external reflection by dielectric faceted particles,” J. Quant. Spectrosc. Radiat. Transfer 112(2), 163–173 (2011). [CrossRef]
27. K.-N. Liou and J. E. Hansen, “Intensity and polarization for single scattering by polydisperse spheres: a comparison of ray optics and Mie theory,” J. Atmos. Sci. 28(6), 995–1004 (1971). [CrossRef]
28. K.-N. Liou, “Light scattering by ice clouds in the visible and infrared: A theoretical study,” J. Atmos. Sci. 29(3), 524–536 (1972). [CrossRef]
29. P. Wendling, R. Wendling, and H. K. Weickmann, “Scattering of solar radiation by hexagonal ice crystals,” Appl. Opt. 18(15), 2663–2671 (1979). [CrossRef]
30. P. Yang, B. A. Baum, A. J. Heymsfield, Y. X. Hu, H.-L. Huang, S.-C. Tsay, and S. Ackerman, “Single-scattering properties of droxtals,” J. Quant. Spectrosc. Radiat. Transfer 79-80, 1159–1169 (2003). [CrossRef]
31. B. Sun, P. Yang, G. W. Kattawar, and X. Zhang, “Physical-geometric optics method for large size faceted particles,” Opt. Express 25(20), 24044–24060 (2017). [CrossRef]
32. B. Sun, G. W. Kattawar, P. Yang, M. S. Twardowski, and J. M. Sullivan, “Simulation of the scattering properties of a chain-forming triangular prism oceanic diatom,” J. Quant. Spectrosc. Radiat. Transfer 178, 390–399 (2016). [CrossRef]
33. P. G. Stegmann, C. Tropea, E. Järvinen, and M. Schnaiter, “Comparison of measured and computed phase functions of individual tropospheric ice crystals,” J. Quant. Spectrosc. Radiat. Transfer 178, 379–389 (2016). [CrossRef]
34. L. Li, P. G. Stegmann, S. Rosenkranz, W. Schäfer, and C. Tropea, “Simulation of light scattering from a colloidal droplet using a polarized Monte Carlo method: application to the time-shift technique,” Opt. Express 27(25), 36388–36404 (2019). [CrossRef]
35. J. Hodkinson and I. Greenleaves, “Computations of light-scattering and extinction by spheres according to diffraction and geometrical optics, and some comparisons with the Mie theory,” J. Opt. Soc. Am. A 53(5), 577–588 (1963). [CrossRef]
36. B. Sun, P. Yang, G. W. Kattawar, and M. I. Mishchenko, “On Babinet’s principle and diffraction associated with an arbitrary particle,” Opt. Lett. 42(23), 5026–5029 (2017). [CrossRef]
37. P. Yang and K. Liou, “Geometric-optics–integral-equation method for light scattering by nonspherical ice crystals,” Appl. Opt. 35(33), 6568–6584 (1996). [CrossRef]
38. K. Muinonen, “Scattering of light by crystals: a modified Kirchhoff approximation,” Appl. Opt. 28(15), 3044–3050 (1989). [CrossRef]
39. P. Yang and K. Liou, “Light scattering by hexagonal ice crystals: solutions by a ray-by-ray integration algorithm,” J. Opt. Soc. Am. A 14(9), 2278–2289 (1997). [CrossRef]
40. L. Bi, P. Yang, G. W. Kattawar, Y. Hu, and B. A. Baum, “Scattering and absorption of light by ice particles: solution by a new physical-geometric optics hybrid method,” J. Quant. Spectrosc. Radiat. Transfer 112(9), 1492–1508 (2011). [CrossRef]
41. A. Borovoi, A. Konoshonkin, and N. Kustova, “The physical-optics approximation and its application to light backscattering by hexagonal ice crystals,” J. Quant. Spectrosc. Radiat. Transfer 146, 181–189 (2014). [CrossRef]
42. C. D. Rodgers, Inverse methods for atmospheric sounding: theory and practice (World scientific, 2000), Vol. 2.
43. R. Spurr, J. Wang, J. Zeng, and M. Mishchenko, “Linearized T-matrix and Mie scattering computations,” J. Quant. Spectrosc. Radiat. Transfer 113(6), 425–439 (2012). [CrossRef]
44. B. Sun, C. Gao, L. Bi, and R. Spurr, “Analytical Jacobians of single scattering optical properties using the invariant imbedding T-matrix method,” Opt. Express 29(6), 9635–9669 (2021). [CrossRef]
45. J. F. Hughes, A. Van Dam, M. McGuire, J. D. Foley, D. Sklar, S. K. Feiner, and K. Akeley, Computer graphics: principles and practice (Pearson Education, 2014).
46. H. Zhang, G. Chen, S. Liu, P. Jing, and Z. Han, “An Extension to Weiler–Atherton Clipping Algorithm for the Face-to-Face Contact in Three-Dimensional Discrete Element Method,” in Geotechnical Hazards from Large Earthquakes and Heavy Rainfalls (Springer, 2017), pp. 333–338.
47. X. Chen and S. McMains, “Polygon offsetting by computing winding numbers,” in International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, 2005), 565–575.