语义特征造型的与历程无关技术的研究
|
摘要
特征造型技术能够为设计人员提供特定领域内高层次的概念设计与功能设计。传统的造型技术与参数化、变量化技术相结合,构成参数化、变量化特征造型系统。这类系统依赖于特征的创建历程,在设计后期,若要对产品模型进行修改,就需要按照设计历程完全重现一遍设计过程,导致模型设计的效率很低。
与历程无关的造型技术是特征建模技术的补充。在与历程无关的造型系统中,设计人员只需关注最终的设计结果,而不必顾及设计的过程。研究与历程无关的特征造型技术,提高造型系统的操作灵活性和造型效率,是造型系统的一个新的发展方向,具有重要的理论意义和实际应用价值。对此,本文从以下几方面进行了研究:
1.根据与历程无关造型的动态、可逆的特点,提出一种基于特征的拓扑元素命名与编码方法。特征的语义与属性在建模过程中保持不变,利用特征名对特征的拓扑面进行命名,然后根据拓扑边和拓扑点的邻接面对边和点进行命名。对于分裂的子面,以特征名为基础按照子面在父面参数域上的顺序对子面进行排序,对子面进行区分。当拓扑边发生分裂或曲面相交产生多条交线时,提出利用参考线进行区分的方法。根据拓扑元素的命名与标识方法,归纳出一种统一格式的拓扑元素编码方法。并提出虚拓扑元素和子边的概念,针对与历程无关模型操作的特点,根据虚拓扑元素和子边的定义方法,提出拓扑元素的继承、分裂与重合操作方法,通过保留模型中拓扑元素间的拓扑关系,实现与历程无关的模型操作过程。
2.根据特征模型的操作方法,提出在模型编辑、修改过程中的模型处理与维护方法。将与历程无关的特征模型操作归纳为:平移、拉伸、旋转三种操作方法。对直接受模型操作影响的特征(或部分模型),若没有发生拓扑结构的改变,则直接通过约束求解得到结果模型并予以显示;若发生了拓扑结构的改变,则利用拓扑元素编码方法进行处理,对于分裂的拓扑元素,根据继承规则与分裂操作方法进行处理;对发生重合的拓扑元素,利用子边及虚拓扑元素进行重合操作的处理。对于间接受模型操作影响的特征(或部分模型),提出利用特征依赖图分析相关特征间存在的依赖关系,建立动态的特征修改优先准则,给出特征优先级的性质,根据特征修改优先准则和优先级性质生成正确的结果模型。并提出在模型操作过程中的有效性检查与恢复方法。
3.建立与历程无关的模型修改过程中的约束求解机制。以几何实体的欧拉参数表达为基础,建立几何约束的基本定义,并推导常用工程几何约束的代数表达方程,以建立几何约束的数学模型。将几何约束的代数方程组转化为优化问题并利用优化法求解问题的解。提出了一种改进的混沌搜索策略,并将该方法与粒子群算法相结合,利用粒子群算法在初期收敛速度快的特点进行初步搜索,当算法陷入局部最优或找到较优解时,利用改进的混沌搜索策略激活并进行精细搜索,从而准确地找到最优解。
4.研究了在与历程无关的造型过程中,特征模型的更新及显示策略。提出将模型的处理过程划分为“预处理”和“实际求解”两步的方法。用特征依赖图(FDG)存储特征信息及特征间的依赖、约束关系,提出将特征依赖图分解为受修改参数影响的“宏几何体”(由相关集确定)和不受影响的刚性体两部分。“宏几何体”是约束求解的主体,将其用几何约束图来表示,图中的每一个约束关系可由约束表达式来表示,并在局部坐标系下进行求解,并研究了在几何约束图中更新求解结果的方法。最后研究了将本文系统用于协同设计的方法。
Feature modeling can provide high-level conception design and function design for designer in special domain. Parametric and variational feature modeling system is built by combining traditional modeling technique with parametric and variational technique. These systems depend on creation history of features, and the whole design process must be repeated according to the design history if the model needs to be modified in later design period. This results in the low efficiency of model design.
History-independent modeling is complement to feature modeling. In history-independent modeling system, the designers only need to pay attention to design results, but not design process. The research on history-independent feature modeling and promoting flexibility and efficiency of modeling system is a new trend of modeling system, which has theoretical and practical significance. This thesis includes the following contents:
Firstly, a method of naming and coding topological entities is proposed, which is based on features, and this method aims at dynamic and reversible characteristics of history-independent modeling. The semantic and attribute of feature is unchangeable in process of modeling. Topological face is named by using feature name, and topological edge and vertex are named by using adjacent faces of them. On the basis of feature name, the split sub-faces are distinguished according to the order that sub-faces are sorted on the parent face. References are used to distinguish the split edges and the multi-edges that produced by surfaces intersection. A uniform coding format is proposed, which is based on topological entities naming. The conception of virtual topological entity and sub-edge are proposed, then inherit, split and merge operation are processed which aim at characteristics of history-independent modeling. History-independent modeling operation is realized through maintaining relations between topological entities in the model.
Secondly, model process and maintain methods during editing and modifying are proposed according to model operation methods. The history-independent feature model operations are summarized as translation, extension and rotation. For features or part models that are directly affected by model modification, the result model can be generated by constraint solving and to be displayed if there are no variations in topological structure. The model is processed based on topological entities coding when topological structures are changed. The split topological entities are processed according to inherit rules and split operation, and the merged topological entities are processed by utilizing sub-edges and virtual topological entities. For features or part models that are indirectly affected by model modification, the relations among these features are analyzed by making use of feature dependent graph (FDG). The dynamic feature modification precedence criteria are built and property of feature precedence is given. The appropriate result model is produced according to these criteria and property. Validity checking and recovery method during process of model modification are proposed.
Thirdly, constraint solving mechanism is proposed in process of history-independent model modification. The basic definition of geometric constraint is built based on Euler parameter expressions of geometric entities. Then the algebraic equations of common project geometric constraints are derived to establish mathematic model of geometric constraints. The algebraic equations of geometric constraints are transformed into optimization problem and are solved by optimization method. An improved chaos search strategy is proposed, and which is introduced into particle swarm optimization algorithm (PSO). PSO searches solutions rapidly in early evolution period, which is used to search primary solutions. When the algorithm gets into the local extremum or finds preferable solutions, the improved chaos search strategy is used to activate the particles and to search the global best solutions accurately.
At last, the update and display strategy of feature model is studied, which can satisfy history-independent modeling. The model process procedure is divided into two steps, namely pretreatment and practical solving. FDG is used to store feature information and relations of dependence and constraints between features. A method of decomposing FDG is proposed, which decomposes FDG into macro-geometry and rigid body. Macro-geometry is affected by the modified parameters, and rigid body is not affected. The macro-geometry is determined by correlation set, which is the principal part of constraint soling. The macro-geometry is expressed in geometric constraint graph. Each constraint relation can be expressed by constraint expressions and be solved in local coordinate system. After the constraints have been solved, the method of updating results in geometric constraint graph is studied. At last, the method of collaborative design based on the proposed system is studied.
与历程无关的造型技术是特征建模技术的补充。在与历程无关的造型系统中,设计人员只需关注最终的设计结果,而不必顾及设计的过程。研究与历程无关的特征造型技术,提高造型系统的操作灵活性和造型效率,是造型系统的一个新的发展方向,具有重要的理论意义和实际应用价值。对此,本文从以下几方面进行了研究:
1.根据与历程无关造型的动态、可逆的特点,提出一种基于特征的拓扑元素命名与编码方法。特征的语义与属性在建模过程中保持不变,利用特征名对特征的拓扑面进行命名,然后根据拓扑边和拓扑点的邻接面对边和点进行命名。对于分裂的子面,以特征名为基础按照子面在父面参数域上的顺序对子面进行排序,对子面进行区分。当拓扑边发生分裂或曲面相交产生多条交线时,提出利用参考线进行区分的方法。根据拓扑元素的命名与标识方法,归纳出一种统一格式的拓扑元素编码方法。并提出虚拓扑元素和子边的概念,针对与历程无关模型操作的特点,根据虚拓扑元素和子边的定义方法,提出拓扑元素的继承、分裂与重合操作方法,通过保留模型中拓扑元素间的拓扑关系,实现与历程无关的模型操作过程。
2.根据特征模型的操作方法,提出在模型编辑、修改过程中的模型处理与维护方法。将与历程无关的特征模型操作归纳为:平移、拉伸、旋转三种操作方法。对直接受模型操作影响的特征(或部分模型),若没有发生拓扑结构的改变,则直接通过约束求解得到结果模型并予以显示;若发生了拓扑结构的改变,则利用拓扑元素编码方法进行处理,对于分裂的拓扑元素,根据继承规则与分裂操作方法进行处理;对发生重合的拓扑元素,利用子边及虚拓扑元素进行重合操作的处理。对于间接受模型操作影响的特征(或部分模型),提出利用特征依赖图分析相关特征间存在的依赖关系,建立动态的特征修改优先准则,给出特征优先级的性质,根据特征修改优先准则和优先级性质生成正确的结果模型。并提出在模型操作过程中的有效性检查与恢复方法。
3.建立与历程无关的模型修改过程中的约束求解机制。以几何实体的欧拉参数表达为基础,建立几何约束的基本定义,并推导常用工程几何约束的代数表达方程,以建立几何约束的数学模型。将几何约束的代数方程组转化为优化问题并利用优化法求解问题的解。提出了一种改进的混沌搜索策略,并将该方法与粒子群算法相结合,利用粒子群算法在初期收敛速度快的特点进行初步搜索,当算法陷入局部最优或找到较优解时,利用改进的混沌搜索策略激活并进行精细搜索,从而准确地找到最优解。
4.研究了在与历程无关的造型过程中,特征模型的更新及显示策略。提出将模型的处理过程划分为“预处理”和“实际求解”两步的方法。用特征依赖图(FDG)存储特征信息及特征间的依赖、约束关系,提出将特征依赖图分解为受修改参数影响的“宏几何体”(由相关集确定)和不受影响的刚性体两部分。“宏几何体”是约束求解的主体,将其用几何约束图来表示,图中的每一个约束关系可由约束表达式来表示,并在局部坐标系下进行求解,并研究了在几何约束图中更新求解结果的方法。最后研究了将本文系统用于协同设计的方法。
Feature modeling can provide high-level conception design and function design for designer in special domain. Parametric and variational feature modeling system is built by combining traditional modeling technique with parametric and variational technique. These systems depend on creation history of features, and the whole design process must be repeated according to the design history if the model needs to be modified in later design period. This results in the low efficiency of model design.
History-independent modeling is complement to feature modeling. In history-independent modeling system, the designers only need to pay attention to design results, but not design process. The research on history-independent feature modeling and promoting flexibility and efficiency of modeling system is a new trend of modeling system, which has theoretical and practical significance. This thesis includes the following contents:
Firstly, a method of naming and coding topological entities is proposed, which is based on features, and this method aims at dynamic and reversible characteristics of history-independent modeling. The semantic and attribute of feature is unchangeable in process of modeling. Topological face is named by using feature name, and topological edge and vertex are named by using adjacent faces of them. On the basis of feature name, the split sub-faces are distinguished according to the order that sub-faces are sorted on the parent face. References are used to distinguish the split edges and the multi-edges that produced by surfaces intersection. A uniform coding format is proposed, which is based on topological entities naming. The conception of virtual topological entity and sub-edge are proposed, then inherit, split and merge operation are processed which aim at characteristics of history-independent modeling. History-independent modeling operation is realized through maintaining relations between topological entities in the model.
Secondly, model process and maintain methods during editing and modifying are proposed according to model operation methods. The history-independent feature model operations are summarized as translation, extension and rotation. For features or part models that are directly affected by model modification, the result model can be generated by constraint solving and to be displayed if there are no variations in topological structure. The model is processed based on topological entities coding when topological structures are changed. The split topological entities are processed according to inherit rules and split operation, and the merged topological entities are processed by utilizing sub-edges and virtual topological entities. For features or part models that are indirectly affected by model modification, the relations among these features are analyzed by making use of feature dependent graph (FDG). The dynamic feature modification precedence criteria are built and property of feature precedence is given. The appropriate result model is produced according to these criteria and property. Validity checking and recovery method during process of model modification are proposed.
Thirdly, constraint solving mechanism is proposed in process of history-independent model modification. The basic definition of geometric constraint is built based on Euler parameter expressions of geometric entities. Then the algebraic equations of common project geometric constraints are derived to establish mathematic model of geometric constraints. The algebraic equations of geometric constraints are transformed into optimization problem and are solved by optimization method. An improved chaos search strategy is proposed, and which is introduced into particle swarm optimization algorithm (PSO). PSO searches solutions rapidly in early evolution period, which is used to search primary solutions. When the algorithm gets into the local extremum or finds preferable solutions, the improved chaos search strategy is used to activate the particles and to search the global best solutions accurately.
At last, the update and display strategy of feature model is studied, which can satisfy history-independent modeling. The model process procedure is divided into two steps, namely pretreatment and practical solving. FDG is used to store feature information and relations of dependence and constraints between features. A method of decomposing FDG is proposed, which decomposes FDG into macro-geometry and rigid body. Macro-geometry is affected by the modified parameters, and rigid body is not affected. The macro-geometry is determined by correlation set, which is the principal part of constraint soling. The macro-geometry is expressed in geometric constraint graph. Each constraint relation can be expressed by constraint expressions and be solved in local coordinate system. After the constraints have been solved, the method of updating results in geometric constraint graph is studied. At last, the method of collaborative design based on the proposed system is studied.
引文
[1] BRONSVOORT W F, BIDARRA R, NYIRENDA P J. Developments in Feature Modelling[J]. Computer-Aided Design & Applications, 2006, 5(3): 655-664.
[2] MARCHEIX D, PIERRA G. A Survey of the Persistent Naming Problem[C]. Proceedings of the Symposium on Solid Modeling and Applications, 2002:13-22.
[3]荆树旭,何发智,刘华俊.拓扑元素永久命名综述[J].计算机辅助设计与图形学学报, 2007, 19(5): 545-552.
[4] BIDARRA R, BRONSVOORT W F. Semantic feature modeling[J]. Computer-Aided Design, 2000, 32: 201- 225.
[5] ROSSIGNAC J R, BORREL P, NACKMAN L R. Interactive design with sequences of parameterized transformations[J]. Intelligent CAD systems II: implementational issues, 1989: 93-125.
[6] ROSSIGNAC J R. Issues on feature-based editing and interrogation of solid models[J]. Computers & Graphics, 1990, 14(2): 149-172.
[7] REQUICHA A A, CHAN S C. Representation of geometric features, tolerance and attributes in solid modellers based on constructive geometry[J]. IEEE Journal of Robotics and Automation, 1986, 2(3): 156-166.
[8] TURNER G P, ANDERSION D C. An object-oriented approach to interactive, feature based design for quick turn around manufacturing[J]. Computers Engineering, 1988, 1: 551-555.
[9] VARADY T, GAAL B, JARED G. Identifying features in solid modeling[J]. Computer Industry, 1990, 14: 43-50.
[10] KRIPAC J. A mechanism for persistently naming topological entities in history-based parametric solid models[J]. Computer-Aided Design, 1997, 29(2): 113-122.
[11] CAPOYLEAS V, CHEN X, HOFFMANN C M. Generic naming in generative, constraint-based design[J]. Computer-Aided Design, 1996, 28(1): 17-26.
[12] Chen X, HOFFMANN C M. On editability of feature-based design[J]. Computer-Aided Design, 1995, 27(12): 905-914.
[13]苏晓锋,黄正东,朱林,等.形状特征中的拓扑元素编码体系[J].计算机辅助设计与图形学学报, 2000, 12(2):137-141.
[14]陈正鸣,高曙明,张凤军,等.一种拓扑元素的命名和辨识方法[J].计算机学报,2001,24(11):1270-1277.
[15] WU J, ZHANG T, ZHANG X, et al. A face based mechanism for naming, recording and retrieving topological entities[J]. Computer-Aided Design, 2001, 33 (1): 687-698.
[16] AGBODAN D, MARCHEIX D, PIERRA G. Persistent naming for parametric models[J]. Journal of WSCG, 2000, 8(1): 17-38.
[17] AGBODAN D, MARCHEIX D, PIERRA G. A topological entity matching technique for geometric parametric models[C]. Proceedings of International Conference on Shape Modeling and Applications 2003, Seoul, 2003: 235-244.
[18] ZHENG J J, FAN M, TONG R F, et al. A Mechanism for Persistently Naming Topological Entities[C]. The 8th International Conference on Computer Supported Cooperative Work in Design Proceedings, 2004:84-89.
[19] MARCHEIX D. A Persistent Naming of Shells[C]. Proceedings - Ninth International Conference on Computer Aided Design and Computer Graphics, CAD/CG 2005, 2005: 259-265.
[20] YAN W, NNAJI B. O. Geometry-based semantic ID for persistent and interoperable reference in feature-based parametric modeling[J]. Computer-Aided Design, 2005, 37: 1081-1093.
[21] BIDARRA R, BRONSVOORT W F. Persistent naming through persistent entities[C]. Proceedings of Geometric Modeling and Processing 2002-Theory and Applications, Wako, 2002: 233- 240.
[22] BIDARRA R, NYIRENDA P J, BRONSVOORT W F. A feature-based solution to the persistent naming problem[J]. Computer-Aided Design & Applications, 2005, 1-4(2): 517-526.
[23] WANG Y W, WU J J, CHEN L P, et al. Identity propagation method for tracing alterations of a topological entity in a history-based solid modeling system[J]. Journal of Advanced Manufacturing Technology, 2005, 27(3-4):305-312.
[24]王彦伟,吴俊军,陈立平,等.特征造型系统中草图元素编码方法研究[J].工程图学学报, 2007, 1: 66-71.
[25] WU T, XI Y S, LI Z, et al. Coding and decoding of topological entities in constraint-based variational design[C]. 2008 International Conference on Advances in Product Development and Reliability, 2008: 201-208.
[26]孟祥旭,徐延宁.参数化设计研究[J].计算机辅助设计与图形学学报, 2002, 14(11): 1086-1090.
[27]唐荣锡,席平,宁涛.协同设计特征造型软件发展概况[J].计算机辅助设计与图形学学报, 2003, 15(1): 15-20.
[28] LIN V C, GOSSARD D C, LIGHT R A. Variational geometry in computer-aided design[J]. Computer Graphics, 1981, 15(3):171-177.
[29]舒慧林,刘继红,钟毅芳.计算机辅助机械产品概念设计研究综述[J].计算机辅助设计与图形学学报, 2000, 12(12):947-954.
[30] JOHNSON L W, RIESS R D. Numerical analysis. Addison-Wesley, 1982.
[31] JOAN-ARINYO R, LUZON M V, SOTO A. Genetic algorithms for root multiselection in constructive geometric constraint solving[J]. Computer and Graphics, 2003, 27(1): 51-60.
[32] HOSOBE H. A geometric constraint solving framework for interactive interfaces[J]. Transactions of the Information Processing Society of Japan, 2001, 42: 6-16.
[33]欧阳应秀,唐敏,刘生礼,等.几何约束求解的BFGS-混沌混合算法[J].浙江大学学报(工学版), 2005, 9(39): 1334-1338.
[34]季晓慧,张健.一种求解混合约束问题的快速完备算法[J],计算机研究与发展, 2006, 43(3): 551-556.
[35]刘木兰. Gr?bner基理论及其应用[M].北京:科学出版社, 2000.
[36]吴文俊.几何定理机器证明的基本原理[M].北京:科学出版社, 1984
[37]杨路,张景中,候晓荣.非线性代数方程组与定理机器证明[M].上海:上海科技教育出版社, 1996.
[38] GAO X S, LEI D, LIAO Q, et al. Generalized Stewart platforms and their direct kinematics[J]. IEEE Transactions on Robotics, 2005, 21(2): 141-151.
[39] WU W J, GAO X S. Automated reasoning and equation solving with the characteristic set method[J]. Journal of Computer Science and Technology,2006, 21(5):756-764.
[40] OWEN J C. Algebraic solution for geometry from dimensional constraints[C]. ACM Symposium on Solid Modeling and Applications, Austin, 1991, 397-407.
[41] OWEN J C. Constraints of simple geometry in two and three dimensions[J]. International Journal of Computer Geometry and Its Applications, 1996, 6(5):421-434.
[42] JERMANN C, NEVEU B, TROMBETTONI G. A New Structural Rigidity for Geometric Constraint System[C]. Lecture Notes in Artificial Intelligence. New York: Springer-Verlag, 2004. 87-105.
[43] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S, et al. Revisiting decomposition analysis of geometric constraint graphs[J]. Computer-Aided Design, 2004, 36(2): 123-140.
[44] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S. Constraint-based techniques to support collaborative design[J]. Journal of Computing and Information Science in Engineering, 2006, 6(2): 139-148.
[45]蒋鲲,高小山.用圆锥曲面求解几何约束问题(英文) [J].软件学报, 2002, 13(4): 482-489.
[46]蒋鲲,高小山,岳晶岩.参数化模型欠、过和完整约束的判定算法[J].软件学报, 2003, 14(12): 2092-9097.
[47] GAO X S, ZHANG G F. Geometric constraint solving via C-tree decomposition[C]. Proceedings of the Symposium on Solid Modeling and Applications, 2003: 45-55.
[48] GAO X S, LIN Q, ZHANG G F. A C-tree decomposition algorithm for 2D and 3D geometric constraint solving[J]. Computer-Aided Design, 2006, 38(1): 1-13.
[49] ZHANG G. F, GAO X S. Spatial geometric constraint solving based on k-connected graph decomposition[C]. Proceedings of the 21st Annual ACM Symposium on Applied Computing, Dijon, France, ACM Press, 2006, 973-977.
[50] ZHANG G F, GAO X S. Planar generalized Stewart platforms and their direct kinematics[C]. 5th International Workshop, ADG 2004: 198-211.
[51] PODGORELEC D. A new constructive approach to constraint-basedgeometric design[J]. Computer-Aided Design, 2002, 34(11):769-785.
[52] PODGORELEC D, ZALIK B, DOMITER V. Dealing with redundancy and inconsistency in constructive geometric constraint solving[J]. Advances in Engineering Software, 2008, 39(9): 770-786.
[53] GAO X S, HOFFMANN C M, YANG W. Solving spatial basic geometric constraint configurations with locus intersection[J]. Computer-Aided Design, 2004, 36(2): 111-122.
[54] KRAMER G. Solving Geometric constraint systems[C]. In: Proceedings AAAI-90, Boston MA, 1990, 1038-1044.
[55] KRAMER G. Solving geometric constraint system: A case study in kinematics[M]. Cambridge MA, MIT Press, 1992.
[56]蒋勇,王波兴,陈立平.三维几何约束求解的自由度归约算法[J].计算机辅助设计与图形学学报, 2003, 15(9):1128-1133.
[57] PENG X B, CHEN L P, ZHOU F L, et al. Singularity analysis of geometric constraint system[J]. Journal of Computer Science and Technology, 2002, 17(3): 314-323.
[58]蒋丹东,何援军,杨东,等.基于点簇归约的几何约束求解器研究[J].高技术通讯, 2002, 6: 49-53.
[59]李彦涛,陈玉键,孙家广.混合式几何约束满足的研究[J].计算机学报, 2001, 24(4): 347-353.
[60] LEE K Y, KWON O H, LEE J Y, et al. A hybrid approach to geometric constraint solving with graph analysis and reduction[J]. Advances in Engineering Software, 2003, 34(2): 103-113.
[61] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S, et al. Transforming an under-constrained geometric constraint problem into a well-constrained one[C]. In: Proceedings of ACM Symposium on Solid Modeling and Applications, USA, Washington, Seattle, 2003, 33-44.
[62] GAO X S, ZHANG G F. Well-constrained completion and decomposition for under-constrained geometric constraint problems[J]. International Journal of Computational Geometry and Applications, 2006, 16(5-6): 461-478.
[63] XIA H J, WANG B X, CHEN L P, et al. 3D geometric constraint solving using the method of kinematic analysis[J]. International Journal ofAdvanced Manufacture Technology, 2008, 35: 711-722.
[64] ALDEFELD B. Variation of geometries based on a geometric-reasoning method[J]. Computer Aided Design, 1988, 20(3): 117-126.
[65] SUZUKI H, ANDO H, KIMURAM F. Geometric constraints and reasoning for geometric CAD systems[J]. Computer & Graphics, 1990, 14(2): 211-224.
[66] YAMAGUCHI Y, KIMURA F. A constraint modeling system for variational geometry[C]. Geometric Modeling for Product Engineering, New York, USA, 1990, 221-233.
[67] ROLLER D. An approach to computer aided parametric design[J]. Computer Aided Design, 1991, 23(5): 200-219.
[68] ROLLER D. Advanced methods for parametric design[C]. Geometric Modeling Methods and Applications, Bolingen, Germany, Springer-Verlag, 1991, 251-266.
[69] VERROUST A, SCHONEK F, ROLLER D. Rule-oriented method for parameterized computer aided design[J]. Computer Aided Design, 1992, 24(3): 531-540.
[70]高曙明,彭群生.一种基于几何推理的参数化设计方法[J].计算机学报, 1994, 17(11): 816-822.
[71]高曙明,彭群生.一种适用于特征造型的参数化设计方法[J].计算机学报, 1996, 19(4): 300-309.
[72] DUFOURD J F, MATHIS P, SCHRECK P. Geometric construction by assembling solved subfigures[J]. Artificial Intelligence, 1998, 99(1): 73-119.
[73] ESSERT-VILLARD C, SCHRECK P, DUFOURD J F. Sketch-based pruning of a solution space within a formal geometric constraint solver[J]. Artificial Intelligence, 2000, 124(1): 139-159.
[74] SCHRECK P, SCHRAMM E. Using invariance under the similarity group to solve geometric constraint systems[J]. Computer-Aided Design, 2006, 38(5): 475-484.
[75] FOUFOU S, MICHELUCCI D, JURZAK J P. Numerical Decomposition of Geometric Constraints[C]. Proceedings SPM 2005 - ACM Symposium on Solid and Physical Modeling, 2005: 143-151.
[76] MICHELUCCI D, FOUFOU S. Using Cayley-Menger Determinants for geometric constraint solving[C]. ACM Symposium on Solid Modeling and Applications, 2004: 285-290.
[77] MICHELUCCI D, FOUFOU S. Geometric constraint solving: The witness configuration method[J]. Computer-Aided Design, 38(4), 2006: 284-299.
[78] HILDERICK A, MEIDEN V D, BRONSVOORT W F. Solving topological constraints for declarative families of objects[J]. Computer-Aided Design, 2007, 8(39): 652-662.
[79] PODGORELEC D, ZALIK B, DOMITER V. Dealing with redundancy and inconsistency in constructive geometric constraint solving[J]. Advances in Engineering Software, 9(39), 2008: 770-786.
[80] FABRE A, SCHRECK P. A formal-numerical approach to solve 3D geometric constraints systems[C]. Geometric Modelling and Imaging, GMAI 2007, 2007: 54-59.
[81] FABRE A, SCHRECK P. Combining symbolic and numerical solvers to simplify indecomposable systems solving[C]. Proceedings of the 23rd Annual ACM Symposium on Applied Computing, SAC'08, 2008: 1838-1842.
[82] BIER E A. Snap-dragging in three dimensions[J]. Computer & Graphics, 1990, 24(2): 193-204.
[83] BUTTERWORTH J, DAVIDSON A, HENCH S, et al. A three dimensional modeller using a head-mounted display[C]. Proceedings of Symposium on Interactive 3D Graphics. 1992: 135-138.
[84] FA M X, FERNANDO T, DEW P M. Interactive constraint-based solid modeling using allowable motion[C]. Proceedings of 2nd ACM SM’93. Montreal, May, 1993: 243-252.
[85] GLEICHER M. Integrating constrains and direct manipulation[C]. Proceedings of Symposium on Interactive 3D Graphics. 1992: 171-174.
[86] SOHRT W, BRUDERLIN B. Interactive with constraints in 3D modeling[J]. International Journal of Computational Geometry & Applications, 1991, 1(4): 405-425.
[87] KWAITER G, GAILDRAT V, CAUBET R. Interactive constraint system for solid modeling objects[C]. Proceedings of 4th ACM SM’97. AtlantaGA, May, 1997: 265-270.
[88] HSU C, ALT G, HUANG Z, et al. A constraint-based manipulator toolset for editing 3D objects[C]. Proceedings of 4th ACM SM’97. Atlanta GA, May, 1997: 168-180.
[89]黄永红,吴红明,季鹏斌,等.基于浮动基准体系的生成型特征设计[J].计算机辅助设计与图形学学报, 1998, 10(3): 233-240.
[90] CHUNG J C, HUANG T S, WU C T, et al. Framework for integrated mechanical design automation[J]. Computer-Aided Design, 2000, 32(5-6): 355-365.
[91] CHUNG J C, HUANG T S, WU C T, et al. Extended variational design technology - foundation for integrated design automation[C]. Proceedings of the Symposium on Solid Modeling and Applications, 1999: 13-22.
[92]王彦伟,陈立平,黄正东,等.面向与历史无关造型的三维约束求解方法研究[J].计算机辅助设计与图形学学报, 2004, 5(16): 648-654.
[93] WANG Y W, CHEN L P, HUANG Z D, et al. A History-independent modelling-oriented approach to solve geometric constraints between features in 3D space[J]. International Journal of Advanced Manufacturing Technology, 2005, 25(3-4): 334-342.
[94]龚雄,王波兴,陈立平,等.与历史无关的三维参数化模型构造方法[J].计算机辅助设计与图形学学报, 2006, 12(18): 1872-1877.
[95]龚雄,赵建军,王启富,等.边界表达模型的局部几何更新方法[J].机械科学与技术, 2007, 26(1): 92-95.
[96]龚雄,王波兴,陈立平.三维模型外形修改中的约束推论求解方法[J].华中科技大学学报(自然科学版), 2008, 36(9): 75-78.
[97]龚雄,王波兴,陈立平.约束求解组件与CAD平台的集成[J].工程图学学报, 2009, 1: 26-32.
[98] BIDARRA R, MADEIRA J, NEELS W J, et al. Efficiency of boundary evaluation for a cellular model[J]. Computer-Aided Design, 2005, 37: 1266-1284.
[99] BIDARRA R, BUNNIK A V, BRONSVOORT W F. Direct manipulation of feature models in web-based collaborative design[C]. 2004 ASME Design Engineering Technical Conferences, 2004, Salt Lake City, Utah: 645-652.
[100] LOURENCO D, OLIVEIRA P, NOORT A, et al. Constraint solving for direct manipulation of features[J]. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 2006, 20, 369-382.
[101] BIDARRA R, NOORT A. Advanced direct manipulation of feature models[C]. 2007, 2nd International Conference on Computer Graphics Theory and Applications: 130-136.
[102] KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm optimization[C]. Proceedings of Conference on System, Man, and Cybernetics, NJ, USA, 1997: 4104-4109.
[103] GUO Y W, LI W D, MILEHAM A R, et al. Applications of particle swarm optimization in integrated process planning and scheduling[J]. Robotics and Computer-integrated Manufacturing, 2009, 25(2): 280-288.
[104] CHAUHAN N C, KARTIKEYAN M V, MITTAL A. Amodified particle swarm optimizer and tis application to the design of microwave filters[J]. Journal of infrared, Millimeter, and Terahertz Waves, 2009, 30(6): 598-610.
[105] PARSOPOYLOS K E, VRAHATIS M N. Recent approaches to global optimization problems through particle swarm optimization[J]. Natural Computing, 2002, 1(2-3): 235-306.
[106] RATNAWEERA A, HALGAMUGE S K, WATSON H C. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 240-255.
[107] ZHENG S F, HU S L, SU S X, et al. A modified particle optimization algorithm and application[C]. Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007, Hong Kong, China, 2007: 945-951.
[108] COOREN Y, CLERC M, SIARRY P. Performance evaluation of TRIBES, an adaptive particle swarm optimization algorithm[J]. Swarm intelligence, 2009, 3(2): 149-178.
[109]窦全胜,周春光,徐中宇,等.动态优化环境下的群核进化粒子群优化方法[J].计算机研究与发展, 2006, 43(1): 89-95.
[110]赫然,王永吉,王青,等.一种改进的自适应逃逸微粒群算法及试验分析[J].软件学报, 2005, 16(12): 2036-2044.
[111] LU Z S, HOU Z R. Particle swarm optimization with adaptive mutation[J]. Acta Electronica Sinica, 2004, 32(3): 416-420.
[112]倪庆剑,张志政,王蓁蓁,等.一种基于可变多簇结构的动态概率粒子群优化算法[J].软件学报, 2009, 20(2): 339-349.
[113]孟红记,郑鹏,梅国晖,等.基于混沌序列的粒子群优化算法.控制与决策, 2006, 21(3): 263-266.
[114]牛大鹏,王福利,何大阔,等.多目标混沌差分进化算法[J].控制与决策, 2009, 24(3): 361-364.
[115] TATSUMI K, OBITA Y, TANINO T. Chaos generator exploiting a gradient model with sinusoidal perturbations for global optimization[J]. Chaos, Solitions and Fractals, 2009, 42(3): 1705-1723.
[116]桂传志.混沌序列在优化理论中的应用[D].南京:南京理工大学, 2006.
[2] MARCHEIX D, PIERRA G. A Survey of the Persistent Naming Problem[C]. Proceedings of the Symposium on Solid Modeling and Applications, 2002:13-22.
[3]荆树旭,何发智,刘华俊.拓扑元素永久命名综述[J].计算机辅助设计与图形学学报, 2007, 19(5): 545-552.
[4] BIDARRA R, BRONSVOORT W F. Semantic feature modeling[J]. Computer-Aided Design, 2000, 32: 201- 225.
[5] ROSSIGNAC J R, BORREL P, NACKMAN L R. Interactive design with sequences of parameterized transformations[J]. Intelligent CAD systems II: implementational issues, 1989: 93-125.
[6] ROSSIGNAC J R. Issues on feature-based editing and interrogation of solid models[J]. Computers & Graphics, 1990, 14(2): 149-172.
[7] REQUICHA A A, CHAN S C. Representation of geometric features, tolerance and attributes in solid modellers based on constructive geometry[J]. IEEE Journal of Robotics and Automation, 1986, 2(3): 156-166.
[8] TURNER G P, ANDERSION D C. An object-oriented approach to interactive, feature based design for quick turn around manufacturing[J]. Computers Engineering, 1988, 1: 551-555.
[9] VARADY T, GAAL B, JARED G. Identifying features in solid modeling[J]. Computer Industry, 1990, 14: 43-50.
[10] KRIPAC J. A mechanism for persistently naming topological entities in history-based parametric solid models[J]. Computer-Aided Design, 1997, 29(2): 113-122.
[11] CAPOYLEAS V, CHEN X, HOFFMANN C M. Generic naming in generative, constraint-based design[J]. Computer-Aided Design, 1996, 28(1): 17-26.
[12] Chen X, HOFFMANN C M. On editability of feature-based design[J]. Computer-Aided Design, 1995, 27(12): 905-914.
[13]苏晓锋,黄正东,朱林,等.形状特征中的拓扑元素编码体系[J].计算机辅助设计与图形学学报, 2000, 12(2):137-141.
[14]陈正鸣,高曙明,张凤军,等.一种拓扑元素的命名和辨识方法[J].计算机学报,2001,24(11):1270-1277.
[15] WU J, ZHANG T, ZHANG X, et al. A face based mechanism for naming, recording and retrieving topological entities[J]. Computer-Aided Design, 2001, 33 (1): 687-698.
[16] AGBODAN D, MARCHEIX D, PIERRA G. Persistent naming for parametric models[J]. Journal of WSCG, 2000, 8(1): 17-38.
[17] AGBODAN D, MARCHEIX D, PIERRA G. A topological entity matching technique for geometric parametric models[C]. Proceedings of International Conference on Shape Modeling and Applications 2003, Seoul, 2003: 235-244.
[18] ZHENG J J, FAN M, TONG R F, et al. A Mechanism for Persistently Naming Topological Entities[C]. The 8th International Conference on Computer Supported Cooperative Work in Design Proceedings, 2004:84-89.
[19] MARCHEIX D. A Persistent Naming of Shells[C]. Proceedings - Ninth International Conference on Computer Aided Design and Computer Graphics, CAD/CG 2005, 2005: 259-265.
[20] YAN W, NNAJI B. O. Geometry-based semantic ID for persistent and interoperable reference in feature-based parametric modeling[J]. Computer-Aided Design, 2005, 37: 1081-1093.
[21] BIDARRA R, BRONSVOORT W F. Persistent naming through persistent entities[C]. Proceedings of Geometric Modeling and Processing 2002-Theory and Applications, Wako, 2002: 233- 240.
[22] BIDARRA R, NYIRENDA P J, BRONSVOORT W F. A feature-based solution to the persistent naming problem[J]. Computer-Aided Design & Applications, 2005, 1-4(2): 517-526.
[23] WANG Y W, WU J J, CHEN L P, et al. Identity propagation method for tracing alterations of a topological entity in a history-based solid modeling system[J]. Journal of Advanced Manufacturing Technology, 2005, 27(3-4):305-312.
[24]王彦伟,吴俊军,陈立平,等.特征造型系统中草图元素编码方法研究[J].工程图学学报, 2007, 1: 66-71.
[25] WU T, XI Y S, LI Z, et al. Coding and decoding of topological entities in constraint-based variational design[C]. 2008 International Conference on Advances in Product Development and Reliability, 2008: 201-208.
[26]孟祥旭,徐延宁.参数化设计研究[J].计算机辅助设计与图形学学报, 2002, 14(11): 1086-1090.
[27]唐荣锡,席平,宁涛.协同设计特征造型软件发展概况[J].计算机辅助设计与图形学学报, 2003, 15(1): 15-20.
[28] LIN V C, GOSSARD D C, LIGHT R A. Variational geometry in computer-aided design[J]. Computer Graphics, 1981, 15(3):171-177.
[29]舒慧林,刘继红,钟毅芳.计算机辅助机械产品概念设计研究综述[J].计算机辅助设计与图形学学报, 2000, 12(12):947-954.
[30] JOHNSON L W, RIESS R D. Numerical analysis. Addison-Wesley, 1982.
[31] JOAN-ARINYO R, LUZON M V, SOTO A. Genetic algorithms for root multiselection in constructive geometric constraint solving[J]. Computer and Graphics, 2003, 27(1): 51-60.
[32] HOSOBE H. A geometric constraint solving framework for interactive interfaces[J]. Transactions of the Information Processing Society of Japan, 2001, 42: 6-16.
[33]欧阳应秀,唐敏,刘生礼,等.几何约束求解的BFGS-混沌混合算法[J].浙江大学学报(工学版), 2005, 9(39): 1334-1338.
[34]季晓慧,张健.一种求解混合约束问题的快速完备算法[J],计算机研究与发展, 2006, 43(3): 551-556.
[35]刘木兰. Gr?bner基理论及其应用[M].北京:科学出版社, 2000.
[36]吴文俊.几何定理机器证明的基本原理[M].北京:科学出版社, 1984
[37]杨路,张景中,候晓荣.非线性代数方程组与定理机器证明[M].上海:上海科技教育出版社, 1996.
[38] GAO X S, LEI D, LIAO Q, et al. Generalized Stewart platforms and their direct kinematics[J]. IEEE Transactions on Robotics, 2005, 21(2): 141-151.
[39] WU W J, GAO X S. Automated reasoning and equation solving with the characteristic set method[J]. Journal of Computer Science and Technology,2006, 21(5):756-764.
[40] OWEN J C. Algebraic solution for geometry from dimensional constraints[C]. ACM Symposium on Solid Modeling and Applications, Austin, 1991, 397-407.
[41] OWEN J C. Constraints of simple geometry in two and three dimensions[J]. International Journal of Computer Geometry and Its Applications, 1996, 6(5):421-434.
[42] JERMANN C, NEVEU B, TROMBETTONI G. A New Structural Rigidity for Geometric Constraint System[C]. Lecture Notes in Artificial Intelligence. New York: Springer-Verlag, 2004. 87-105.
[43] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S, et al. Revisiting decomposition analysis of geometric constraint graphs[J]. Computer-Aided Design, 2004, 36(2): 123-140.
[44] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S. Constraint-based techniques to support collaborative design[J]. Journal of Computing and Information Science in Engineering, 2006, 6(2): 139-148.
[45]蒋鲲,高小山.用圆锥曲面求解几何约束问题(英文) [J].软件学报, 2002, 13(4): 482-489.
[46]蒋鲲,高小山,岳晶岩.参数化模型欠、过和完整约束的判定算法[J].软件学报, 2003, 14(12): 2092-9097.
[47] GAO X S, ZHANG G F. Geometric constraint solving via C-tree decomposition[C]. Proceedings of the Symposium on Solid Modeling and Applications, 2003: 45-55.
[48] GAO X S, LIN Q, ZHANG G F. A C-tree decomposition algorithm for 2D and 3D geometric constraint solving[J]. Computer-Aided Design, 2006, 38(1): 1-13.
[49] ZHANG G. F, GAO X S. Spatial geometric constraint solving based on k-connected graph decomposition[C]. Proceedings of the 21st Annual ACM Symposium on Applied Computing, Dijon, France, ACM Press, 2006, 973-977.
[50] ZHANG G F, GAO X S. Planar generalized Stewart platforms and their direct kinematics[C]. 5th International Workshop, ADG 2004: 198-211.
[51] PODGORELEC D. A new constructive approach to constraint-basedgeometric design[J]. Computer-Aided Design, 2002, 34(11):769-785.
[52] PODGORELEC D, ZALIK B, DOMITER V. Dealing with redundancy and inconsistency in constructive geometric constraint solving[J]. Advances in Engineering Software, 2008, 39(9): 770-786.
[53] GAO X S, HOFFMANN C M, YANG W. Solving spatial basic geometric constraint configurations with locus intersection[J]. Computer-Aided Design, 2004, 36(2): 111-122.
[54] KRAMER G. Solving Geometric constraint systems[C]. In: Proceedings AAAI-90, Boston MA, 1990, 1038-1044.
[55] KRAMER G. Solving geometric constraint system: A case study in kinematics[M]. Cambridge MA, MIT Press, 1992.
[56]蒋勇,王波兴,陈立平.三维几何约束求解的自由度归约算法[J].计算机辅助设计与图形学学报, 2003, 15(9):1128-1133.
[57] PENG X B, CHEN L P, ZHOU F L, et al. Singularity analysis of geometric constraint system[J]. Journal of Computer Science and Technology, 2002, 17(3): 314-323.
[58]蒋丹东,何援军,杨东,等.基于点簇归约的几何约束求解器研究[J].高技术通讯, 2002, 6: 49-53.
[59]李彦涛,陈玉键,孙家广.混合式几何约束满足的研究[J].计算机学报, 2001, 24(4): 347-353.
[60] LEE K Y, KWON O H, LEE J Y, et al. A hybrid approach to geometric constraint solving with graph analysis and reduction[J]. Advances in Engineering Software, 2003, 34(2): 103-113.
[61] JOAN-ARINYO R, SOTO-RIERA A, VILA-MARTA S, et al. Transforming an under-constrained geometric constraint problem into a well-constrained one[C]. In: Proceedings of ACM Symposium on Solid Modeling and Applications, USA, Washington, Seattle, 2003, 33-44.
[62] GAO X S, ZHANG G F. Well-constrained completion and decomposition for under-constrained geometric constraint problems[J]. International Journal of Computational Geometry and Applications, 2006, 16(5-6): 461-478.
[63] XIA H J, WANG B X, CHEN L P, et al. 3D geometric constraint solving using the method of kinematic analysis[J]. International Journal ofAdvanced Manufacture Technology, 2008, 35: 711-722.
[64] ALDEFELD B. Variation of geometries based on a geometric-reasoning method[J]. Computer Aided Design, 1988, 20(3): 117-126.
[65] SUZUKI H, ANDO H, KIMURAM F. Geometric constraints and reasoning for geometric CAD systems[J]. Computer & Graphics, 1990, 14(2): 211-224.
[66] YAMAGUCHI Y, KIMURA F. A constraint modeling system for variational geometry[C]. Geometric Modeling for Product Engineering, New York, USA, 1990, 221-233.
[67] ROLLER D. An approach to computer aided parametric design[J]. Computer Aided Design, 1991, 23(5): 200-219.
[68] ROLLER D. Advanced methods for parametric design[C]. Geometric Modeling Methods and Applications, Bolingen, Germany, Springer-Verlag, 1991, 251-266.
[69] VERROUST A, SCHONEK F, ROLLER D. Rule-oriented method for parameterized computer aided design[J]. Computer Aided Design, 1992, 24(3): 531-540.
[70]高曙明,彭群生.一种基于几何推理的参数化设计方法[J].计算机学报, 1994, 17(11): 816-822.
[71]高曙明,彭群生.一种适用于特征造型的参数化设计方法[J].计算机学报, 1996, 19(4): 300-309.
[72] DUFOURD J F, MATHIS P, SCHRECK P. Geometric construction by assembling solved subfigures[J]. Artificial Intelligence, 1998, 99(1): 73-119.
[73] ESSERT-VILLARD C, SCHRECK P, DUFOURD J F. Sketch-based pruning of a solution space within a formal geometric constraint solver[J]. Artificial Intelligence, 2000, 124(1): 139-159.
[74] SCHRECK P, SCHRAMM E. Using invariance under the similarity group to solve geometric constraint systems[J]. Computer-Aided Design, 2006, 38(5): 475-484.
[75] FOUFOU S, MICHELUCCI D, JURZAK J P. Numerical Decomposition of Geometric Constraints[C]. Proceedings SPM 2005 - ACM Symposium on Solid and Physical Modeling, 2005: 143-151.
[76] MICHELUCCI D, FOUFOU S. Using Cayley-Menger Determinants for geometric constraint solving[C]. ACM Symposium on Solid Modeling and Applications, 2004: 285-290.
[77] MICHELUCCI D, FOUFOU S. Geometric constraint solving: The witness configuration method[J]. Computer-Aided Design, 38(4), 2006: 284-299.
[78] HILDERICK A, MEIDEN V D, BRONSVOORT W F. Solving topological constraints for declarative families of objects[J]. Computer-Aided Design, 2007, 8(39): 652-662.
[79] PODGORELEC D, ZALIK B, DOMITER V. Dealing with redundancy and inconsistency in constructive geometric constraint solving[J]. Advances in Engineering Software, 9(39), 2008: 770-786.
[80] FABRE A, SCHRECK P. A formal-numerical approach to solve 3D geometric constraints systems[C]. Geometric Modelling and Imaging, GMAI 2007, 2007: 54-59.
[81] FABRE A, SCHRECK P. Combining symbolic and numerical solvers to simplify indecomposable systems solving[C]. Proceedings of the 23rd Annual ACM Symposium on Applied Computing, SAC'08, 2008: 1838-1842.
[82] BIER E A. Snap-dragging in three dimensions[J]. Computer & Graphics, 1990, 24(2): 193-204.
[83] BUTTERWORTH J, DAVIDSON A, HENCH S, et al. A three dimensional modeller using a head-mounted display[C]. Proceedings of Symposium on Interactive 3D Graphics. 1992: 135-138.
[84] FA M X, FERNANDO T, DEW P M. Interactive constraint-based solid modeling using allowable motion[C]. Proceedings of 2nd ACM SM’93. Montreal, May, 1993: 243-252.
[85] GLEICHER M. Integrating constrains and direct manipulation[C]. Proceedings of Symposium on Interactive 3D Graphics. 1992: 171-174.
[86] SOHRT W, BRUDERLIN B. Interactive with constraints in 3D modeling[J]. International Journal of Computational Geometry & Applications, 1991, 1(4): 405-425.
[87] KWAITER G, GAILDRAT V, CAUBET R. Interactive constraint system for solid modeling objects[C]. Proceedings of 4th ACM SM’97. AtlantaGA, May, 1997: 265-270.
[88] HSU C, ALT G, HUANG Z, et al. A constraint-based manipulator toolset for editing 3D objects[C]. Proceedings of 4th ACM SM’97. Atlanta GA, May, 1997: 168-180.
[89]黄永红,吴红明,季鹏斌,等.基于浮动基准体系的生成型特征设计[J].计算机辅助设计与图形学学报, 1998, 10(3): 233-240.
[90] CHUNG J C, HUANG T S, WU C T, et al. Framework for integrated mechanical design automation[J]. Computer-Aided Design, 2000, 32(5-6): 355-365.
[91] CHUNG J C, HUANG T S, WU C T, et al. Extended variational design technology - foundation for integrated design automation[C]. Proceedings of the Symposium on Solid Modeling and Applications, 1999: 13-22.
[92]王彦伟,陈立平,黄正东,等.面向与历史无关造型的三维约束求解方法研究[J].计算机辅助设计与图形学学报, 2004, 5(16): 648-654.
[93] WANG Y W, CHEN L P, HUANG Z D, et al. A History-independent modelling-oriented approach to solve geometric constraints between features in 3D space[J]. International Journal of Advanced Manufacturing Technology, 2005, 25(3-4): 334-342.
[94]龚雄,王波兴,陈立平,等.与历史无关的三维参数化模型构造方法[J].计算机辅助设计与图形学学报, 2006, 12(18): 1872-1877.
[95]龚雄,赵建军,王启富,等.边界表达模型的局部几何更新方法[J].机械科学与技术, 2007, 26(1): 92-95.
[96]龚雄,王波兴,陈立平.三维模型外形修改中的约束推论求解方法[J].华中科技大学学报(自然科学版), 2008, 36(9): 75-78.
[97]龚雄,王波兴,陈立平.约束求解组件与CAD平台的集成[J].工程图学学报, 2009, 1: 26-32.
[98] BIDARRA R, MADEIRA J, NEELS W J, et al. Efficiency of boundary evaluation for a cellular model[J]. Computer-Aided Design, 2005, 37: 1266-1284.
[99] BIDARRA R, BUNNIK A V, BRONSVOORT W F. Direct manipulation of feature models in web-based collaborative design[C]. 2004 ASME Design Engineering Technical Conferences, 2004, Salt Lake City, Utah: 645-652.
[100] LOURENCO D, OLIVEIRA P, NOORT A, et al. Constraint solving for direct manipulation of features[J]. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 2006, 20, 369-382.
[101] BIDARRA R, NOORT A. Advanced direct manipulation of feature models[C]. 2007, 2nd International Conference on Computer Graphics Theory and Applications: 130-136.
[102] KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm optimization[C]. Proceedings of Conference on System, Man, and Cybernetics, NJ, USA, 1997: 4104-4109.
[103] GUO Y W, LI W D, MILEHAM A R, et al. Applications of particle swarm optimization in integrated process planning and scheduling[J]. Robotics and Computer-integrated Manufacturing, 2009, 25(2): 280-288.
[104] CHAUHAN N C, KARTIKEYAN M V, MITTAL A. Amodified particle swarm optimizer and tis application to the design of microwave filters[J]. Journal of infrared, Millimeter, and Terahertz Waves, 2009, 30(6): 598-610.
[105] PARSOPOYLOS K E, VRAHATIS M N. Recent approaches to global optimization problems through particle swarm optimization[J]. Natural Computing, 2002, 1(2-3): 235-306.
[106] RATNAWEERA A, HALGAMUGE S K, WATSON H C. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 240-255.
[107] ZHENG S F, HU S L, SU S X, et al. A modified particle optimization algorithm and application[C]. Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007, Hong Kong, China, 2007: 945-951.
[108] COOREN Y, CLERC M, SIARRY P. Performance evaluation of TRIBES, an adaptive particle swarm optimization algorithm[J]. Swarm intelligence, 2009, 3(2): 149-178.
[109]窦全胜,周春光,徐中宇,等.动态优化环境下的群核进化粒子群优化方法[J].计算机研究与发展, 2006, 43(1): 89-95.
[110]赫然,王永吉,王青,等.一种改进的自适应逃逸微粒群算法及试验分析[J].软件学报, 2005, 16(12): 2036-2044.
[111] LU Z S, HOU Z R. Particle swarm optimization with adaptive mutation[J]. Acta Electronica Sinica, 2004, 32(3): 416-420.
[112]倪庆剑,张志政,王蓁蓁,等.一种基于可变多簇结构的动态概率粒子群优化算法[J].软件学报, 2009, 20(2): 339-349.
[113]孟红记,郑鹏,梅国晖,等.基于混沌序列的粒子群优化算法.控制与决策, 2006, 21(3): 263-266.
[114]牛大鹏,王福利,何大阔,等.多目标混沌差分进化算法[J].控制与决策, 2009, 24(3): 361-364.
[115] TATSUMI K, OBITA Y, TANINO T. Chaos generator exploiting a gradient model with sinusoidal perturbations for global optimization[J]. Chaos, Solitions and Fractals, 2009, 42(3): 1705-1723.
[116]桂传志.混沌序列在优化理论中的应用[D].南京:南京理工大学, 2006.