A two-dimensional and three-dimensional integrated polygonal graphics generation method, device and storage medium

Abstract

The embodiment of the present application provides a method, device and storage medium for generating a two-dimensional and three-dimensional integrated polygonal graphic. The method includes: selecting a first polygonal area and a second polygonal area in a target map, converting the coordinate system of the vertices of the first polygonal area and the second polygonal area, setting the value of the first direction of the converted vertex to zero, and generating a first plane polygon and a second plane polygon; performing Boolean operations on the first plane polygon and the second plane polygon to generate a polygon or a polygon set; determining the longitude and latitude of the vertex coordinates in the generated polygon or polygon set and the corresponding altitude; drawing the first polygonal area and the second polygonal area of ​​the target map in a two-dimensional view and a three-dimensional view according to the longitude and latitude of the vertex coordinates in the polygon or polygon set and the corresponding altitude. The method of the embodiment of the present application can not only realize the two-dimensional and three-dimensional integration of the polygon Boolean operation algorithm, but also avoid being affected by distortion in high-latitude areas.

Description

Technical Field

[0001] The present application relates to the field of geographic image technology, and in particular to a method, device and storage medium for generating a two-dimensional and three-dimensional integrated polygonal graphic. Background Art

[0002] Boolean operation technology is one of the most important and complex problems in constructing complex entities in computer geometric solid modeling technology, and has important applications in the fields of construction engineering, industrial design, etc. Boolean operation can combine a group of simple models into a complex model, or divide a complex model into a combination of simple models.

[0003] In two-dimensional graphics systems, planar polygon Boolean operations are one of the most basic operations, and are widely used in CAD and geometric solid modeling, and are involved in the fields of computational geometry, computer graphics, geographic information systems, and geological disaster prediction and assessment.

[0004] In the 3D graphics system, the intersection, union and difference Boolean operations between entities are a basic modeling method in 3D solid modeling. Boolean operations have been introduced into solid modeling technology for many years and have now become an important modeling method in solid modeling systems. In the CAD / CAM systems currently in use, Boolean operations are an indispensable component.

[0005] Traditional polygon Boolean operation algorithms used in geographic information systems are mostly based on two-dimensional graphics systems. However, with the development of three-dimensional geographic information display platforms, the application of polygon Boolean operation technology in three-dimensional scenes has become more and more frequent, but traditional two-dimensional polygon Boolean operation algorithms are difficult to meet these needs.

[0006] In order to realize the use of polygonal Boolean operation algorithms in three-dimensional scenes, the existing three-dimensional polygonal Boolean operation algorithms are mainly divided into two categories: one is to directly perform the intersection of points, lines and surfaces in three-dimensional space to realize the Boolean operation of entities; the other is to adopt the method of dimensionality reduction, first through some spatial intersection operations, to convert the three-dimensional problem into a two-dimensional problem, and then return to three dimensions, and finally realize the Boolean operation of entities. These Boolean operation algorithms based on three-dimensional graphics systems have poor applicability in three-dimensional geographic information platforms, and the polygonal Boolean operation algorithms proposed for three-dimensional geographic information platforms have some problems: they can only be used normally near the equator, and the closer to the high latitude area, the greater the distortion effect; they are only applicable to three-dimensional scenes, and it is difficult to perfectly compatible with them when converted to two-dimensional scenes. Summary of the invention

[0007] In view of this, the purpose of this application is to propose a method for generating a two-dimensional and three-dimensional integrated polygonal graphics to solve the above-mentioned technical problems existing in the prior art.

[0008] Based on the above purpose, in the first aspect of the present application, a method for generating a two-dimensional and three-dimensional integrated polygonal graphic is proposed, comprising:

[0009] Selecting a first polygonal area and a second polygonal area in the target map, generating a first vertex set according to the vertices of the first polygonal area, and generating a second vertex set according to the vertices of the second polygonal area;

