• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications - ICCSA 2003 Pt.3 May 18-21, 2003 Montreal, Canada >A Graph Based Algorithm for Intersection of Subdivision Surfaces
【24h】

A Graph Based Algorithm for Intersection of Subdivision Surfaces

机译：基于图的细分曲面相交算法

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

摘要

Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.
机译：计算表面相交是几何建模中的一个基本问题。任何布尔运算都可以视为交集计算，然后选择构建最终对象表面所需的零件。本文提出了一种鲁棒而高效的算法来计算细分曲面（由Loop方案生成的曲面）上的交点。该算法依赖于二部图的概念，该二部图可以减少面相交测试的数量。通过使用二部图和给定细分级别的相交面的邻域来推导相交面，以推导以下细分级别的相交面，从而加快了相交计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号