首页> 外文期刊>urnal of Symbolic Computation >Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms
【24h】

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms

机译:几何约束问题的分解计划,第二部分:新算法

获取原文
获取原文并翻译 | 示例
       

摘要

We systematically design two new decomposition-recombination (DR) planners, geared to perform well with respect to several performance measures. The DR-planning problem and the performance measures were formally defined in Part I of this paper to closely reflect specific requirements of CAD/CAM applications. As expected, in analysis and comparison based on all of these performance measures, one of the new DR-planners, the modified frontier algorithm (MFA), represents a significant improvement over existing planners based on SR (constraint shape recognition) and MM(maximum matching) that were analyzed in Part I. We also present salient heuristics and data structures used in the implementation of MFA.
机译:我们系统地设计了两个新的分解重组(DR)计划程序,这些计划程序在多个性能指标方面表现良好。在本文的第一部分中正式定义了灾难恢复计划问题和性能度量,以紧密反映CAD / CAM应用程序的特定要求。不出所料,在基于所有这些性能指标的分析和比较中,新的DR计划者之一,即改进的边界算法(MFA),相对于基于SR(约束形状识别)和MM(最大)的现有计划者而言,具有重大改进匹配)(在第一部分中进行了分析)。我们还介绍了在MFA实施中使用的重要启发式方法和数据结构。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号