首页> 外文学位 >Algorithms and methods for discrete mesh repair.
【24h】

Algorithms and methods for discrete mesh repair.

机译:离散网格修复的算法和方法。

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

摘要

Computational analysis and design has become a fundamental part of product research, development, and manufacture in aerospace, automotive, and other industries. In general the success of the specific application depends heavily on the accuracy and consistency of the computational model used. The aim of this work is to reduce the time needed to prepare geometry for mesh generation. This will be accomplished by developing tools that semi-automatically repair discrete data. Providing a level of automation to the process of repairing large, complex problems in discrete data will significantly accelerate the grid generation process. The developed algorithms are meant to offer semi-automated solutions to complicated geometrical problems---specifically discrete mesh intersections and isolated boundaries.;The intersection-repair strategy presented here focuses on repairing the intersection in-place as opposed to re-discretizing the intersecting geometries. Combining robust, efficient methods of detecting intersections and then repairing intersecting geometries in-place produces a significant improvement over techniques used in current literature. The result of this intersection process is a non-manifold, non-intersecting geometry that is free of duplicate and degenerate geometry. Results are presented showing the accuracy and consistency of the intersection repair tool.;Isolated boundaries are a type of gap that current research does not address directly. They are defined by discrete boundary edges that are unable to be paired with nearby discrete boundary edges in order to fill the existing gap. In this research the method of repair seeks to fill the gap by extruding the isolated boundary along a defined vector so that it is topologically adjacent to a nearby surface. The outcome of the repair process is that the isolated boundaries no longer exist because the gap has been filled. Results are presented showing the precision of the edge projection and the advantage of edge splitting in the repair of isolated boundaries.
机译:计算分析和设计已成为航空航天,汽车和其他行业产品研究,开发和制造的基础部分。通常,特定应用程序的成功在很大程度上取决于所使用的计算模型的准确性和一致性。这项工作的目的是减少准备用于生成网格的几何体所需的时间。这将通过开发半自动修复离散数据的工具来实现。为修复离散数据中的大型复杂问题的过程提供一定程度的自动化将大大加快网格生成过程。所开发的算法旨在为复杂的几何问题提供半自动化的解决方案-特别是离散的网格交点和孤立的边界。;此处提出的交点修复策略着重于就地修复交点,而不是使交集重新离散化几何形状。结合鲁棒,有效的方法来检测相交,然后就地修复相交的几何形状,与当前文献中使用的技术相比,有了重大改进。这种相交过程的结果是一个无流形,不相交的几何图形,其中没有重复和退化的几何图形。给出的结果显示了相交修复工具的准确性和一致性。隔离边界是当前研究无法直接解决的一种缺口。它们由无法与附近的离散边界边缘配对以填充现有间隙的离散边界边缘定义。在这项研究中,修复方法试图通过沿定义的矢量拉伸孤立的边界以使其在拓扑上邻近附近的表面来填充间隙。修复过程的结果是,隔离的边界不再存在,因为已填补了空白。结果表明边缘投影的精度和边缘分裂在孤立边界修复中的优势。

著录项

  • 作者

    McLaurin, David Owen.;

  • 作者单位

    Mississippi State University.;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号