• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Advances in Engineering Software >Dealing with redundancy and inconsistency in constructive geometric constraint solving
【24h】

Dealing with redundancy and inconsistency in constructive geometric constraint solving

机译：在构造性几何约束求解中处理冗余和不一致性

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

摘要

General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. However, all these methods are based on the assumption that structural rigidity automatically assures solvability. In this paper, we show that this assumption fails in numerous, even the most basic, configurations. We introduce several simple but efficient rules aimed to additionally analyse solvability in such cases. Another novelty addresses conditional constraints between three or more geometric parts, rules for their simplification and a redundancy check. All these functionalities are built into our original 2D geometric constraint solver, based on concepts of rigid clusters and constrained-angle (CA) sets.
机译：通用的构造性几何约束求解器通过自由度分析进行预处理，从而可以进行有效的图形分解和重组。但是，所有这些方法均基于结构刚度自动确保可溶解性的假设。在本文中，我们证明了这种假设在许多甚至最基本的配置中都失败了。我们介绍了一些简单但有效的规则，旨在在这种情况下另外分析可解性。另一个新颖性解决了三个或更多几何部分之间的条件约束，简化规则和冗余检查。所有这些功能都基于刚性簇和约束角（CA）集的概念内置于我们原始的2D几何约束求解器中。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号