[0010] Convert the vertices in the first vertex set into points in the first coordinate system to generate a third vertex set, and convert the vertices in the second vertex set into points in the first coordinate system to generate a fourth vertex set;

[0011] Setting the values ​​of the points in the third vertex set and the fourth vertex set in the first direction in the first coordinate system to zero, and generating a first planar polygon and a second planar polygon in the second direction and the third direction in the first coordinate system;

[0012] Performing Boolean operation on the first planar polygon and the second planar polygon to generate a polygon or a polygon set;

[0013] Determine the latitude and longitude of the vertex coordinates in the generated polygon or polygon set and the corresponding altitude;

[0014] The first polygonal area and the second polygonal area of ​​the target map are drawn in a two-dimensional view and a three-dimensional view according to the longitude and latitude of the vertex coordinates in the polygon or the polygon set and the corresponding altitude.

[0015] In some embodiments, before selecting the first polygonal area and the second polygonal area in the target map, generating a first vertex set according to the vertices of the first polygonal area, and generating a second vertex set according to the vertices of the second polygonal area, the method further includes:

[0016] Initialize and construct the MapView views used to carry 3D map drawing and 2D view drawing respectively.

[0017] In some embodiments, the coordinates of the points in the first set of vertices and the second set of vertices are geographic coordinates.

[0018] In some embodiments, the first coordinate system is a northeast celestial coordinate system.

[0019] In some embodiments, converting vertices in the first vertex set to points in the first coordinate system to generate a third vertex set, and converting vertices in the second vertex set to points in the first coordinate system to generate a fourth vertex set includes:

[0020] Convert the coordinates of the points in the first vertex set into geocentric coordinate system coordinates, calculate the geocentric coordinate system coordinates of the geometric center points of the first polygonal area and the second polygonal area, and convert the geocentric coordinate system coordinates of the geometric center points into geographic coordinate system coordinates. Taking the position of the geometric center point as the origin, convert the vertices in the first vertex set into points in the northeast celestial coordinate system to generate a third vertex set, and convert the vertices in the second vertex set into points in the northeast celestial coordinate system to generate a fourth vertex set.

[0021] In some embodiments, setting the values ​​of the points in the third vertex set and the fourth vertex set in the first direction in the first coordinate system to zero to generate the first planar polygon and the second planar polygon in the second direction and the third direction in the first coordinate system includes:

[0022] The values ​​of the points in the third vertex set and the fourth vertex set in the celestial direction of the northeast celestial coordinate system are set to zero to generate a fifth vertex set and a sixth vertex set, wherein the points in the fifth vertex set and the sixth vertex set respectively form a first planar polygon and a second planar polygon in the north and east directions of the northeast celestial coordinate system.

[0023] In some embodiments, performing a Boolean operation on the first planar polygon and the second planar polygon to generate a polygon or a polygon set includes:

[0024] A Boolean operation is performed on the first planar polygon and the second planar polygon to generate an intersection polygon or a polygon set, a union polygon or a polygon set, an XOR operation polygon or a polygon set, and a difference polygon or a polygon set of the first planar polygon and the second planar polygon.

[0025] In some embodiments, if there is an open polygon or polygon set in the intersection polygon or polygon set, union polygon or polygon set, XOR operation polygon or polygon set, and difference polygon or polygon set of the generated first planar polygon and the second planar polygon, the corresponding hole value is recorded.

[0026] Based on the above purpose, in a second aspect of the present application, a device is proposed, comprising:

[0027] one or more processors;

[0028] A storage device for storing one or more programs;

[0029] When the one or more programs are executed by the one or more processors, the one or more processors implement the method for generating a two-dimensional and three-dimensional integrated polygonal graphics as described in any one of the first aspects.

[0030] Based on the above purpose, in the third aspect of the present application, a computer-readable storage medium is proposed, on which a computer program is stored, and when the program is executed by a processor, the method for generating a two- or three-dimensional integrated polygonal graphics as described in any one of the first aspects is implemented.

