JP3363669B2 - Image processing method and apparatus - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing method and apparatus, for example, an image processing method and apparatus for calculating the amount of bite between a graphic element to be processed or a part composed of one or more elements. is there.

[0002]

2. Description of the Related Art Conventionally, there is an apparatus that obtains a distance between an element or a part composed of one or more elements by using an information processing system for processing a figure such as CAD.

[0003]

However, since there has not been a clear definition of the amount of bite in the past, it was not possible to find the shortest distance when an element or a part composed of one or more elements bites. .

[0004]

The present invention has been made for the purpose of solving the above-mentioned problems. As one means for solving the above-mentioned problems, the following structure is provided, for example.

That is, it is composed of graphic elements and eats each other.
With an image processing method to calculate the shortest distance of embedded parts
That is, a graphic element to be processed from the storage means
A reading step of reading the first line segment and the second line segment, and reading
Line segment of the other party from the end point of each line segment or its extension
A vertical line process that draws a vertical line on each line, and multiple vertical lines
The intersection with the line segment is temporarily stored in the storage means as the temporary shortest point.
Shortest point storing process and the edges corresponding to the stored vertical lines
From the points and intersections, calculate the distance between
The calculation process required and the distance between points calculated in the calculation process
And the longest distance is stored in the storage device as the shortest distance.
And a shortest distance storing step.

Alternatively , they are composed of graphic elements and eat each other.
With an image processing method to calculate the shortest distance of embedded parts
Point that is a graphic element to be processed from the storage means
And the arc of reading the point and the arc
A matching determination step of determining whether the center points match,
If the point read in the matching process and the center point of the arc match
If judged, the end point of the arc is stored in the storage means as the shortest point.
The first shortest point storing process to be stored and the matching determination process are read.
If it is determined that the embedded point and the center point of the arc do not match
In this case, the intersection of the straight line connecting the point and the center point and the arc is the shortest point.
A second shortest point storing step of
In the shortest point storing step or the second shortest point storing step
The distance between the shortest point stored in
And a calculation process that stores the calculated distance as the shortest distance.
And a shortest distance storing step of storing
It

Further, there is provided an image processing method for calculating the shortest distance between parts which are composed of graphic elements and intrude into each other, and a reading step of reading line segments and arcs which are graphic elements to be processed from a storage means. When it to a line perpendicular to the street segment the center point of the arc read intersects the line segment and circular arc
Down first point and the second point, respectively, and the third point and the fourth point, respectively a straight line connecting the centers of the end points and an arc of the line segment intersects the arc, a perpendicular to the line segment from the arc end point Each 5th
Point and the sixth point are respectively stored in the storage means as the temporary shortest point, the temporary shortest point storing step, the distance between the first point and the second point, the third point and the third point. the distance between the end points of the corresponding line segments, the distance between the endpoints of a line segment corresponding to the fourth point and the fourth point, between the arc end point corresponding to the point of the fifth point and the fifth and distance arithmetic step of determining the respective operating means and the distance between the arc end point corresponding to the point of the sixth point and the sixth,
A shortest distance storing step of storing the longest distance from the obtained distances in the storage means as the shortest distance.

Furthermore, it is composed of graphic elements and
Image processing method to calculate the shortest distance of bite parts
A graphic element to be processed from the storage means.
A reading step of reading the first circular arc and the second circular arc
Judge whether the first arc and the second arc are concentric circles
If the concentric circle judgment process is
If defined, the center point of the first arc and the center of the second arc
The first point and the first point where the straight line passing through the points intersects each arc
2 point, the end point of the first arc and the center point of the second arc.
The third point and the fourth point where the straight line that intersects the second arc
A straight line passing through the point, the end point of the second circular arc, and the center point of the first circular arc.
A fifth point and a sixth point where the line intersects the first arc, respectively.
Are stored in the storage means as temporary shortest points.
The point storing step, the distance between the first point and the second point, and the third point
The distance between the points and the corresponding endpoints of the first arc, and the fourth point
Corresponds to the distance between the endpoints of the corresponding first arc and the fifth point
The distance between the end points of the second arc that corresponds to the sixth point
The distance between the end points of the second arc is calculated by the calculating means.
From the calculation process and the calculated distance, the longest distance is the shortest distance
And a shortest distance storing step of storing in the storage means as
It is characterized by

[0009] Further , it is composed of graphic elements and eats each other.
With an image processing device for calculating the shortest distance of embedded parts
That is, a graphic element to be processed from the storage means
Reading means for reading the first line segment and the second line segment;
From each end of the line segment
A perpendicular line setting means that draws down a line and the intersection of multiple perpendicular lines and line segments
Temporary shortest point memorizer that stores in the storage means as the temporary shortest point
The column and the end points and intersections that correspond to the stored vertical lines
And the calculation means for calculating the distance between each point
The longest distance is the shortest among the distances obtained by steps
The shortest distance storage means for storing the distance in the storage device is provided.
It is characterized by doing.

