Legal claims defining the scope of protection, as filed with the USPTO.
2. Computer-implemented method according to claim 1, wherein determining the parameter set comprises the step of associating a direct parameter with each uniquely occurring numerical value of the numerical constraints of the minimal spanning subset.
3. Computer-implemented method according to preceding claim 2, wherein determining the parameter set comprises the further step of determining for a substitutable direct parameter a new parameter and a functional expression expressing the substitutable direct parameter in function of the new parameter and at least one other direct parameter.
4. Computer-implemented method according to claim 1, wherein the model comprises a three-dimensional solid comprising a subentity of the set of subentities.
5. Computer-implemented method according to claim 1, wherein the set of at least three subentities comprises at least three mutually parallel faces, and wherein a numerical constraint of the minimal spanning subset is a distance constraint.
6. Computer-implemented method according to claim 3, wherein the direct parameters comprise an overall direct distance parameter associated with an overall numerical distance constraint comprising an overall numerical value for an overall pair of parallel faces, wherein the substitutable direct parameter is a distance parameter associated with a second numerical distance constraint comprising a second numerical value for a second pair of parallel faces, wherein the faces of the overall and the second pair are parallel, and wherein the overall numerical value is larger than the second numerical value.
10. Computer-implemented method according to claim 1, wherein the minimal spanning subset is determined from the candidate set via a pairwise comparison of numerical constraints of the candidate set based on a relative prioritization of numerical constraints.
11. Computer-implemented method according to preceding claim 10, wherein the spanning tree is a minimum spanning tree.
13. Computer-implemented method according to claim 1, wherein the candidate set is obtained such that the first graph is fully connected.
14. Computer-implemented method according to claim 1, wherein the method comprises the step of storing the computer-aided design model comprising the parameter set and the parametric constraints on a tangible non-transitory computer-readable storage medium.
17. Computer system for automatic parametrization of a computer-aided design model, the computer system comprising a tangible non-transitory computer-readable data carrier carrying instructions that when executed by the computer system cause performance of the computer-implemented method according claim 1.
18. Computer program product for automatic parametrization of a computer-aided design model, the computer program product comprising a tangible non-transitory computer-readable data carrier carrying instructions which, when the computer program product is executed by a computer, cause the computer to carry out the computer-implemented method according to claim 1.
Unknown
March 19, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.