• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of the Brazilian Society of Mechanical Sciences and Engineering >Converting CSG models into meshed B-Rep models using euler operators and propagation based marching cubes
【24h】

Converting CSG models into meshed B-Rep models using euler operators and propagation based marching cubes

机译：使用欧拉算子和基于传播的行进立方体将CSG模型转换为网状B-Rep模型

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The purpose of this work is to define a new algorithm for converting a CSG representation into a B-Rep representation. Usually this conversion is done determining the union, intersection or difference from two B-Rep represented solids. Due to the lack of explicit representation of surface boundaries, CSG models must be converted into B-Rep solid models when a description based on polygonal mesh is required. A potential solution is to convert a CSG model into a voxel based volume representation and then construct a B-Rep solid model. This method is called CSG voxelization, conceptually it is a set membership classification problem with respect to the CSG object for all sampling points in a volume space. Marching cubes algorithms create a simple mesh that is enough for visualization purposes. However, when engineering processes are involved, a solid model is necessary. A solid ensures that all triangles in the mesh are consistently oriented and define a closed surface. It is proposed in this work an algorithm for converting CSG models into triangulated solid models through propagation based marching cubes algorithm. Three main new concepts are used in the algorithm: open boundary, B-Rep/CSG Voxelization mapping and constructive triangulation of active cells. The triangles supplied by the marching cubes algorithm need not be coherently oriented; the algorithm itself finds the correct orientation for the supplied triangles. The proposed algorithm restricts the exploration to the space occupied by the solid's boundary. Differently from normal marching cubes algorithms that explore the complete sampled space.
机译：这项工作的目的是定义一种用于将CSG表示转换为B-Rep表示的新算法。通常，此转换是通过确定两个B-Rep表示的实体的并集，相交或差来完成的。由于缺少表面边界的明确表示，当需要基于多边形网格的描述时，必须将CSG模型转换为B-Rep实体模型。潜在的解决方案是将CSG模型转换为基于体素的体积表示，然后构建B-Rep实体模型。此方法称为CSG体素化，从概念上讲，它是针对体积空间中所有采样点的CSG对象的集合成员资格分类问题。行进立方体算法可创建一个简单的网格，足以用于可视化目的。但是，当涉及工程过程时，必须使用实体模型。实体可确保网格中的所有三角形一致地定向并定义一个闭合表面。在这项工作中，提出了一种通过基于传播的行进立方体算法将CSG模型转换为三角实体模型的算法。算法中使用了三个主要的新概念：开放边界，B-Rep / CSG体素化映射和活动单元的构造性三角剖分。行进立方体算法提供的三角形不需要一致地定向;算法本身会为提供的三角形找到正确的方向。所提出的算法将探索限制在实体边界所占据的空间内。与探索完整采样空间的普通行进立方体算法不同。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号