Abstract
Many applications of geometric nature can be modeled by geometric problems defined by constraints in which the constraint parameters have interval uncertainty. In a previous work, we developed a method for solving geometric constraint problems where parameters are narrow intervals in the domain of the geometric problem. Based on this work, we present a new approach to solve more general problems with non-trivial-width interval parameters that may not necessarily be in the domain of the problem. We show how our approach is successfully applied to a number of problems like solving geometric problems with tolerances, checking constraint feasibility and analyzing link motion of planar mechanisms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computing and Information Science in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
