Abstract
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such systems. However, because allowable parameter values are not known to the user beforehand, this is often a trial-and-error process. We present a solution for automatically determining the allowable range for parameters of geometric constraints. Considered are systems of distance and angle constraints on points in 3D that can be decomposed into triangular and tetrahedral subproblems, by which most practical situations in parametric and feature-based CAD systems can be represented. Our method uses the decomposition to find critical parameter values for which subproblems degenerate. By solving one problem instance for each interval between two subsequent critical values, the exact parameter ranges are determined for which a solution exists.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