Further, the image processing apparatus for calculating the shortest distance between the parts which are composed of graphic elements and intrude into each other, and read means for reading the line segment and the arc which are the graphic elements to be processed from the storage means. When it to a line perpendicular to the street segment the center point of the arc read intersects the line segment and circular arc
Down first point and the second point, respectively, and the third point and the fourth point, respectively a straight line connecting the centers of the end points and an arc of the line segment intersects the arc, a perpendicular to the line segment from the arc end point Each 5th
Point and the sixth point are respectively stored in the storage means as the temporary shortest point, the shortest point storage means, the distance between the first point and the second point, the third point and the third point. the distance between the end points of the corresponding line segments, the distance between the endpoints of a line segment corresponding to the fourth point and the fourth point, between the arc end point corresponding to the point of the fifth point and the fifth distance and an arithmetic means for obtaining respectively the distance between the arc end point corresponding to the point of the sixth point and the sixth, the shortest distance storage for the longest distance from among the distances determined and stored in the storage means as the shortest distance And means.

An image processing apparatus for calculating the shortest distance between parts which are composed of graphic elements and intrude into each other, and which are first graphic arcs and second arcs which are graphic elements to be processed from the storage means. And a concentric circle determining means for determining whether the read first and second arcs are concentric circles, and if the determining means determines that they are not concentric circles, the center point of the first arc And a straight line passing through the center point of the second arc intersects the respective arcs, a first point and a second point, and a straight line passing through the end point of the first arc and the center point of the second arc is the second point. A third point and a fourth point which intersect the arc, respectively, and a fifth point and a sixth point where a straight line passing through the end point of the second arc and the center point of the first arc intersects the first arc, respectively. Are stored as temporary shortest points in the storage means, respectively. And a second point, a distance between the end points of the first arc corresponding to the third point, a distance between the end points of the first arc corresponding to the fourth point, and a fifth point. And a calculation means for calculating the distance between the end points of the second circular arc corresponding to and the distance between the end points of the second circular arc corresponding to the sixth point, and the longest distance among the calculated distances as the shortest distance. And a shortest distance storage means for storing in the storage means.

[0012]

In the above structure, by clearly defining the bite amount, it is possible to easily find the shortest distance when the element or the part composed of one or more elements bites, which has not been obtained in the past. it can. Further, in the simulation of the mechanism, even if the parts are cut into each other, the designer can perform the simulation by the conventional operation.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment according to the present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing a schematic configuration of an information processing system to which the bite amount calculating apparatus of one embodiment according to the present invention is applied.

In FIG. 1, reference numeral 11 denotes an input device equipped with a keyboard device, a mouse and the like, which has an instruction of elements displayed on the screen of the display device 14, an instruction of a position on the screen, and other input functions. is doing.

Reference numeral 12 denotes a storage device having a semiconductor memory, a magnetic disk, etc., and data corresponding to the CAD graphic element to be processed (in the case of a two-dimensional line segment, the coordinates of the start point and the end point, and in the case of a two-dimensional arc). Is the start point / end point / center coordinates and rotation direction, and in the case of a two-dimensional circle, geometric information sufficient to determine the figure elements such as the center coordinates and radius, and a set of elements and their placement information), The stored information, the shortest point obtained by the information processing system of the present embodiment, the calculation result of the amount of bite, and other various information are stored.

Reference numeral 13 denotes a central processing unit that controls the overall operation of the apparatus of this embodiment, and executes reading, processing, writing, and other various controls for executing various controls of the information processing system of this embodiment. There is.

Reference numeral 14 denotes a display device, which displays elements or parts composed of one or more elements, various messages, the amount of bite required by the information processing system of this embodiment, and the like.

The bite amount calculation process of the present embodiment having the above configuration will be described below.

2 to 9 are flowcharts showing the bite amount calculation processing in the information processing system of this embodiment, and the control program for executing this processing is the storage device 12.
And is loaded into the main memory of the central processing unit 13 and executed.

First, with reference to FIG. 2, the shortest distance calculation processing of the point / line segment in this embodiment will be described.

First, in step S11 of FIG. 2, the shortest point of a point and a line segment is set. In this process, first, the data of the element such as a figure to be processed is read from the storage device 12. Then draw a perpendicular from the point of the read element to the line segment. Next, in the central processing unit 13, the intersection of the perpendicular and the line segment is obtained as the shortest point and stored in the storage unit 12.

For example, in the case of a line segment A1 and a point A2 as shown in FIG. 10, a perpendicular line A3 is drawn from the point A2 to the line segment A1.
The intersection A4 of the line segment A1 is calculated. And this intersection A4
The point A2 is the shortest point. The result is stored in the storage device 12.

Next, in step S12, the shortest distance between the point and the line segment is calculated. In this process, the distance between the shortest points obtained in step S11 is calculated by the central processing unit 13 and stored in the storage device 12 as the shortest distance.
For example, in FIG. 10, the distance A5 between the points A2 and A4 obtained as the shortest point is stored in the storage device 12 as the shortest distance.