[0031] The method for generating a two- and three-dimensional integrated polygonal graphic provided in the embodiment of the present application realizes the two- and three-dimensional integration of the polygonal Boolean operation algorithm through coordinate transformation and Boolean operation, and can also avoid the influence of distortion in high-latitude areas. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

[0033] Figure 1 It is a flow chart of a method for generating a two-dimensional and three-dimensional integrated polygonal graphic according to the first embodiment of the present application;

[0034] Figure 2 It is a flow chart of a method for generating a two-dimensional and three-dimensional integrated polygonal graphic according to the second embodiment of the present application;

[0035] Figure 3 is a schematic diagram of the structure of a computer system of a terminal device or server used to implement an embodiment of the present application;

[0036] Figure 4 It is a schematic diagram of the difference, intersection, union, and XOR operations of two simple polygons in common positions;

[0037] Figure 5 Schematic diagram of the difference, intersection, union, and XOR operations of two simple polygons at the equator;

[0038] Figure 6 Schematic diagram of the difference, intersection, union, and XOR operations of two simple polygons at the North Pole. DETAILED DESCRIPTION

[0039] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It should also be noted that, for ease of description, only the parts related to the relevant invention are shown in the accompanying drawings.

[0040] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other, and the "first", "second", etc. in the embodiments of the present application are only used to distinguish the features in the embodiments, and should not be considered as limiting the technical solution of the present application. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0041] As an embodiment of the present application, Figure 1 FIG. 1 is a flow chart of a method for generating a two-dimensional and three-dimensional integrated polygonal graph according to the first embodiment of the present application. Figure 1 It can be seen from the figure that the method for generating a two-dimensional and three-dimensional integrated polygonal graph of this embodiment includes the following steps:

[0042] S101: Select a first polygonal area and a second polygonal area in a target map, generate a first vertex set according to the vertices of the first polygonal area, and generate a second vertex set according to the vertices of the second polygonal area.

[0043] The method of this embodiment can be applied to a three-dimensional scene in a geographic information system to display map information in two-dimensional and three-dimensional integration, thereby improving the applicability of the Boolean operation algorithm. Specifically, when the target map is drawn in two-dimensional and three-dimensional integration, first, a first polygonal area and a second polygonal area are arbitrarily selected in the target map including a two-dimensional map and / or a three-dimensional map. The first polygonal area and the second polygonal area here can usually be simple polygons. The simple polygon here refers to a polygon in which two adjacent sides intersect at the vertex of a polygon, and there is no intersection between any two non-adjacent sides. The simple polygon can be a concave polygon or a convex polygon. The selected simple polygon is not limited by the latitude of the earth, and can be arbitrarily selected from low-latitude areas such as the equator to high-latitude areas such as the North and South Poles; it is also not limited by land type, and the drawing area can be selected in land or ocean areas; it is also not limited by terrain, and the drawing area can be selected in mountainous areas, forests, and other areas.

[0044] After selecting the first polygonal area and the second polygonal area, the vertices of the first polygonal area are organized into a first vertex set in counterclockwise order, and the vertices of the second polygonal area are organized into a second vertex set in counterclockwise order. The counterclockwise order here can also be a clockwise order, or other orders, such as an order with one vertex alternated counterclockwise.

[0045] S102: Convert vertices in the first vertex set into points in a first coordinate system to generate a third vertex set, and convert vertices in the second vertex set into points in the first coordinate system to generate a fourth vertex set.

