首页> 外文会议>25th SIBGRAPI - Conference on Graphics, Patterns and Images. >Connectivity Oblivious Merging of Triangulations
【24h】

Connectivity Oblivious Merging of Triangulations

机译:连接性忽略了三角剖分的合并

获取原文
获取原文并翻译 | 示例

摘要

Simplicial meshes are extremely useful as discrete approximations of continuous spaces in numerical simulations. In some applications, however, meshes need to be modified over time. Mesh update operations are often expensive and brittle, which tends to make the numerical simulations unstable. In this paper we propose an alternative technique for updating simplicial meshes that undergo geometric and topological changes. We exploit the property that a Weighted Delaunay Triangulation (WDT) can be used to implicitly define the connectivity of a mesh. Instead of explicitly maintaining connectivity information, we simply keep a collection of weights associated with each vertex. This approach allows for a simple way to merge triangulations, which we illustrate with examples in 2D and 3D.
机译:简单网格在数值模拟中作为连续空间的离散逼近非常有用。但是,在某些应用中,网格需要随时间进行修改。网格更新操作通常很昂贵且脆弱,这往往会使数值模拟变得不稳定。在本文中,我们提出了另一种更新经历几何和拓扑变化的简单网格的技术。我们利用加权Delaunay三角剖分(WDT)可以隐式定义网格的连通性这一特性。无需显式维护连接性信息,我们只需保留与每个顶点关联的权重集合。这种方法提供了合并三角剖分的简单方法,我们将以2D和3D中的示例进行说明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号