Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A computer-implemented method for transitioning between a first profile curve and a different second profile curve in a swept surface extrusion, comprising: (a) obtaining the first profile curve and the second profile curve, wherein: (i) the first profile curve is different than the second profile curve; (ii) each profile curve comprises one or more section sequences comprised of one or more consecutive sections; (iii) each of the one or more consecutive sections comprise two or more constant attributes; (iv) the two or more constant attributes comprise one or more graphic attributes and one or more semantic attributes; and (v) the one or more section sequences define a semantic pattern for each profile curve; (b) computing a globally optimal match between the consecutive sections of the first profile curve and the second profile curve based on the semantic pattern; (c) generating an adapted first profile curve and an adapted second profile curve, wherein the adapted first profile curve and the adapted second profile curve have the same sections, and wherein the adapted first profile curve matches a first curve geometry of the first profile curve and the adapted second profile curve matches a second curve geometry of the second profile curve; (d) computing an actual profile curve for a given position on an extrusion line using a one-to-one vertex position morphing based on the adapted first profile curve and the adapted second profile curve; (e) performing the swept surface extrusion on the extrusion line based on the actual profile curve; and (f) displaying, on a display device, a drawing containing the swept surface extrusion.
A computer-implemented method transitions between two different profile curves during a swept surface extrusion. First, it obtains two profile curves, each composed of section sequences. These sequences have consecutive sections, which contain constant graphic and semantic attributes, defining a semantic pattern for each curve. Next, it computes the best possible match between sections of the two curves based on their semantic patterns. The curves are then adapted to have identical section structures while maintaining their original geometries. An actual profile curve is calculated for a given point on the extrusion line by morphing corresponding vertex positions of the adapted curves. Finally, the swept surface extrusion is performed using this actual profile curve and displayed.
2. The method of claim 1 , wherein the swept surface extrusion is used to create a road on a road network.
The method of transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, as described above, is applied to create a road on a road network. This means the swept surface extrusion process is specifically used for generating the 3D model or surface representing a road within a larger digital representation of a road network.
3. The method of claim 1 , wherein the globally optimal match is computed based on a string edit distance function.
In the method for transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, the computation of the globally optimal match between curve sections is done using a string edit distance function. This function measures the minimum number of edits (insertions, deletions, substitutions) needed to transform one section sequence into another, thereby identifying the best alignment of sections based on their semantic attributes.
4. The method of claim 3 , wherein the globally optimal match is computed by: utilizing a weighting function for matches and string manipulations, wherein a length of runs of consecutive identical manipulations or identical matches are tracked to allow for run-length-dependent weights; and searching for a manipulation sequence that maximizes a total weight.
The string edit distance computation for finding the best match between profile curve sections involves a weighting function that considers both matches and string manipulations (insertions, deletions). The weighting also tracks runs of consecutive identical manipulations or identical matches, applying run-length-dependent weights. The method searches for the manipulation sequence that yields the maximum total weight, effectively favoring longer stretches of similar sections or penalizing long stretches of insertions/deletions.
5. The method of claim 4 , wherein: a look-up table defines weights for each semantic attribute; a weight of zero (w=0) is used for insertion into a longer pattern; a weight of −run length (w=−run length) is used for insertion into a shorter pattern; and substitutions are not allowed.
In the weighted string edit distance computation for optimal matching, a lookup table defines the weights for each semantic attribute. An insertion into a longer pattern receives a weight of zero. An insertion into a shorter pattern receives a weight of negative the run length. Substitutions are not allowed. This configuration biases the matching process towards preserving the structure of the longer curve and avoiding direct replacement of attributes.
6. The method of claim 1 , wherein the globally optimal match outputs a partition list with each entry containing a matching element of the first profile curve and the second profile curve together with subsequent non-matching elements.
The globally optimal match computation for aligning profile curves results in a partition list. Each entry in this list contains a matching element from the first and second profile curves, along with any subsequent non-matching elements. This partition list provides a structured representation of how the two curves align and where discrepancies occur in their section sequences.
7. The method of claim 6 , wherein the adapted first profile curve and the adapted second profile curve are generated by: aligning the consecutive sections of the first profile curve with consecutive sections of the second profile curve based on pattern matches; adjusting a vertex count in each of the consecutive sections to allow for one-to-one vertex morphing; adding a first mismatching section from the first profile curve to the adapted first profile curve; and collapsing the first mismatching section in the adapted first profile curve to a single first point of the second adapted profile curve.
Generating the adapted profile curves involves aligning the consecutive sections of the first and second profile curves based on identified pattern matches. The vertex count in each section is adjusted to enable one-to-one vertex morphing. If the first profile curve contains a section that doesn't match anything in the second profile curve, this mismatching section is added to the adapted first profile curve. Finally, this mismatching section is collapsed to a single point in the adapted second profile curve.
8. The method of claim 1 , wherein within a transition zone between the adapted first profile curve and the adapted second profile curve: an interpolation parameter t is computed from a relative position on the extrusion line according to a curve length; the parameter t is transformed by a smoothing function that smoothes a beginning and an end of the transition zone; for the constant attributes that can be interpolated, the smoothing function is used to linearly interpolate the constant attributes in the transition zone; and for the constant attributes that cannot be interpolated, the smoothing function utilizes a threshold value for when to switch between values of the constant attributes.
Within a transition zone between the adapted first and second profile curves, an interpolation parameter `t` is computed based on the relative position along the extrusion line. This parameter `t` is then transformed by a smoothing function that smooths the transition at the beginning and end of the transition zone. For constant attributes that can be interpolated, the smoothing function performs linear interpolation within the zone. For attributes that cannot be interpolated, the smoothing function switches between the attribute values based on a threshold value.
9. An apparatus for transitioning between a first profile curve and a different second profile curve in a swept surface extrusion in a computer system comprising: (a) a computer having a memory; (b) an application executing on the computer, wherein the application is configured to: (i) obtain the first profile curve and the second profile curve, wherein: (1) the first profile curve is different than the second profile curve; (2) each profile curve comprises one or more section sequences comprised of two or more consecutive sections; (3) each of the two or more consecutive sections comprise two or more constant attributes; (4) the two or more constant attributes comprise one or more graphic attributes and one or more semantic attributes; and (5) the one or more section sequences define a semantic pattern for each profile curve; (ii) compute a globally optimal match between the consecutive sections of the first profile curve and the second profile curve based on the semantic pattern; (iii) generate an adapted first profile curve and an adapted second profile curve, wherein the adapted first profile curve and the adapted second profile curve have the same sections, and wherein the adapted first profile curve matches a first curve geometry of the first profile curve and the adapted second profile curve matches a second curve geometry of the second profile curve; (iv) compute an actual profile curve for a given position on an extrusion line using a one-to-one vertex position morphing based on the adapted first profile curve and the adapted second profile curve; (v) perform the swept surface extrusion on the extrusion line based on the actual profile curve; and (vi) display, on a display device, a drawing containing the swept surface extrusion.
An apparatus in a computer system performs swept surface extrusion with transitions between two profile curves. It includes a computer with memory running an application. The application obtains two different profile curves, each having section sequences comprised of consecutive sections that each have graphic and semantic attributes, defining a semantic pattern. It computes the optimal match between sections based on semantic pattern, generates adapted curves with the same sections that geometrically resemble the original curves, calculates an actual profile curve using vertex position morphing, performs the swept surface extrusion, and displays the result.
10. The apparatus of claim 9 , wherein the swept surface extrusion is used to create a road on a road network.
The apparatus for transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, as described above, is configured such that the swept surface extrusion is used to create a road on a road network.
11. The apparatus of claim 9 , wherein the globally optimal match is computed based on a string edit distance function.
In the apparatus for transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, the globally optimal match is computed based on a string edit distance function.
12. The apparatus of claim 11 , wherein the globally optimal match is computed by: utilizing a weighting function for matches and string manipulations, wherein a length of runs of consecutive identical manipulations or identical matches are tracked to allow for run-length-dependent weights; and searching for a manipulation sequence that maximizes a total weight.
In the apparatus, the string edit distance computation for optimal matching involves a weighting function that considers both matches and string manipulations. The weighting also tracks runs of consecutive identical manipulations or identical matches, applying run-length-dependent weights. The method searches for the manipulation sequence that yields the maximum total weight.
13. The apparatus of claim 12 , wherein: a look-up table defines weights for each semantic attribute; a weight of zero (w=0) is used for insertion into a longer pattern; a weight of −run length (w=−run length) is used for insertion into a shorter pattern; and substitutions are not allowed.
In the apparatus, the weighted string edit distance computation for optimal matching, a lookup table defines the weights for each semantic attribute. An insertion into a longer pattern receives a weight of zero. An insertion into a shorter pattern receives a weight of negative the run length. Substitutions are not allowed.
14. The apparatus of claim 9 , wherein the globally optimal match outputs a partition list with each entry containing a matching element of the first profile curve and the second profile curve together with subsequent non-matching elements.
In the apparatus, the globally optimal match computation for aligning profile curves results in a partition list. Each entry in this list contains a matching element from the first and second profile curves, along with any subsequent non-matching elements.
15. The apparatus of claim 14 , wherein the adapted first profile curve and the adapted second profile curve are generated by: aligning the consecutive sections of the first profile curve with consecutive sections of the second profile curve based on pattern matches; adjusting a vertex count in each of the consecutive sections to allow for one-to-one vertex morphing; adding a first mismatching section from the first profile curve to the adapted first profile curve; and collapsing the first mismatching section in the adapted first profile curve to a single first point of the second adapted profile curve.
In the apparatus, generating the adapted profile curves involves aligning the consecutive sections of the first and second profile curves based on identified pattern matches. The vertex count in each section is adjusted to enable one-to-one vertex morphing. If the first profile curve contains a section that doesn't match anything in the second profile curve, this mismatching section is added to the adapted first profile curve. Finally, this mismatching section is collapsed to a single point in the adapted second profile curve.
16. The apparatus of claim 9 , wherein within a transition zone between the adapted first profile curve and the adapted second profile curve: an interpolation parameter t is computed from a relative position on the extrusion line according to a curve length; the parameter t is transformed by a smoothing function that smoothes a beginning and an end of the transition zone; for the constant attributes that can be interpolated, the smoothing function is used to linearly interpolate the constant attributes in the transition zone; and for the constant attributes that cannot be interpolated, the smoothing function utilizes a threshold value for when to switch between values of the constant attributes.
In the apparatus, within a transition zone between the adapted first and second profile curves, an interpolation parameter `t` is computed based on the relative position along the extrusion line. This parameter `t` is then transformed by a smoothing function that smooths the transition at the beginning and end of the transition zone. For constant attributes that can be interpolated, the smoothing function performs linear interpolation within the zone. For attributes that cannot be interpolated, the smoothing function switches between the attribute values based on a threshold value.
17. A non-transitory computer readable storage medium encoded with computer program instructions which when accessed by a computer cause the computer to load the program instructions to a memory therein creating a special purpose data structure causing the computer to operate as a specially programmed computer, executing a method of transitioning between a first profile curve and a different second profile curve in a swept surface extrusion, comprising: (a) obtaining, in the specially programmed computer, the first profile curve and the second profile curve, wherein: (i) the first profile curve is different than the second profile curve; (ii) each profile curve comprises one or more section sequences comprised of two or more consecutive sections; (iii) each of the two or more consecutive sections comprise two or more constant attributes; (iv) the two or more constant attributes comprise one or more graphic attributes and one or more semantic attributes; and (v) the one or more section sequences define a semantic pattern for each profile curve; (b) computing, in the specially programmed computer, a globally optimal match between the consecutive sections of the first profile curve and the second profile curve based on the semantic pattern; (c) generating, in the specially programmed computer, an adapted first profile curve and an adapted second profile curve, wherein the adapted first profile curve and the adapted second profile curve have the same sections, and wherein the adapted first profile curve matches a first curve geometry of the first profile curve and the adapted second profile curve matches a second curve geometry of the second profile curve; (d) computing, in the specially programmed computer, an actual profile curve for a given position on an extrusion line using a one-to-one vertex position morphing based on the adapted first profile curve and the adapted second profile curve; (e) performing, in the specially programmed computer, the swept surface extrusion on the extrusion line based on the actual profile curve; and (f) displaying, on a display device, using the specially programmed computer, a drawing containing the swept surface extrusion.
A non-transitory computer-readable storage medium stores instructions. When executed, these instructions cause a computer to perform swept surface extrusion with transitions between two profile curves. The computer obtains two different profile curves, each having section sequences comprised of consecutive sections that each have graphic and semantic attributes, defining a semantic pattern. It computes the optimal match between sections based on semantic pattern, generates adapted curves with the same sections that geometrically resemble the original curves, calculates an actual profile curve using vertex position morphing, performs the swept surface extrusion, and displays the result.
18. The non-transitory computer readable storage medium of claim 17 , wherein the swept surface extrusion is used to create a road on a road network.
The non-transitory computer readable storage medium, storing instructions for transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, is configured such that the swept surface extrusion is used to create a road on a road network.
19. The non-transitory computer readable storage medium of claim 17 , wherein the globally optimal match is computed based on a string edit distance function.
On the non-transitory computer readable storage medium storing instructions for transitioning between profile curves in swept surface extrusion, where profile curves have consecutive sections containing graphic/semantic attributes and a semantic pattern, the globally optimal match is computed based on a string edit distance function.
20. The non-transitory computer readable storage medium of claim 19 , wherein the globally optimal match is computed by: utilizing a weighting function for matches and string manipulations, wherein a length of runs of consecutive identical manipulations or identical matches are tracked to allow for run-length-dependent weights; and searching for a manipulation sequence that maximizes a total weight.
On the non-transitory computer readable storage medium, the string edit distance computation for optimal matching involves a weighting function that considers both matches and string manipulations. The weighting also tracks runs of consecutive identical manipulations or identical matches, applying run-length-dependent weights. The method searches for the manipulation sequence that yields the maximum total weight.
21. The non-transitory computer readable storage medium of claim 20 , wherein: a look-up table defines weights for each semantic attribute; a weight of zero (w=0) is used for insertion into a longer pattern; a weight of −run length (w=−run length) is used for insertion into a shorter pattern; and substitutions are not allowed.
On the non-transitory computer readable storage medium, in the weighted string edit distance computation for optimal matching, a lookup table defines the weights for each semantic attribute. An insertion into a longer pattern receives a weight of zero. An insertion into a shorter pattern receives a weight of negative the run length. Substitutions are not allowed.
22. The non-transitory computer readable storage medium of claim 17 , wherein the globally optimal match outputs a partition list with each entry containing a matching element of the first profile curve and the second profile curve together with subsequent non-matching elements.
On the non-transitory computer readable storage medium, the globally optimal match computation for aligning profile curves results in a partition list. Each entry in this list contains a matching element from the first and second profile curves, along with any subsequent non-matching elements.
23. The non-transitory computer readable storage medium of claim 22 , wherein the adapted first profile curve and the adapted second profile curve are generated by: aligning the consecutive sections of the first profile curve with consecutive sections of the second profile curve based on pattern matches; adjusting a vertex count in each of the consecutive sections to allow for one-to-one vertex morphing; adding a first mismatching section from the first profile curve to the adapted first profile curve; and collapsing the first mismatching section in the adapted first profile curve to a single first point of the second adapted profile curve.
On the non-transitory computer readable storage medium, generating the adapted profile curves involves aligning the consecutive sections of the first and second profile curves based on identified pattern matches. The vertex count in each section is adjusted to enable one-to-one vertex morphing. If the first profile curve contains a section that doesn't match anything in the second profile curve, this mismatching section is added to the adapted first profile curve. Finally, this mismatching section is collapsed to a single point in the adapted second profile curve.
24. The non-transitory computer readable storage medium of claim 17 , wherein within a transition zone between the adapted first profile curve and the adapted second profile curve: an interpolation parameter t is computed from a relative position on the extrusion line according to a curve length; the parameter t is transformed by a smoothing function that smoothes a beginning and an end of the transition zone; for the constant attributes that can be interpolated, the smoothing function is used to linearly interpolate the constant attributes in the transition zone; and for the constant attributes that cannot be interpolated, the smoothing function utilizes a threshold value for when to switch between values of the constant attributes.
On the non-transitory computer readable storage medium, within a transition zone between the adapted first and second profile curves, an interpolation parameter `t` is computed based on the relative position along the extrusion line. This parameter `t` is then transformed by a smoothing function that smooths the transition at the beginning and end of the transition zone. For constant attributes that can be interpolated, the smoothing function performs linear interpolation within the zone. For attributes that cannot be interpolated, the smoothing function switches between the attribute values based on a threshold value.
Unknown
October 28, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.