检索结果-南通市图书馆

Iterative physical optics method based on efficient occlusion judgment with bounding volume hierarchy technology

Journal of Electronic Science and Technology 2024年第1期22卷 1-12页

作者： Yang Su Yu-Mao Wu Jun Hu Key Laboratory for Information Science of Electromagnetic Waves(MoE) School of Information Science and TechnologyFudan UniversityShanghai200433China School of Electronic Science and Engineering University of Electronic Science and Technology of ChinaChengdu611731China

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 *** is verified in multiple examples that the proposed method can complete the convergence of the ***,the proposed method avoids the error of judging the lit-shadow relationship based on the normal vector,which is beneficial to current iteration and *** with the brute force method,the current method can improve the simulation efficiency by 2 orders of *** proposed method is more suitable for scattering problems in electrically large cavities and complex scenarios.

关键词： bounding volume hierarchy Cavity scattering Iterative physical optics(IPO)

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

BADF:bounding volume Hierarchies Centric Adaptive Distance Field Computation for Deformable Objects on GPUs

引用

Journal of Computer Science & Technology 2022年第3期37卷 731-740页

作者： Xiao-Rui Chen Min Tang Cheng Li Dinesh Manocha Ruo-Feng Tong Laboratory of Geometry Image and Video Processing Enterprise Intelligent ComputingCollege of Computer Science and TechnologyZhejiang UniversityHangzhou 310007China Geometric Algorithms for Modeling Motionand Animation LaboratoryUniversity of MarylandMaryland 20742U.S.A.

We present a novel algorithm BADF(bounding volume hierarchy Based Adaptive Distance Fields)for accelerating the construction of ADFs(adaptive distance fields)of rigid and deformable models on graphics processing *** approach is based on constructing a bounding volume hierarchy(BVH)and we use that hierarchy to generate an octree-based *** exploit the coherence between successive frames and sort the grid points of the octree to accelerate the *** approach is applicable to rigid and deformable *** GPU-based(graphics processing unit based)algorithm is about 20x--50x faster than current mainstream central processing unit based *** BADF algorithm can construct the distance fields for deformable models with 60k triangles at interactive rates on an NVIDIA GTX GeForce ***,we observe 3x speedup over prior GPU-based ADF algorithms.

关键词： distance field deformable object graphics processing unit(GPU) octree bounding volume hierarchy

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Use of the Spatial kD-Tree in Computational Physics Applications

引用

Communications in Computational Physics 2007年第3期2卷 545-576页

作者： A.Khamayseh G.Hansen Computer Science and Mathematics Division Oak Ridge National LaboratoryOak RidgeTN 37831USA. Multiphysics Methods Group Idaho National LaboratoryIdaho FallsIDUSA.

The need to perform spatial queries and searches is commonly encountered within the field of computational *** development of applications ranging from scientific visualization to finite element analysis requires efficient methods of locating domain objects relative to general locations in *** of the time,it is possible to form and maintain spatial relationships between objects either explicitly or by using relative motion constraints as the application evolves in ***,either due to unpredictable relative motion or the lack of state information,an application must perform a general search(or ordering)of geometric objects without any explicit spatial relationship information as a *** previous state information involving domain geometric objects is not available,it is typically an involved and time consuming process to create object adjacency information or to order the objects in ***,as the number of objects and the spatial dimension of the problem domain is increased,the time required to search increases *** paper proposes an implementation of a spatial k-d tree(skD-tree)for use by various applications when a general domain search is *** skD-tree proposed in this paper is a spatial access method where successive tree levels are split along different *** are indexed by their centroid,and the minimum bounding box of objects in a node are stored in the tree *** paper focuses on a discussion of efficient and practical algorithms for multidimensional spatial data structures for fast spatial query *** functions include the construction of a skD-tree of geometric objects,intersection query,containment query,and nearest neighbor query operations.

关键词： Geometric query bounding volume hierarchy skD-tree containment query mesh generation h-refinement remapping.

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：