首页> 外文学位 >Quality Delaunay meshing of polyhedral volumes and surfaces.
【24h】

Quality Delaunay meshing of polyhedral volumes and surfaces.

机译:多面体体积和表面的质量Delaunay网格划分。

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

摘要

Many applications such as finite element methods, computer graphics, and numerical simulations require meshing a surface or the volume enclosed by one in three dimensions. We consider polyhedral surfaces and volumes and mesh them with Delaunay refinement. We present four algorithms, QUALMESH, POLYSURFMESH, WQUALMESH, and SURFREMESH. The first one, QUALMESH, computes a Delaunay mesh of the volume enclosed by an input polyhedron possibly with small input angles. The generated mesh conforms to the input, and the circumradius to shortest edge ratio, also called radius-edge ratio, of most of the tetrahedra in the output mesh are bounded above by a constant. Some of the output tetrahedra do remain "bad", but they are only in the vicinity of small input angles. Second, we present POLYSURFMESH, a modification of the QUALMESH algorithm, to generate a triangular surface mesh of an input polyhedra such that the output mesh conforms to every vertex, edge, and facet of the input and the radius-edge ratio of most of the triangles are bounded from above. Those triangles which are "bad" also remain in the vicinity of sharp input angles.One deficiency of QUALMESH is that its output mesh might have a particular kind of bad tetrahedra called slivers. The third algorithm, WQUALMESH extends QUALMESH using the weighted Delaunay triangulation to remove most of the slivers from the output of QUALMESH. Some of the slivers do remain in the output but they are again only in the vicinity of sharp angles.Finally, SURFREMESH remeshes a polygonal surface approximating a smooth surface. The output surface is guaranteed to be homeomorphic to the input, and the output triangles have bounded radius-edge ratio. This algorithm starts with a few points chosen from the input surface and gradually builds the entire surface to satisfy user-defined thresholds for parameters capturing the geometric closeness to the input surface. These parameters allow the user to extract the surface at different levels of detail. Implementation results of all the algorithms are presented, and they corroborate with the theory.
机译:诸如有限元方法,计算机图形学和数值模拟之类的许多应用程序都需要对一个表面或体积进行三维划分的网格划分网格。我们考虑多面体的表面和体积,并用Delaunay细化对其进行网格划分。我们提出了四种算法,QUALMESH,POLYSURFMESH,WQUALMESH和SURFREMESH。第一个是QUALMESH,它计算输入多面体所包围的体积的Delaunay网格(可能具有较小的输入角度)。生成的网格符合输入,并且输出网格中大多数四面体的外圆与最短边之比(也称为半径边比)在上方被常数限制。一些输出四面体确实保持“坏”,但是它们仅在小输入角附近。其次,我们介绍POLYSURFMESH(对QUALMESH算法的一种修改),以生成输入多面体的三角形曲面网格,以使输出网格符合输入的每个顶点,边缘和小平面以及大多数输入点的半径-边缘比。三角形从上方定界。这些“坏”的三角形也保留在锐角的输入角附近。QUALMESH的一个不足之处是其输出网格可能具有一种特殊的坏四面体,称为条。第三种算法WQUALMESH使用加权Delaunay三角剖分扩展了QUALMESH,以从QUALMESH的输出中删除大部分条子。一些条子确实保留在输出中,但它们仍然仅在锐角附近。最后,SURFREMESH重新合并多边形表面,使其接近平滑表面。确保输出曲面与输入同胚,并且输出三角形具有有限的半径边沿比率。该算法从从输入表面选择的几个点开始,然后逐步构建整个表面,以满足用户定义的阈值,以获取捕获与输入表面的几何紧密度的参数。这些参数允许用户以不同的细节级别提取表面。给出了所有算法的实现结果,并与理论相吻合。

著录项

  • 作者

    Ray, Tathagata.;

  • 作者单位

    The Ohio State University.;

  • 授予单位 The Ohio State University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2006
  • 页码 162 p.
  • 总页数 162
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号