Next, with reference to FIG. 3, in step S21 of FIG. 3 for explaining the shortest distance calculation processing of the line segment / line segment in the present embodiment, the line segment and the shortest point of the line segment are set. In this process, first, the data of the target element is read from the storage device 12, and the perpendicular line is drawn from the end point of each line segment to the line segment of the other party. Next, in the central processing unit 13, the intersection of the perpendicular and the line segment is obtained as a temporary shortest point,
It is stored in the storage device 12.

For example, in the case of the line segment B1 and the line segment B2 as shown in FIG. 11, first, the perpendicular lines B5 and B6 are dropped from the end points B3 and B4 of the line segment B1 to the line segment B2, and the perpendicular line and the line segment B2 are extended. The intersections B7 and B8 with the straight line are calculated. Then, the perpendicular B3 and the intersection B7, and the perpendicular B
4 and the intersection B8 are stored in the storage device 12 as temporary shortest points. Next, from the end points B9 and B10 of the line segment B2, similarly, the perpendicular lines B11 and B12 are similarly dropped, and the intersection point B13 with the line segment B1 and the perpendicular point B9 and the intersection point 14 and the perpendicular point B10 are tentatively shortest. The points are stored in the storage device 12.

Next, in step S22, the line segment and the shortest distance between the line segments are calculated. In this process, step S21
The central processing unit 13 calculates the distance between the tentative shortest points obtained in step 1, and stores the longest one in the storage device 12 as the shortest distance.

The details of the above-described calculation of the line segment and the shortest distance of the line segment (step S22 of FIG. 3) will be described below with reference to the flowchart of FIG.

First, in step S31, step S2
Whether or not the shortest distance has been calculated for all of the temporary shortest points obtained in 1 is determined to be the end. When it is determined that the processing has been completed for all the temporary shortest points, the storage device 12 is finally used.
The point and the distance stored in are set as the shortest point and the shortest distance, and the processing ends. In the example of FIG. 11, the temporary shortest points (B3 and B7, B4 and B8, B9 and B) stored in the storage device 12 are stored.
13, B10 and B14) are performed in this order, and when the processes of B10 and B14 are completed, it is determined that the processes of all the shortest points are completed.

On the other hand, if it is determined in step S31 that all temporary shortest points have not been processed, the flow advances to step S32 to determine the line segment of the temporary shortest point. This process is a process of determining whether or not the provisional shortest point is on each line segment when it is determined in step S31 that all the shortest points have not been processed. Based on the error amount preset in the information processing system of the present embodiment, it is determined that the point is on the line segment when the distance between the point and the line segment is smaller than the error amount. If it is determined that the tentative shortest point is not on the line segment, the process returns to step S31 to process the next shortest point.

On the other hand, if it is determined in step S32 that the tentative shortest point is on the line segment, the process proceeds to step S33 of calculating the shortest distance. At the provisional shortest point obtained in FIG. 11, it is determined that B8 and B4 and B14 and B10 are on the line segment. In step S33, the distance of the temporary shortest point is calculated. In the case of FIG. 11, the distance B15 between B8 and B4 for which the temporary shortest point is determined to be on the line segment in step 32
Then, the distance B16 between B14 and B10 is calculated.

Next, in step S34, the longest distance is determined. In this process, the process obtained in step S33 is compared with the longest distance stored in the storage device 12, and if it is determined that the obtained distance is longer than the longest distance in the storage device 12, step S35. , Step S36
Then, the calculated shortest distance is stored in the storage device 12 as the longest distance and the temporary shortest point as the shortest point.

If it is determined that the distance is shorter than the longest distance of the storage device 12, the process returns to step S31 and the next provisional shortest point is processed. For example, in FIG. 11, first, the distance B15 obtained in step S33 and the storage device 1
The maximum distance of 2 is compared. (A negative value is set as the initial value for the longest distance of the storage device 12.) Since B15> 0.0 in this case, it is determined that B15 is longer, and the next step S35, step S3.
In step 6, B15 and the tentative shortest points B8 and B14 are stored in the storage device 12 as the longest distance and the shortest point, respectively.

Next, the distance B16 is compared with the longest distance (B15 is stored) of the storage device 12. In this case B
Since 15> B16, it is determined that the distance is shorter than the maximum distance of the storage device 12, and the process returns to step S31. Here, the longest distance finally stored in the storage device 12 becomes the shortest distance between the line segments B1 and B2 in step S22 of FIG.

Further, referring to FIG. 5 in this embodiment,
The shortest distance calculation processing of points / circles (arcs) will be described. Figure 5
It is a flow chart explaining the shortest distance calculation of a point and a circle (arc).

First, in step S41, the coincidence between the point and the center point of the circle (arc) is determined. In this processing, first, the data of the target element is read from the storage device 12, and the central processing unit 13 calculates the distance between the point and the center point of the circle (arc),
The amount of error is compared with that set in the information processing system of this embodiment. If the distance obtained here is smaller than the error amount, it is determined that the point and the center point coincide with each other, and step S4 is performed.
2. Go to step S43.

