引用本文:袁波,李彦涛,孙家广.一种设计分解的正确性证明.软件学报,2001,12(3):323-328
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4878次   下载 5168 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一种设计分解的正确性证明
袁波1, 李彦涛1, 孙家广1
清华大学计算机科学与技术系,北京 100084
摘要:
二维变量化设计系统可以用含有n个未知数、m个方程的非线性方程组表示.通过设计分解可以提高几何约束求解的效率和数值稳定性.给出了一种基于图论的设计分解方法及其正确性证明.该方法可以(1)处理结构欠约束系统的分解;(2)检测出冗余约束.分解算法在有限步内终止,其结果是结构相容的
关键词:  设计分解  几何约束求解  剪枝  规约
DOI:
分类号:
基金项目:This projecet is suppiorted bny the National Natural Science of Chian under Grant No.69772019(国家自然科学基金)
The Correctness Proof of a Decomposing Approach
YUAN Bo,LIYan-tao,SUN Jia-guang
Abstract:
Mathematically a 2Dconstrained design system can be modeled by m independent nonlinear equa-tions with n design variables and the design process can be viewed as a process ofsolving a geometric constraintsystem.Design decomposition is a highly effective way to improve a geometric constraint solver to make it effi-cient and robust.This paper reports a graph based decomposing approach and gives the correctness proof oftheapproach:(1)this approach can dealwith the decomposition ofstructurally under-constrained systems,(2)thisapproach can detect structurally over-constrained systems,(3)the approach can terminate within finite numberofsteps,and(4)the solving steps obtained through the decomposing approach are structurally consistent.
Key words:  design decomposition  geometric constraint solving  graph clipping  graph reducing