کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
568177 | 876279 | 2008 | 17 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Dealing with redundancy and inconsistency in constructive geometric constraint solving Dealing with redundancy and inconsistency in constructive geometric constraint solving](/preview/png/568177.png)
General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. However, all these methods are based on the assumption that structural rigidity automatically assures solvability. In this paper, we show that this assumption fails in numerous, even the most basic, configurations. We introduce several simple but efficient rules aimed to additionally analyse solvability in such cases. Another novelty addresses conditional constraints between three or more geometric parts, rules for their simplification and a redundancy check. All these functionalities are built into our original 2D geometric constraint solver, based on concepts of rigid clusters and constrained-angle (CA) sets.
Journal: Advances in Engineering Software - Volume 39, Issue 9, September 2008, Pages 770–786