In step S42, the end points and points of the circle (arc) are set as the shortest points and stored in the storage device 12. Continuing step S4
In step 3, the radius of the circle (arc) is calculated as the shortest distance, and the storage device 1
Store in 2. For example, when the point C1 and the center point C3 of the arc C2 coincide as shown in FIG. 12, the end points C4 and C1 of the arc are the shortest points, and the end points C5 and C1 are the shortest points, respectively, and the radius C6 of the arc is the point of the points and the arc. The shortest distance.

On the other hand, when the distance obtained in step S41 is not smaller than the error amount, it is determined that the point and the center point do not match, and the process proceeds to steps S44 and S45.
First, at step S44, the straight line connecting the point and the center point of the circle (arc) and the intersection and point of the circle (arc) are stored in the storage device 12 as the shortest points. Subsequently, the distance of the shortest point obtained in step S45 is set as the shortest distance and stored in the storage device 12. For example, in FIG.
As shown in FIG. 3, when the point D1 and the center point D3 of the arc D2 do not coincide with each other, the intersection D5 of the straight line D4 connecting the point D1 and the center point D3 and the arc D2 is obtained, and the intersection D5 and the point D1 are set as the shortest points. To do. The distance D6 between D5 and D1 is the shortest distance between the point and the circular arc.

Next, the shortest distance calculation of the line segment / circle (arc) in this embodiment will be described with reference to FIG. First step S
At 51, the shortest point between the line segment and the circle (arc) is set. In this process, the central processing unit 13 first reads the data of the target element from the storage unit 12. Then, a straight line perpendicular to the line segment is obtained from the center point of the circle (arc), the intersection of the straight line, the line segment, and the circle (arc) is set as the temporary shortest point, and the temporary shortest point is stored in the storage device 12. To do. Next, the end point of the line segment and the shortest point of the arc are obtained by the same processing as the above-described steps S41, S42, and S44 in FIG. Further, the end point of the arc and the shortest point of the line segment are obtained in the same manner as in step S11 of FIG. 2 described above, and the storage device 1 is used as a temporary end point.
Store in 2. For example, in the case of an arc E1 and a line segment E2 as shown in FIG. 14, first, a line segment E2 is drawn from the center point E3 of the arc E1.
A straight line E4 perpendicular to the line is obtained, and the obtained straight line E4 and line segment E
An intersection E6 between the intersection E5 of 2 and the arc E1 is obtained. Next, the end points E7, E8 of the line segment and the shortest points E9, E10 of the arc E1 are obtained by the same processing as steps S41, S42, S44. Next, the shortest points E13 and E14 of the arc end points E11 and E12 and the line segment E2 are obtained, and the obtained shortest points are all stored in the storage device 12 as temporary shortest points.

Next, in step S52, the shortest distance between the line segment and the circle (arc) is calculated. In this processing, the central processing unit 1 calculates the distance between the temporary shortest points obtained in step S51.
3, the longest distance is stored in the storage device 12 as the shortest distance.

Details of the calculation process of the line segment and the shortest distance of the line segment in step S52 described above will be described below with reference to the flowchart of FIG.

First, in step S61, step S5
It is determined whether or not processing has been performed for all temporary shortest points obtained in 1. When it is determined that the processing has not been performed for all the temporary shortest points, the process proceeds to step S62, and it is determined whether the temporary shortest points are on the line segment and the element of the circle (arc). Whether the point is on the element is determined based on the error amount preset in the information system of this embodiment, and when the distance between the point and the element is within the error amount, it is determined that the point is on the element. . If it is determined that the line segment is not on the circle (arc), the process returns to step S61 to process the next shortest point.

On the other hand, if it is determined in step S62 that the tentative shortest points are on the line segment and on the circle (arc), the process proceeds to step S63. Since the provisional shortest points shown in FIG. 14 are on line segments or arcs other than E13 and E14, respectively, the provisional shortest points E5 and E6, E7 and E9, and E8 and E10 are determined to be on the element. .

Then, in step S63, the distance of the temporary shortest point determined to be on the element in step S62 is calculated. In the example shown in FIG. 14, step S62.
Then, the distance E15 between E5 and E6, the distance E16 between E7 and E9, and the distance E17 between E8 and E10 in which the provisional shortest point is determined to be on the element are calculated.

Next, in step S64, the longest distance is determined. In this process, the distance obtained in step S63 is compared with the longest distance stored in the storage device 12, and it is determined whether or not the obtained distance is longer than the shortest distance of the storage device 12. . If it is determined that the calculated distance is shorter than the longest distance of the storage device 12, the process returns to step S61, and the process of the next provisional shortest point is performed.

On the other hand, if it is determined in step S64 that the calculated distance is longer than the shortest distance of the storage device 12, the process proceeds to step S65, and the calculated shortest distance is stored in the storage device 12 as the longest distance. And the following step S
At 66, the temporary shortest point is set as the shortest point, and the storage device 12
To store. Then, the process returns to step S61.

