检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Key Laboratory for Information Science of Electromagnetic Waves(MoE),School of Information Science and Technology,Fudan University,Shanghai,200433,China [2]School of Electronic Science and Engineering,University of Electronic Science and Technology of China,Chengdu,611731,China
出 处:《Journal of Electronic Science and Technology》2024年第1期1-12,共12页电子科技学刊(英文版)
基 金:the National Natural Science Foundation of China under Grants No.62231021 and No.92373201.
摘 要:This paper builds a binary tree for the target based on the bounding volume hierarchy technology,thereby achieving strict acceleration of the shadow judgment process and reducing the computational complexity from the original O(N^(3))to O(N^(2)logN).Numerical results show that the proposed method is more efficient than the traditional method.It is verified in multiple examples that the proposed method can complete the convergence of the current.Moreover,the proposed method avoids the error of judging the lit-shadow relationship based on the normal vector,which is beneficial to current iteration and convergence.Compared with the brute force method,the current method can improve the simulation efficiency by 2 orders of magnitude.The proposed method is more suitable for scattering problems in electrically large cavities and complex scenarios.
关 键 词:Bounding volume hierarchy Cavity scattering Iterative physical optics(IPO)
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7