[0046] In this embodiment, after the first vertex set and the second vertex set are generated, the vertices in the first vertex set and the second vertex set are converted to coordinate systems, and a third vertex set and a fourth vertex set are generated based on the converted vertices. Specifically, since the first polygonal area and the second polygonal area are directly selected in the target map, the coordinates of the vertices of the selected first polygonal area and the second polygonal area are usually points in the geographic coordinate system. In order to achieve two-dimensional and three-dimensional integration of the polygon Boolean operation algorithm and avoid distortion in high-latitude areas, it is necessary to convert the points in the geographic coordinate system into points in the northeast celestial coordinate system to determine the longitude and latitude of the vertices of the first polygonal area and the second polygonal area. In this embodiment, the first vertex set and the second vertex set can be denoted as set1 and set2, respectively. Traverse all points in vertex sets set1 and set2 (L i , B i , H i ), convert each point to geocentric coordinates, and get (X i , Y i , Z i ); Traverse(X i , Y i , Z i ), calculate the average value (X avr , Y avr , Z avr ),X avr =∑ i X i / n,Y avr =∑ i Y i / n,Z avr =∑ i Z i / n; (X avr , Y avr , Z avr ) is converted to the geographic coordinate system and refCentre(L c , B c , H c );with refCentre(L c , B c , H c ) is the origin of the ENU (northeast sky) coordinate system, and all vertices in set1 and set2 are traversed respectively, and each vertex is converted to the ENU coordinate system to obtain the set set1′ and the set set2′, where set1′={(N i , E i ), i≥1&&i≤N1}, set2′={(N j , E j ), j≥1&&j≤N2}.

[0047] S103: Setting the values ​​of the points in the third vertex set and the fourth vertex set in the first direction in the first coordinate system to zero, and generating a first planar polygon and a second planar polygon in the second direction and the third direction in the first coordinate system.

[0048] In this embodiment, after the vertices in the first vertex set and the second vertex set are converted into points in the northeast celestial coordinate system, the coordinate value of each vertex in the celestial direction is set to 0, two new polygons are formed on the plane in the celestial direction, and two vertex sets, namely the fifth vertex set and the sixth vertex set, are generated according to the vertices of the two new polygons. The points in the fifth vertex set and the sixth vertex set respectively form the first plane polygon and the second plane polygon in the north direction and the east direction in the northeast celestial coordinate system.

[0049] S104: Perform a Boolean operation on the first planar polygon and the second planar polygon to generate a polygon or a polygon set.

[0050] A Boolean operation is performed on the first planar polygon and the second planar polygon to generate an intersection polygon or polygon set, a union polygon or polygon set, an XOR polygon or polygon set, and a difference polygon or polygon set of the first planar polygon and the second planar polygon. Specifically, Figure 4 The figure shows the difference, intersection, union, and XOR operations of two simple polygons in common positions. Figure 5 Schematic diagram of the difference, intersection, union, and XOR operations of two simple polygons at the equator. Figure 6 The figure is a schematic diagram of the difference, intersection, union, and XOR operations of two simple polygons at the North Pole. It can be seen from the figure that the results of Boolean operations on two planes in different regions are different.

[0051] S105: Determine the longitude and latitude of the vertex coordinates in the generated polygon or polygon set and the corresponding altitude.

[0052] The vertex coordinates of the polygons or polygon sets obtained by the Boolean operation are traversed respectively, and the altitude of the longitude and latitude point position is calculated from the vertex coordinates of the polygons or polygon sets of the operation results in the northeast celestial coordinate system. According to the obtained longitude and latitude positions and altitudes, the vertex coordinates of the polygons or polygon sets of all operation results in the geographic coordinate system are stored.

[0053] S106: Drawing the first polygonal area and the second polygonal area of ​​the target map in the two-dimensional view and the three-dimensional view according to the longitude and latitude of the vertex coordinates in the polygon or the polygon set and the corresponding altitude.

[0054] The method for generating a two- and three-dimensional integrated polygonal graphic in the embodiment of the present application can not only realize the two- and three-dimensional integration of the polygonal Boolean operation algorithm, but also avoid the influence of distortion in high-latitude areas.