On the other hand, if it is determined in step S61 that the processing has been completed for all temporary shortest points, the points and distances finally stored in the storage device 12 are treated as the shortest points and shortest distances. To finish. In FIG. 14, the provisional shortest points (E5 and E6, E8 and E1 stored in the storage device 12 are stored.
0, E11 and E13, E12 and E14) are performed in this order, and when the processing of E12 and E14 is completed, it is determined that the processing of all shortest points is completed.

In the processing of steps S64 to S66, for example, in the case of the example shown in FIG. 14, the distance E15 obtained in step S63 and the storage device 1 are first determined.
2 is compared with the maximum distance of 2 (the maximum distance of the storage device 12 is set to a negative value as an initial value). In this case, since E15> 0.0, E15
Is determined to be longer, and the distance E15 and the tentative shortest point are stored in the storage device 12 as the longest distance and the shortest point in the next steps S65 and S66, respectively.

Next, the distance E16 is compared with the longest distance of the storage device 12, and in this case, it is determined that it is shorter than E15 stored as the longest distance in the storage device 12, and step S6 is performed.
Return to processing of 1. Next, the distance E17 is compared, and it is determined that the distance E17 is shorter than the longest distance of the storage device 12, and the process returns to step S61. Here, finally the storage device 12
The longest distance stored in is the shortest distance between the arcs E1 and E2 in step S52 of FIG.

Next, the shortest distance calculation process of a circle (arc) and a circle (arc) in this embodiment will be described with reference to FIG. Figure 8
FIG. 9 is a flowchart illustrating a circle (arc) / shortest distance calculation process for a circle (arc).

First, in step S71, it is determined whether the circle (arc) and the circle (arc) are concentric circles. In this process, first, the data of the target element is read from the storage device 12. Next, in the central processing 13, the distance between the center points of the respective circles (arcs) is obtained and compared with the error amount preset in the information system of this embodiment. Here, if the distance between the center points is equal to or greater than the error amount , it is determined that they are not concentric circles, and the process proceeds to steps S72 and S73.

In step S72, a circle (arc) and a circle (arc)
Find the temporary shortest point of. In this process, first, the point where the straight line connecting the central points intersects each circle (arc) is obtained as the shortest point. Next, the end points of the circles (arcs) and the shortest points of the circles (arcs) are obtained in the same manner as in step S44 and step S45.
Therefore , all the calculated shortest points are stored in the storage device 12. For example, as shown in FIG. 15, arc F1 and arc F2
If is not a concentric circle , first, the intersections F6 and F7 of the straight line F5 passing through the center points F3 and F4 and the arc F2 are obtained, and these are stored in the storage device 12 as temporary shortest points. Next, the shortest points F10, F between the end points F8, F9 of the arc F1 and the arc F2.
11 are the end points F12 of the arc F2 and the shortest points F14 and F15 of the arc F1 are the steps S44 and S45.
And is stored in the storage device 12 as a temporary shortest point.

Next, in step S73, the shortest distance between the circle (arc) and the circle (arc) is calculated. In this processing, the distance between the temporary shortest points obtained in step S72 is calculated by the central processing unit 1.
3, and the longest one is stored in the storage device 12 as the shortest distance.

Details of the calculation process of the shortest distance between circles (arcs) and circles (arcs) in step S73 of FIG. 8 described above will be described with reference to FIG.
This will be described below with reference to the flowchart of FIG.

First, in step S81, step S72
Whether or not the shortest distances have been calculated for all of the temporary shortest points obtained in step 3 is determined. Here, if it is determined not to perform <br/> process with the shortest points of all provisional step S8
Proceeding to 2, it is determined whether or not the temporary shortest point is on each arc. Whether the point is on a circle (arc) is determined based on the error amount preset in the information system of the present embodiment when the distance between the point and the circle (arc) is smaller than the error amount. Is determined to be on a circle (arc). If the distance between the point and the circle (arc) is greater than or equal to the error amount, it is determined that the point is not on the circle (arc). Here, when it is determined that it is not on an arc,
The process returns to step S81 to process the next shortest point.

On the other hand, if it is determined in step S82 that the tentative shortest point is on each circle (arc), the process proceeds to step S83, and the shortest distance is calculated. Figure 15
Since the tentative shortest points obtained by the above are on the respective arcs except the intersection E10, the tentative shortest points F6 and F7 ,
It is determined that F9 and F11, F12 and F14, F13 and F15 are on a circle (arc).

In step S83, the distance of the temporary shortest point is calculated. In FIG. 15 , F6 and F7 in which it is determined in step S82 that the temporary shortest point is on the circle (arc)
Distances F16, F9 and F11 distances F17, F12 and F
The distance F18 of 14 and the distance F19 of F13 and F15 are to be calculated.

