检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈龙[1,2] 陆国栋[1] 邓卫燕[1] 王进[1]
机构地区:[1]浙江大学CAD&CG国家重点实验室,浙江杭州310027 [2]上海理工大学机械工程学院,上海200093
出 处:《浙江大学学报(工学版)》2010年第3期589-594,共6页Journal of Zhejiang University:Engineering Science
基 金:教育部博士点基金资助项目(20060335118);上海市教育委员会重点学科建设资助项目(J50503)
摘 要:为了确定复杂的服装约束系统求解顺序,根据图论路径理论,并结合曲线约束系统求解特点,给出相关矩阵运算规则和路径确定的层次法则、包含法则、自治法则、累加法则.服装特征框架(GFF)是服装曲面生成的基础,也是服装约束求解的对象.将服装特征框架(GFF)表示为服装约束简单图(GCG),描述了服装约束定义及分类,给出每个约束的约束权值,进而给出GCG的邻接矩阵(GCGM).当修改某元素后,通过对GCGM的一系列处理和路径确定法则的具体应用,确定该元素对应的服装约束求解路径,按照求解路径搜索最终完成其他元素的修改,从而生成新的GFF.服装约束求解实例说明了该算法的有效性.In order to fix the constraint solving sequence for the complex garment constraint system,by using route theory in graph theory and linking with the specialty of constraint solving of curves,this work presented the operation rules for relative matrix and the route fix principles including hierarchy,inclusion,autonomy,accumulation. Garment feature frame (GFF) is the basis for garment surface generation,so it is also the target of garment constraint solving. Turn GFF into garment constraint graph(GCG),describe the definition and classification for garment constraint,give the weighted value for every constraint,and finally give the adjacent matrix for garment constraint graph(GCGM). Once a curve element is modified,a constraint solving route relative to the element will be fixed after a series of treatment based on GCGM and appliance of route fix principles. Search other elements according to the route,then modification for all the other elements will also be finished and then a new GFF will also be generated. An example showed that this algorithm is robust and effective.
关 键 词:服装特征框架 服装约束图 约束求解 路径理论 服装参数化
分 类 号:TH12[机械工程—机械设计及理论] TP339[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.30.3