[0055] like Figure 2 , is a flow chart of a method for generating a two-dimensional and three-dimensional integrated polygonal graph according to Embodiment 2 of the present application. This embodiment is an embodiment expanded on the basis of Embodiment 1. Specifically, before Step S101 in Embodiment 1, the following steps are also included:

[0056] S201: Initialize and construct MapView views for carrying 3D map drawing and 2D view drawing respectively.

[0057] That is, two MapView views are initialized and constructed in advance, one MapView3D is used to carry 3D map drawing, and one MapView2D is used to carry 2D view drawing.

[0058] In step S101, four nodes are drawn according to the first vertex set and the second vertex set, and the four nodes are loaded into the corresponding two views respectively.

[0059] The method of this embodiment can achieve similar technical effects as those of the first embodiment, and such method will not be described again in detail.

[0060] In addition, as an optional embodiment of the present application, in the above embodiment, if there is an open polygon or polygon set in the intersection polygon or polygon set, union polygon or polygon set, XOR operation polygon or polygon set, and difference polygon or polygon set of the generated first planar polygon and the second planar polygon, the corresponding hole value is recorded.

[0061] The present application also provides a device, including:

[0062] one or more processors;

[0063] A storage device for storing one or more programs;

[0064] When the one or more programs are executed by the one or more processors, the one or more processors implement the above-mentioned method for generating a two-dimensional and three-dimensional integrated polygonal graphic.

[0065] In addition, an embodiment of the present application also proposes a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the above-mentioned method for generating a two-dimensional and three-dimensional integrated polygonal graphic is implemented.

[0066] Reference below Figure 3, which shows a schematic diagram of the structure of a computer system of a terminal device or server suitable for implementing an embodiment of the present application. Figure 3 The terminal device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0067] like Figure 3 As shown, the computer system includes a central processing unit (CPU) 301, which can perform various appropriate actions and processes based on a program stored in a read-only memory (ROM) 302 or a program loaded from a storage part 308 into a random access memory (RAM) 303. In RAM 303, various programs and data required for system operation are also stored. CPU 301, ROM 302 and RAM 303 are connected to each other via a bus 304. An input / output (I / O) interface 305 is also connected to the bus 304.

[0068] The following components are connected to the I / O interface 305: an input section 306 including a keyboard, a mouse, etc.; an output section 307 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 308 including a hard disk, etc.; and a communication section 309 including a network interface card such as a LAN card, a modem, etc. The communication section 309 performs communication processing via a network such as the Internet. A drive 310 is also connected to the I / O interface 305 as needed. A removable medium 311, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 310 as needed so that a computer program read therefrom is installed into the storage section 308 as needed.

[0069] In particular, based on the embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication section 309, and / or installed from a removable medium 311. When the computer program is executed by a central processing unit (CPU) 301, the above-mentioned functions defined in the method of the present application are executed.

[0070] It should be noted that the computer-readable medium described in the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0071] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a unit, a program segment or a part of a code, and the unit, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0072] The units involved in the embodiments described in the present application may be implemented by software or by hardware. The units described may also be provided in a processor, for example, may be described as: a processor including an information measurement unit, a driving trajectory determination unit, a mapping relationship determination unit, and a driving strategy generation unit. The names of these units do not, in some cases, constitute limitations on the units themselves, for example, the information measurement unit may also be described as a "unit for measuring the state information of the vehicle and the surrounding scene information".

[0073] As another aspect, the present application also provides a non-volatile computer storage medium, which can be the non-volatile computer storage medium included in the device described in the above embodiment; or it can be a non-volatile computer storage medium that exists independently and is not installed in the terminal. The above non-volatile computer storage medium stores one or more programs, and when the one or more programs are executed by a device, the device: selects a first polygonal area and a second polygonal area in a target map, transforms the coordinate system of the vertices of the first polygonal area and the second polygonal area, sets the value of the first direction of the transformed vertex to zero, and generates a first plane polygon and a second plane polygon; performs Boolean operations on the first plane polygon and the second plane polygon to generate a polygon or a polygon set; determines the longitude and latitude of the vertex coordinates in the generated polygon or polygon set and the corresponding altitude; according to the longitude and latitude of the vertex coordinates in the polygon or polygon set and the corresponding altitude, draws the first polygonal area and the second polygonal area of ​​the target map in a two-dimensional view and a three-dimensional view.

