Real-time Ligaturing Simulation of Blood Vessel in Virtual Simulation Training System of Liver Surge

来源 :2015全国理论计算机科学学术年会 | 被引量 : 0次 | 上传用户:lzbtthappy
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  This paper presents an integrated method for ligaturing simulation of blood vessel in Virtual Simulation Training System of Liver Surgery.The integrated method mainly includes four aspects: simulation of suture, collision detection of suture and blood vessel, deformation of blood vessel and haptic feedback of ligaturing simulation.In this paper, FTL (Follow The Leader) algorithm is employed to configure the motion of suture, and motion decomposition method is introduced to manages collisions to prevent penetrations of suture.BVH method and grid method are integrated to handle the collision detection of suture and blood vessel.Moreover, a rigid core is employed to limit the deformation of blood vessel mesh,and haptic feedback is implemented by a novel way.The integrated method is efficient and realistic for the ligaturing simulation of blood vessel in Virtual Simulation Training System of Liver Surgery.
其他文献
  In this paper, we consider the problem of scheduling jobs with release dates and rejection on a bounded single parallel batching machine.Our objective is to
会议
  As an important class of approximate dynamic programming, the direct heuristic dynamic programming (DHDP) is discussed in this paper.DHDP performs well due
会议
【本刊讯】2017年1月17日,中国黄金集团公司2017年工作会议暨第一届职工代表大会第二次会议在北京召开。国有企业监事会主席董树奎出席会议,集团公司总经理、党委书记宋鑫出
  Conditional probability neural network (CPNN) has special advantage in pattern classification problems.However, how to find the optimal parameters of the CP
会议
巧妙开发设计课前三分钟,将课前三分钟作为学生展示英语“学习成果”的时间,开展各种形式的英语活动,活跃了课堂气氛,提高了课堂效率,这就犹如一首美妙的课堂教学的乐曲奏响
  In this paper, we studied the problem of link prediction in directed signed social networks.The relationships of these networks can be either positive (frie
会议
在实施少儿美术教育的过程中,首先要找到适合少儿美术教育的教学方法,才能引导与培养少儿对学习美术这门学科的兴趣.通过与少儿感兴趣的玩具及简单的美术构图的结合,让少儿慢
  We consider a regular random (k, s)-SAT problem.We show that for all k exceeding an absolute constant k0, with the clause density αureq > 2klog2-klog2/2 +
会议
请下载后查看,本文暂不支持在线获取查看简介。 Please download to view, this article does not support online access to view profile.
  In this paper, we study a flow shop problem called F2→D丨v=1, c ≥1[Cmax In the problem, there are n jobs needed to be processed on machine A first, then o
会议