QQ客服 官方微博 反馈留言

	模型适应的凸包围多面体并行生成算法
	唐磊 ; 施侃乐 ; 雍俊海 ; 古和今 ; 徐鑫 ; TANG Lei ; SHI KanLe ; YONG JunHai ; GU HeJin ; XU Xin
	2016-03-30 ; 2016-03-30
关键词	凸包围多面体 近似凸包 包围体 并行计算 碰撞检测 high performance computing numerical climate model parallel I / O Net CDF TP391.41
其他题名	Parallel construction for model-adaptive convex bounding polyhedron
中文摘要	包围盒在计算机图形学和计算几何领域中应用广泛,常用于加速几何求交、光线跟踪和碰撞检测等多种算法.凸包围多面体是包围盒的推广,对于一般不规则形体,可达到比包围盒更好的紧致程度.本文提出一种快速构造给定点集的紧致凸包围多面体的方法.该方法首先根据点集的近似凸包,通过k-means算法生成k个截面法向,然后利用GPU沿各法向搜索切点构成截面,最后求交构成多面体.实验结果表明,与同类算法相比,该方法能够更快地构造给定点集更紧致的凸包围多面体,并能有效加速碰撞检测算法.; Bounding box is extensively used to accelerate algorithms such as geometric intersection, ray tracing and collision detection in computer graphics and computational geometry. Convex bounding polyhedron, which is a generalization of bounding box, can approximate a point set with higher tightness compared to the corresponding bounding box in usual cases. This paper proposes a method to construct the convex bounding polyhedron from a point set. Based on the coarsely approximate convex hull, the algorithm generates k normals by k-means algorithm. The algorithm searches the tangent point to generate a cutting plane along each normal on GPU and then constructs the convex bounding polyhedron by intersection of the cutting planes. Experiments illustrate that the algorithm can construct tighter convex bounding polyhedron efficiently and this advantage accelerates collision detection algorithms.
语种	中文 ; 中文
内容类型	期刊论文
源URL	[http://ir.lib.tsinghua.edu.cn/ir/item.do?handle=123456789/147006]
专题	清华大学
推荐引用方式 GB/T 7714	唐磊,施侃乐,雍俊海,等. 模型适应的凸包围多面体并行生成算法[J],2016, 2016.
APA	唐磊.,施侃乐.,雍俊海.,古和今.,徐鑫.,...&XU Xin.(2016).模型适应的凸包围多面体并行生成算法..
MLA	唐磊,et al."模型适应的凸包围多面体并行生成算法".(2016).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。