节点文献
基于点簇归约的几何约束求解器研究
Research on Geometric Constraint Solver Based on the Point-cluster Reduction
【摘要】 提出了一种新的几何约束推理求解算法。该算法基于点簇对约束网络图进行归约 ,求得归约序列然后重构几何模型 ,具有求解速度快、可靠性高、应用范围广等优点。已利用面向对象的C ++开发实现了以该算法为核心的几何约束求解器 ,并且作为白玉兰CAD系统的重要组成部分得到了推广应用。
【Abstract】 A new geometric constraint solving method is presented. The reduction is carried out by using geometric constraint graph based on the point clusters. Then the sequence of reduction is computed and the geometric model is rebuilded. This algorithm is efficient, reliable and flexible. Based on this method, we develop the geometric constraint solver by using object oriented C++, which is a major component of BYLCAD system.
【关键词】 参数化设计;
几何约束;
归约;
点簇;
【Key words】 Parametric design; Geometric constraint; Reduction; Point cluster;
【Key words】 Parametric design; Geometric constraint; Reduction; Point cluster;
【基金】 86 3计划 ( 86 3 511 82 0 0 2 4 );上海市科委(9851110 0 1)资助项目
- 【文献出处】 高技术通讯 ,High Technology Letters , 编辑部邮箱 ,2002年06期
- 【分类号】TP391.72
- 【被引频次】6
- 【下载频次】70