Next, in step S84, the longest distance is determined. In this process, the distance calculated in step S83 is compared with the longest distance stored in the storage device 12. When it is determined that the calculated distance is longer than the maximum distance of the storage device 12, the process proceeds to step S85, and the calculated minimum distance is set as the maximum distance and stored in the storage device 12. Subsequently, in step S87, the temporary shortest point is set as the shortest point and stored in the storage device 12. Then, the process returns to step S81.

On the other hand, if it is determined in step S84 that the distance is shorter than the longest distance of the storage device 12, the process returns to step S81, and the next provisional shortest point is processed. For example, in FIG.
5, first, the distance F obtained in step S83
16 is compared with the longest distance of the storage device 12 (the longest distance of the storage device 12 is set to a negative value as an initial value). In this case, since F16> 0.0, it is determined that F16 is longer, and the next step S8
5, in step S86, the distance F16 and the temporary shortest point are stored in the storage device 12 as the longest distances.
Next, the distance F17, the distance F18, and the distance F19 are similarly compared with the longest distance of the storage device 12, and the longest distance and the shortest point are set. Here, the longest distance finally stored in the storage device 12 becomes the shortest distance between the arcs F1 and F2 in step S73 of FIG.

On the other hand, if it is determined in step S81 that all processing has ended, the processing is ended with the shortest point and the shortest distance finally stored in the storage device 12. Figure 1
In the example shown in FIG. 5, the temporary shortest points (F6 and F7, F8 and F10, F9 and F11, F1 stored in the storage device 12 are stored.
2 and F14, F13 and F15) in the order
When the processing of 13 and F15 is completed, it is determined that the processing of all the shortest points is completed.

Further, returning to the description of the processing of FIG. 8, if the distance between the center points is smaller than the error amount in step S71, it is determined that they are concentric circles, and the process proceeds to step S74. Step S
At 74, it is determined whether the circle (arc) and the circle (arc) overlap.
In this process, the center point of the circle (arc) and each circle (arc)
The angle formed by the X-axis and the straight line passing through the end point of is calculated. next,
Within the angle between the endpoints of one circle (arc), the other circle (arc)
It is determined whether or not the angle of the end point exists, and if there is, it is determined that they overlap, and if they do not, it is determined that they do not overlap.

For example, a circle (arc) G1 as shown in FIG.
And G2, the angle θ4 formed by the end points G6 of the arc G2 exists between the angles θ1 and θ2 formed by the end points G3 and G4 of the circle (arc) G1 and is therefore determined to overlap. Further, in the case of the arcs H1 and H2 as shown in FIG. 17, there is no other end point between the angles θ1, θ2 and θ3, θ4 formed by the end points, so it is determined that they do not overlap.

If it is determined in step S74 that they overlap, the process proceeds to step S75, in which the central processing unit 13 determines the radius difference between the two circles (arcs) as the shortest distance and sets this as the calculated short distance. To store. Subsequently, in step S76, the intersection point of the arc and the straight line passing through the end points of the arcs determined to overlap and the center point of the arcs is obtained as the shortest point, which is set as the shortest point and stored in the storage device 12.
To store. For example, it is determined in FIG.
In this case, the radius difference G8 between the circular arc G1 and the circular arc G2 becomes the shortest distance, and the intersection point G10 and the end point G6 of the straight line 9 and the circular arc G1 passing through the circular arc end point G6 and the circular arc center point G7 determined to overlap in step S74. Is the shortest point.

On the other hand, if it is determined in step S74 that they do not overlap, the process proceeds to step S77, in which the orientation of the circles (arcs) is determined. In this process, step S74
Π is added to the angle formed by one of the circle (arc) end points obtained in step S7, and overlap determination is performed as in step S74. Here, if they overlap, it is determined that the circles (arcs) are facing each other,
It proceeds to step S78.

Then, in step S78, the central processing unit 13
At, the sum of the radii of the two circles (arcs) is obtained as the shortest distance and stored in the storage step place 12. Then, in a succeeding step S79, the intersection of the straight line passing through the end point of the arc determined to face each other and the center point of the arc and the arc is obtained as the shortest point and stored in the storage device 12. For example, in FIG. 18 in which it is determined that they face each other, the shortest distance is the radius sum H8 of the arcs H1 and H2, and a straight line H9 that passes through the end point H5 of the arc and the center point H7 of the arc that are determined to face each other in step S77. The intersection H10 and the end point H5 of the arc 1 are the shortest points.

On the other hand, if they do not overlap in step S77, it is determined that the circles (arcs) do not face each other, and the process ends without obtaining the shortest distance. For example, step S7
In FIG. 17, which is determined not to overlap with each other, the angles θ1 and θ6 formed by the obtained end points of the arc H1 and θ2 are added to obtain θ5 and θ6, and the angle θ formed by the end points of the arc H2 is obtained.
3 and θ4 determine θ5 and θ6, and determine whether the angles θ3 and θ4 formed by the end points of the arc H2 exist between θ5 and θ6. In this case, since θ3 exists between θ5 and θ6, it is determined that the arc H1 and the arc H2 face each other. In the case of the arc I1 and the arc I2 as shown in FIG. 18, the angles θ3 and θ4 formed by the end points of the arc I2 do not exist between θ5 and θ6 obtained by adding π to the end points of the arc I1 and θ2. Therefore, it is determined that they do not face each other, and the process ends.

