Polygon epitaxial boundary processing method and device

Abstract

The embodiment of the invention discloses a polygon epitaxy boundary processing method and device, and the method comprises the steps: obtaining a polygon, and judging and obtaining all intersection points between all line segments of the original boundary epitaxy of the polygon; if it is judged that the position of the current intersection point is in the original boundary, abandoning the currentintersection point, and otherwise, reserving the current intersection point; calculating the limit distance between each reserved intersection point and the original boundary, if the actual shortestdistance between the current intersection point and the original boundary is judged to be smaller than the limit distance, abandoning the current intersection point, otherwise, reserving the current intersection point; and performing line segment adjustment on the reserved intersection points to obtain polygons with normal epitaxial boundaries. According to the embodiment of the invention, variousintersection point processing conditions are considered, and the limit distance is calculated, so that the problem of complex polygon epitaxial boundary errors is solved, and the method and devic canbe applied to calculation of various epitaxial boundaries and has very high practical value.

Description

technical field [0001] Embodiments of the present invention relate to the field of computer technology, and in particular to a method and device for processing polygonal extension boundaries. Background technique [0002] The existing calculation methods of polygon extension boundaries generally have the following three methods: [0003] The first is to move each side of the polygon in parallel for a certain distance, and connect them in sequence after the translation, such as figure 1 As shown, in this way, at each vertex of the polygon, the extension distance will be smaller than the extension distance on each side of the polygon. The second is to move each side of the polygon in parallel for a certain distance, and connect the intersection points of the extension lines of each line after translation, such as figure 2 As shown, in this way, at each corner of the polygon, the extension distance will be greater than the extension distance on each side of the polygon; the ...

AI Technical Summary

Problems solved by technology

[0004] Among the above three existing methods, the third method is relatively more rigorous and more scientific, and the frequency of use is also the highest, but the third method is no problem for simple polygons, but when the polygons are more complex and adjacent When the distance between vertices is relatively close, this method will cause errors, such as Figure 4 and 5 shown

Images