• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications - ICCSA 2003 Pt.3 May 18-21, 2003 Montreal, Canada >'CONTOUR' Algorithm for Finding and Visualizing Flat Sections of 3D-Objects
【24h】

'CONTOUR' Algorithm for Finding and Visualizing Flat Sections of 3D-Objects

机译：查找和可视化3D对象的平面截面的“ CONTOUR ”算法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

One of the visualization problems implies finding boundaries and insides of flat sections of 3D objects specified analytically. This problem is to be solved to analyze the results and to control the geometry specification. On the one hand, the analytic definition of profiles for "not simple" 3D-objects in general case is actually unsolvable problem; on the other hand, it is necessary to apply virtual designing of 3D-objects in the field of numerical simulation. The numerical algorithm "CONTOUR" is proposed for finding the connected section contour of 3D-objects, which are specified analytically in the form of second-order planes and rotation connected by multiple-theoretic operations. "CONTOUR" algorithm suggests using topologically parallel scanning for generating the empirical values, and then, considering them in the process of isoline generation, the polygonal section contour is constructed.
机译：可视化问题之一意味着寻找解析指定的3D对象的平面部分的边界和内部。需要解决该问题以分析结果并控制几何规格。一方面，一般情况下“非简单” 3D对象的轮廓的解析定义实际上是无法解决的问题。另一方面，有必要在数值模拟领域中对3D对象进行虚拟设计。提出了一种数值算法“ CONTOUR”，用于寻找3D对象的连接截面轮廓，这些轮廓以二阶平面和通过多理论运算连接的旋转形式解析地指定。 “ CONTOUR”算法建议使用拓扑并行扫描生成经验值，然后在等值线生成过程中考虑它们，从而构造多边形截面轮廓。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号