As described above, according to the present embodiment, by clearly defining the bite amount, the shortest time when an element or a part composed of one or more elements is biting, which has not been conventionally required. The distance can be easily obtained. Further, in the simulation of the mechanism, even if the parts are cut into each other, the designer can perform the simulation by the conventional operation.

The present invention also provides a "host computer,
The invention may be applied to a system including a plurality of devices such as an interface and a printer, or to an apparatus including one device such as a copying machine. Further, it goes without saying that the present invention can be applied to the case where it is implemented by supplying a program to a system or an apparatus. In this case, the storage medium storing the program according to the present invention constitutes the present invention. Then, by reading the program from the storage medium to the system or device, the system or device operates in a predetermined manner.

[0070]

As described above, according to the present invention, by clearly defining the bite amount, it is possible to easily obtain the shortest distance when the element or the component composed of one or more elements bites. be able to.

[0071]

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration of an information processing system that performs image processing according to an embodiment of the present invention.

FIG. 2 is a flowchart showing a line segment / point bite amount calculation process in the present embodiment.

FIG. 3 is a flowchart showing a line segment / line segment biting amount calculation process in the present embodiment.

FIG. 4 is a flowchart showing details of a line segment / line segment shortest distance calculation process in FIG.

FIG. 5 is a flow chart showing a point / circle (arc) bite amount calculation process in the present embodiment.

FIG. 6 is a flowchart showing a line segment / circle (arc) bite amount calculation process in the present embodiment.

FIG. 7 is a flowchart showing details of the shortest distance calculation processing of the line segment / circle (arc) shown in FIG.

FIG. 8 is a flowchart showing a calculation process of a circle (arc) and a biting amount of a circle (arc) in the present embodiment.

9 is a flowchart showing details of calculation of a shortest distance between a circle (arc) and a circle (arc) in FIG.

FIG. 10 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 11 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 12 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 13 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 14 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 15 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 16 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 17 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

FIG. 18 is a diagram illustrating a method of calculating the shortest distance and the shortest point in the present embodiment.

[Explanation of supplements]

11 Input device 12 Storage device. 13 Central processing unit 14 Display

─────────────────────────────────────────────────── --- Continuation of the front page (56) References JP-A-1-193973 (JP, A) JP-A-3-135672 (JP, A) JP-A-4-148483 (JP, A) JP-A-5- 120389 (JP, A) (58) Fields investigated (Int.Cl. ⁷ , DB name) G06T ⁷ /00-7/60 G06T 1/00 G06F 17/50

Claims (9)