[0074] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above invention concept. For example, the above features are replaced with the technical features with similar functions disclosed in this application (but not limited to) by each other to form a technical solution.

Claims

1. A method for generating a two-dimensional and three-dimensional integrated polygonal graphic, characterized in that: include: Initialize and construct the MapView views used to carry 3D map drawing and 2D view drawing respectively; Selecting a first polygonal area and a second polygonal area in a target map, generating a first vertex set according to vertices of the first polygonal area, and generating a second vertex set according to vertices of the second polygonal area, wherein coordinates of points in the first vertex set and the second vertex set are geographic coordinates; Convert the vertices in the first vertex set into points in the first coordinate system to generate a third vertex set, convert the vertices in the second vertex set into points in the first coordinate system to generate a fourth vertex set, wherein the first coordinate system is a northeast celestial coordinate system; including: converting the coordinates of the points in the first vertex set and the second vertex set into geocentric coordinate system coordinates, calculating the geocentric coordinate system coordinates of the geometric center points of the first polygonal area and the second polygonal area, and converting the geocentric coordinate system coordinates of the geometric center points into geographic coordinate system coordinates, taking the position of the geometric center point as the origin, converting the vertices in the first vertex set into points in the northeast celestial coordinate system to generate a third vertex set, and converting the vertices in the second vertex set into points in the northeast celestial coordinate system to generate a fourth vertex set; Setting the values ​​of the points in the third vertex set and the fourth vertex set in the first direction in the first coordinate system to zero, and generating a first planar polygon and a second planar polygon in the second direction and the third direction in the first coordinate system; Performing Boolean operation on the first planar polygon and the second planar polygon to generate a polygon or a polygon set; Determine the latitude and longitude of the vertex coordinates in the generated polygon or polygon set and the corresponding altitude; The first polygonal area and the second polygonal area of ​​the target map are drawn in a two-dimensional view and a three-dimensional view according to the longitude and latitude of the vertex coordinates in the polygon or the polygon set and the corresponding altitude.

2. The method according to claim 1, characterized in that The step of setting the values ​​of the points in the third vertex set and the fourth vertex set in the first direction in the first coordinate system to zero to generate the first planar polygon and the second planar polygon in the second direction and the third direction in the first coordinate system comprises: The values ​​of the points in the third vertex set and the fourth vertex set in the celestial direction of the northeast celestial coordinate system are set to zero to generate a fifth vertex set and a sixth vertex set, wherein the points in the fifth vertex set and the sixth vertex set respectively form a first planar polygon and a second planar polygon in the north and east directions of the northeast celestial coordinate system.

3. The method according to claim 2, characterized in that The performing Boolean operation on the first planar polygon and the second planar polygon to generate a polygon or a polygon set includes: A Boolean operation is performed on the first planar polygon and the second planar polygon to generate an intersection polygon or a polygon set, a union polygon or a polygon set, an XOR operation polygon or a polygon set, and a difference polygon or a polygon set of the first planar polygon and the second planar polygon.

4. The method according to claim 3, characterized in that If there is an open polygon or polygon set in the intersection polygon or polygon set, union polygon or polygon set, XOR operation polygon or polygon set, and difference polygon or polygon set of the generated first planar polygon and the second planar polygon, record the corresponding hole value.

5. An electronic device, characterized in that: include: one or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method for generating a two-dimensional and three-dimensional integrated polygonal graphics as described in any one of claims 1-4.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method for generating a two-dimensional and three-dimensional integrated polygonal graphic as described in any one of claims 1 to 4 is implemented.

Images