Geometric constraints within feature hierarchies
Computer-Aided Design（2006）
摘要
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the features may use procedural or other non-constraint based representations. We trace the challenge to a requirement on constraint decomposition algorithms or decomposition-recombination (DR) planners used by most variational constraint solvers, formalize the feature hierarchy incorporation problem for DR-planners, clarify its relationship to other problems, and provide an efficient algorithmic solution. The new algorithms have been implemented in the general, 2D and 3D opensource geometric constraint solver FRONTIER developed at the University of Florida.
更多查看译文
关键词
constraint graphs.,feature hierarchy incorporation problem,underconstrained and overconstrained systems,feature hierarchy representation,degree of freedom analysis,user navigation of solution conformations,variational geometric constraint solving,variational constraint representation,parametric constraint solving,constraint decomposition algorithm,variational constraint solvers,decomposition of geometric constraint systems,enabling general,feature-based and assembly modeling,new algorithm,conceptual design,cyclical and 3d geometric constraint systems,opensource geometric constraint solver,efficient algorithmic solution,constraint graphs,degree of freedom
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要