کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
440263 | 690989 | 2012 | 12 صفحه PDF | دانلود رایگان |
In parametric design, changing values of parameters to get different solution instances to the problem at hand is a paramount operation. One of the main issues when generating the solution instance for the actual set of parameters is that the user does not know in general which is the set of parameter values for which the parametric solution is feasible. Similarly, in constraint-based dynamic geometry, knowing the set of critical points where construction feasibility changes would allow to avoid unexpected and unwanted behaviors.We consider parametric models in the Euclidean space with one internal degree of freedom. In this scenario, in general, the set of values of the variant parameter for which the parametric model is realizable and defines a valid shape is a set of intervals on the real line.In this work we report on our experiments implementing the van der Meiden Approach to compute the set of parameter values that bound intervals for which the parametric object is realizable. The implementation is developed on top of a constructive, ruler-and-compass geometric constraint solver. We formalize the underlying concepts and prove that our implementation is correct, that is, the approach exactly computes all the feasible interval bounds.
► We describe an implementation of an algorithm to compute critical points in constructive geometric constraint solving.
► A fully developed case study illustrates how the algorithm works.
► We prove that the algorithm is correct.
Journal: Computer-Aided Design - Volume 44, Issue 7, July 2012, Pages 709–720