节点文献

一种几何约束系统分解算法

Decomposing algorithm for geometric constraint system

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 袁波李彦涛胡事民孙家广

【Author】 YUAN Bo, LI Yantao, HU Shimin, SUN Jiaguang (Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China)

【机构】 清华大学计算机科学与技术系!北京100084

【摘要】 为提高变量化设计效率和数值稳定性 ,提出了一种结合剪枝操作和归约操作的几何约束系统分解算法 :剪枝 -归约算法。该算法能够处理完备约束、过约束以及欠约束情况下几何约束系统的分解问题。同时讨论了在欠约束条件下如何获得符合设计意图的分解方案的问题

【Abstract】 Decomposition of a geometric constraint system is an effective way to improve computing efficiency and numerical stability in variational design. Two graph decomposing operations, clipping and reducing, were introduced based on the constraint graph. The clipping operation was applied to sparse coupling conditions while the reducing operator was applied to dense coupling conditions. A decomposing algorithm was developed by integrating the two graph operations, and could decompose well , over and under constrained geometric systems. The problem was also discussed of how to find the design intent satisfied decomposition plan in the under constrained design conditions.

【基金】 国家自然科学基金项目!(6 9772 0 1 9)
  • 【文献出处】 清华大学学报(自然科学版) ,JOURNAL OF TSINGHUA UNIVERSITY(SCIENCE AND TECHNOLOGY) , 编辑部邮箱 ,2000年01期
  • 【分类号】TP391.7
  • 【被引频次】13
  • 【下载频次】92
节点文献中: 

本文链接的文献网络图示:

本文的引文网络