(57) [Claims] 1. Comprised of graphic elements and digging into each other
It is an image processing method for calculating the shortest distance of parts.
The first line segment which is the graphic element to be processed from the storage means.
And a second line segment, and a reading step of reading the line segment of the other party from each end point of the read line segment.
Is a vertical step of drawing a vertical line on each of the extension lines, and the intersection of the plurality of vertical lines and the line segment is taken as the temporary shortest point.
The temporary shortest point storing step of storing in the storing means, and the end points and intersection points corresponding to the plurality of stored perpendicular lines
, The distance between each point is calculated by calculating means
The longest distance among the distances between the process and the points calculated in the above calculation process
Is the shortest distance stored in the storage device as the shortest distance.
An image processing method, comprising: a storing step. 2. The calculation step is the temporary shortest point memory work.
The temporary shortest point stored in the
If you are riding on the line segment, determine whether you are riding
When the distance between the points is calculated, the distance between the points is calculated.
The described image processing method. 3. Comprised of graphic elements, digging into each other
It is an image processing method for calculating the shortest distance of parts.
Then, from the storage means, the points and arcs that are the graphic elements to be processed are
It is possible to determine whether the reading process of reading and the center point of the arc match the read point.
A match determining step of constant, the match determining that the read the in the process and arc center point
If it is determined that they match, the end point of the arc is the shortest point.
Then, the first shortest point storing step for storing in the storage means and the point read in the coincidence determining step and the center point of the arc are
If it is determined that they do not match, the point and the center point are
Before term memory hand as the shortest point intersection of the straight line and the circular arc connecting
A second shortest point storing step for storing in stages, and the first shortest point storing step or the second shortest point storing step
Distance between the shortest point stored in the storage means and the point
The calculation step of calculating the separation by the calculation means, and recording the calculated distance in the storage means as the shortest distance.
And a shortest distance storing step to remember.
Image processing method. 4. An image processing method for calculating the shortest distance between parts that are composed of graphic elements and bite into each other, and a reading step of reading line segments and arcs, which are graphic elements to be processed, from a storage means. And a straight line passing through the center point of the read arc and perpendicular to the line segment intersects the line segment and the arc, respectively .
2 point, a third point and a fourth point where a straight line connecting the end point of the line segment and the center of the arc intersects the arc, and a third line drawn from the end point of the arc to the line segment.
Point 5 and point in the sixth, and the temporary shortest point storage step of storing in the storage means as the shortest point of the provisional respectively, the first point and the distance between the second point, the third point And a distance between end points of the line segment corresponding to the third point, a distance between end points of the line segment corresponding to the fourth point and the fourth point, the fifth point and the A calculating step of calculating a distance between the end points of the circular arc corresponding to a fifth point and a distance between the sixth point and the end points of the circular arc corresponding to the sixth point, respectively; And a shortest distance storing step of storing the longest distance as the shortest distance in the storage means. 5. Consists of graphic elements that dig into each other
It is an image processing method for calculating the shortest distance of parts.
The first circular arc which is the graphic element to be processed from the storage means.
And a second arc for reading, and whether or not the read first arc and second arc are concentric circles.
If the concentric circle determination step for determining, and the determination step is not concentric circles,
Passes through the center point of the first arc and the center point of the second arc
A first point and a second point where a straight line intersects each arc ,
Passes through the end point of the first circular arc and the center point of the second circular arc
A third point and a fourth point at which a straight line intersects the second circular arc, respectively.
Point, the end point of the second circular arc and the center of the first circular arc
A fifth line in which a straight line passing through the points intersects with the first circular arc, respectively.
The point and the sixth point are stored as the temporary shortest points, respectively.
Storing the shortest point in the means, the distance between the first point and the second point, and the third point
The distance between the endpoints of the first arc corresponding to
The distance between the endpoints of the first arc corresponding to the point
A distance between the endpoints of the second arc corresponding to the fifth point;
Distance between end points of the second arc corresponding to the sixth point
And a calculation step of calculating by a calculation means, and a longest distance among the calculated distances is defined as the shortest distance.
And storing the shortest distance in the storage means.
An image processing method characterized by the above. 6. Consists of graphic elements that bite into each other
Image processing device for calculating the shortest distance between
The first line segment which is the graphic element to be processed from the storage means.
And a second line segment for reading the line segment, and a line segment of the other party from each end point of the read line segment.
The perpendicular line setting means for lowering each perpendicular line, and the intersection of the plurality of perpendicular lines and the line segment as the temporary shortest point
The temporary shortest point storage means to be stored in the storage means, and the end points and intersections corresponding to the plurality of stored perpendicular lines
Of the longest distance between the points calculated by the calculation means and the distance calculated by the calculation means.
The shortest distance stored in the storage device as the shortest distance.
An image processing device having a distance storage means
Place 7. The calculation is performed by the temporary shortest point storage means.
The memorized temporary shortest point rides on the line segment read above.
If you are on the line segment,
The distance between points is calculated, The claim 6 characterized by the above-mentioned.
Image processing device. 8. An image processing device for calculating the shortest distance between parts which are composed of graphic elements and bite into each other, and reading means for reading line segments and arcs, which are graphic elements to be processed, from a storage means. And a straight line passing through the center point of the read arc and perpendicular to the line segment intersects the line segment and the arc, respectively .
2 point, a third point and a fourth point where a straight line connecting the end point of the line segment and the center of the arc intersects the arc, and a third line drawn from the end point of the arc to the line segment.
Point 5 and point in the sixth, and the temporary shortest point storage means for storing in said memory means as the closest point provisional respectively, the first point and the distance between the second point, the third point And a distance between end points of the line segment corresponding to the third point, a distance between end points of the line segment corresponding to the fourth point and the fourth point, the fifth point and the Calculating means for calculating the distance between the end points of the arc corresponding to the fifth point and the distance between the sixth point and the end points of the arc corresponding to the sixth point; An image processing apparatus comprising: a shortest distance storage unit that stores the longest distance from the inside as the shortest distance in the storage unit. 9. Comprised of graphic elements, digging into each other
Image processing device for calculating the shortest distance between
The first circular arc which is the graphic element to be processed from the storage means.
And a second arc for reading the second arc, and whether or not the read first arc and the second arc are concentric circles.
If the concentric circle determining means for determining, and the determination means is not concentric circles,
Passes through the center point of the first arc and the center point of the second arc
A first point and a second point where a straight line intersects each arc,
Passes through the end point of the first circular arc and the center point of the second circular arc
A third point and a fourth point at which a straight line intersects the second circular arc, respectively.
Point, the end point of the second circular arc and the center of the first circular arc
A fifth line in which a straight line passing through the points intersects with the first circular arc, respectively.
The point and the sixth point are stored as the temporary shortest points, respectively.
Shortest point storage means for storing in the means, the distance between the first point and the second point, and the third point
The distance between the endpoints of the first arc corresponding to
The distance between the endpoints of the first arc corresponding to the point
A distance between the endpoints of the second arc corresponding to the fifth point;
Distance between end points of the second arc corresponding to the sixth point
And a longest distance among the obtained distances as the shortest distance
And a shortest distance storage means for storing in the storage means.
An image processing device characterized by the above.