CN113847921A - Method for establishing map object three-dimensional model and electronic equipment - Google Patents

Method for establishing map object three-dimensional model and electronic equipment Download PDF

Info

Publication number
CN113847921A
CN113847921A CN202010594812.9A CN202010594812A CN113847921A CN 113847921 A CN113847921 A CN 113847921A CN 202010594812 A CN202010594812 A CN 202010594812A CN 113847921 A CN113847921 A CN 113847921A
Authority
CN
China
Prior art keywords
triangles
triangle
vertex
vertex index
group
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010594812.9A
Other languages
Chinese (zh)
Inventor
王斌
贾双成
吴红静
朱磊
贾郭峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mushroom Car Union Information Technology Co Ltd
Original Assignee
Mushroom Car Union Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mushroom Car Union Information Technology Co Ltd filed Critical Mushroom Car Union Information Technology Co Ltd
Priority to CN202010594812.9A priority Critical patent/CN113847921A/en
Publication of CN113847921A publication Critical patent/CN113847921A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30—Map- or contour-matching
    • G01C21/32—Structuring or formatting of map data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Computer Graphics (AREA)
  • Geometry (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Image Generation (AREA)

Abstract

The application relates to a method for establishing a three-dimensional map object model and electronic equipment. The method comprises the following steps: generating a vertex index according to the vertexes of a plurality of adjacent triangles of a first group of triangles and the vertexes of a plurality of adjacent triangles of a second group of triangles in the map object surface mesh, wherein the second group of triangles is adjacent to the first group of triangles, and the vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the first group of triangles and head point marking information, tail point marking information and/or false edge marking information of the second group of triangles; and establishing a three-dimensional model of the map object according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index. The scheme provided by the application can reduce the data storage capacity.

Description

Method for establishing map object three-dimensional model and electronic equipment
Technical Field
The present application relates to the field of electronic map technologies, and in particular, to a method for creating a three-dimensional map object and an electronic device.
Background
The three-dimensional electronic map adopts a three-dimensional graphic processing technology, and provides functions of map query, trip navigation and the like for a user through an intuitive geographical real-scene simulation expression mode on the basis of a three-dimensional electronic map database. The three-dimensional object shape in the three-dimensional map may be formed by a combination of many planes. Due to the special geometric characteristics of the triangles, the three-dimensional planes in the three-dimensional map mostly take the triangular planes as basic framework units, and the three-dimensional graphics can be completely combined by integrating all the triangular planes.
In the related art, the data volume of the three-dimensional model organized by a plurality of triangular sectors or triangular strips is large, and a large storage space is required to be occupied.
Disclosure of Invention
In order to overcome the problems in the related art, the application provides a method for establishing a three-dimensional map object model, which can reduce the data storage capacity.
According to an aspect of the present application, there is provided a method for creating a three-dimensional model of a map object, comprising:
generating a vertex index according to the vertexes of a plurality of adjacent triangles of a first group of triangles and the vertexes of a plurality of adjacent triangles of a second group of triangles in the map object surface mesh, wherein the second group of triangles is adjacent to the first group of triangles, and the vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the first group of triangles and head point marking information, tail point marking information and/or false edge marking information of the second group of triangles;
and establishing a three-dimensional model of the map object according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index.
Optionally, generating the vertex index according to the vertices of the plurality of adjacent triangles of the first group of triangles and the vertices of the plurality of adjacent triangles of the second group of triangles in the map object surface mesh comprises:
generating a first vertex index according to vertexes of a plurality of adjacent triangles of a first group of triangles in a map object surface mesh, and generating a second vertex index according to vertexes of a plurality of adjacent triangles of a second group of triangles in the map object surface mesh, wherein the first vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the first group of triangles, and the second vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the second group of triangles;
establishing a three-dimensional model of the map object according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index comprises:
and establishing a three-dimensional model of the map object according to the first vertex index, the second vertex index and the three-dimensional coordinates corresponding to the vertexes in the first vertex index and the second vertex index.
Optionally, establishing a three-dimensional model of the map object according to the first vertex index, the second vertex index, and the three-dimensional coordinates corresponding to the vertices in the first vertex index and the second vertex index includes:
combining the first vertex index and the second vertex index;
and establishing a three-dimensional model of the map object according to the combined vertex index and the three-dimensional coordinates corresponding to the vertexes.
Optionally, at least one of the first set of triangles and the second set of triangles forms a triangle fan.
Optionally, a plurality of adjacent triangles of the first group of triangles together form a triangle fan, where the number of adjacent triangles is n1, and a common vertex of each triangle is v0The three vertexes of the ith triangle are (v)0，vi，vi+1)；
The vertex indices include a vertex index (v) of the first set of triangles0(a)，v1，……，vn1+1(b, c)) or (v)n1+1(b，c)，……，v1，v0(a) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
Optionally, a plurality of adjacent triangles of the first group of triangles form a triangle fan together, the number of the adjacent triangles is n1, and the common vertex of each triangle is v0The three vertexes of the ith triangle are (v)0，vi，vi+1)；
A plurality of adjacent triangles of the second group of triangles form a triangle fan together, the number of the adjacent triangles is n2, and the common vertex of each triangle is vn1+1When j is 1, the three vertices of the jth triangle are (v)n1+1，v0，vn1+j) When j is>At 1, the three vertices of the jth triangle are (v)n1+1，vn1+j，vn1+j+1) And side (v)0，vn1+1) Is a common side of the first set of triangles and the second set of triangles;
the vertex indices include a vertex index (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
Optionally, at least one of the first set of triangles and the second set of triangles forms a triangle strip.
Optionally, a plurality of adjacent triangles of the first group of triangles together form a triangle strip, the number of adjacent triangles is n1, and when i is an odd number, three vertices of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1)；
The vertex indices include a vertex index (v) of the first set of triangles0(a)，v1，……，vn1+1(b, c)) or (v)n1+1(b，c)，……，v1，v0(a) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
Optionally, a plurality of adjacent triangles of the first group of triangles together form a triangle strip, the number of adjacent triangles is n1, and when i is an odd number, three vertices of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1)；
A plurality of adjacent triangles of the second group of triangles form a triangle strip together, the number of the adjacent triangles is n2, and when j is an odd number, three vertexes of the jth triangle are (v)n1+j-1，vn1+j，vn1+j+1) When j is an even number, the three vertices of the jth triangle are (v)n1+j，vn1+j-1，vn1+j+1) And side (v)n1，vn1+1) Is a common side of the first set of triangles and the second set of triangles;
the vertex index includes (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
In accordance with another aspect of the present application, there is provided an electronic device including:
a processor; and
a memory having executable code stored thereon, which when executed by the processor, causes the processor to perform the method as described above.
According to another aspect of the application, there is provided a non-transitory machine-readable storage medium having stored thereon executable code which, when executed by a processor of an electronic device, causes the processor to perform the method as described above.
In this embodiment, the start point, the end point, and the false edge of the triangle fan or the triangle strip are marked by the head point marking information, the tail point marking information, and/or the false edge marking information, so that the vertex of the triangle fan can be directly stored. During analysis, the map rendering engine can identify the start and the end of each triangular fan or each triangular strip according to the head point mark information and the tail point mark information, analyze corresponding graphs according to the organization rules of the triangular fans or the triangular strips, and can render the sides which do not need to be displayed or render the sides to be transparent according to the false edge mark information, so that the graph rendering quality is ensured.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The foregoing and other objects, features and advantages of the application will be apparent from the following more particular descriptions of exemplary embodiments of the application, as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts throughout the exemplary embodiments of the application.
FIG. 1 is a schematic flow chart diagram of a method for building a three-dimensional model of a map object according to an embodiment of the present application;
FIG. 2 exemplarily illustrates a simple triangle and its vertex representation;
FIG. 3 exemplarily illustrates a triangle fan and its vertex representation;
FIG. 4 exemplarily illustrates a triangle strip and its vertex representation;
FIG. 5 is a schematic flow chart diagram of a method for building a three-dimensional model of a map object according to another embodiment of the present application;
FIG. 6 exemplarily shows a combination of two triangle fans and their vertex representation;
fig. 7 is a schematic structural diagram of an electronic device according to an exemplary embodiment of the present application.
Detailed Description
Preferred embodiments of the present application will be described in more detail below with reference to the accompanying drawings. While the preferred embodiments of the present application are shown in the drawings, it should be understood that the present application may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms "first," "second," "third," etc. may be used herein to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present application, "a plurality" means two or more unless specifically limited otherwise.
The application provides a three-dimensional graphic data processing method, which reduces the storage capacity of a database and realizes the rapid analysis of a three-dimensional model of a plurality of triangular sectors or triangular stripe organizations.
The technical solutions of the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 is a schematic flow chart of a method for creating a three-dimensional map object according to an embodiment of the present application, and referring to fig. 1, the method of the present embodiment includes:
in step 101, vertex indices are generated according to vertices of a plurality of adjacent triangles of the first set of triangles and vertices of a plurality of adjacent triangles of the second set of triangles in the map object surface mesh.
The generated vertex index comprises the head point marking information, the tail point marking information and/or the false edge marking information of the first group of triangles, and the head point marking information, the tail point marking information and/or the false edge marking information of the second group of triangles.
In the present application, a map object may be any three-dimensional object in a map that is suitable for representation by a triangular surface mesh, which may be formed by any combination of simple triangles, triangular fans, triangular strips.
As exemplarily shown in fig. 2, a simple triangle GL _ TRIANGLES is one triangle drawn at every three vertices. With v0For the start point, the first triangle has a vertex index (v)0,v1,v2) The second triangle has a vertex index (v)3,v4,v5) And so on.
In the TRIANGLE FAN GL _ TRIANGLE _ FAN, a plurality of adjacent TRIANGLEs have a common vertex, e.g. v0In v with0As a starting point, the three vertices of the ith triangle are (v)0，vi，vi+1). For example, as exemplarily shown in FIG. 3, the first triangle has a vertex index (v)0,v1,v2) The second triangle has a vertex index (v)0,v2,v3) The third triangle has a vertex index (v)0,v3,v4) And so on.
The TRIANGLE STRIP GL _ TRIANGLE _ STRIP also has a plurality of adjacent TRIANGLEs therein, which may be, for example, v0As a starting point, when i is an odd number, three vertices of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1). As exemplarily shown in FIG. 4, the first triangle has a vertex index (v)0,v1,v2) The second triangle has a vertex index (v)2,v1,v3) The third triangle has a vertex index (v)2,v3,v4) And so on. In the triangular stripSuch a vertex index ensures that all triangles are drawn in the same direction, enabling this triangle string to correctly form part of the surface of the map object.
The first set of triangles can be triangle fans or triangle strips, and the second set of triangles can also be triangle fans or triangle strips, and the first set of triangles and the second set of triangles are adjacent to each other and respectively form a part of the triangular surface mesh of the map object.
In one implementation, the first vertex index may be generated as vertices of a plurality of adjacent triangles of the first set of triangles and the second vertex index may be generated as vertices of a plurality of adjacent triangles of the second set of triangles.
In this application, the first vertex index may include head point labeling information, tail point labeling information, and/or false edge labeling information of the first group of triangles, and the second vertex index may include head point labeling information, tail point labeling information, and/or false edge labeling information of the second group of triangles.
The first set of triangles is used as an example for explanation, and it will be understood that the second set of triangles is similar.
When a plurality of adjacent triangles of the first set of triangles form a triangle fan together, taking fig. 3 as an example, assume that the number of adjacent triangles is n1, and the common vertex of each triangle is v0Side (v)0，vn1+1) Is a false edge, and the three vertices of the ith triangle are (v)0，vi，vi+1) Then a first vertex index (v) may be generated as a function of the vertices of the plurality of adjacent triangles0(a)，v1，……，vn1+1(b, c)) wherein a is head point marking information, b is tail point marking information, and c is false edge marking information.
It is understood that a combination of preset tag categories and parameter values can be used as a, b, and c to represent corresponding tag information. For example, the head-to-tail FLAG information a may be a head-to-tail FLAG: 1, the tail point marking information b can be a head-tail FLAG: 2, the false edge FLAG information c may be a false edge FLAG: 1. wherein, the head and tail FLAG is a mark category.
According to the aboveWhere n1 is 3 in FIG. 3, the vertex index of the triangle fan may be (v)0(head-to-tail FLAG: 1), v1，v2，v3，v4(head-to-tail FLAG: 2, false edge FLAG: 1)), that is, directly connecting each vertex v of the triangular fan0，v1，v2，v3，v4And storing in sequence, and marking head and tail points and false edges.
It is understood that the label category may not be used, and three different preset parameter values are used as a, b and c to represent the corresponding label information.
It will be appreciated that in another implementation, the order of the vertices in the first vertex index may be changed to (v)n1+1(b，c)，……，v1，v0(a) I.e. directly connecting each vertex v of the triangle fan0，v1，v2，v3，v4And storing in the reverse order, and marking head and tail points and false edges.
When a plurality of adjacent triangles of the first set of triangles collectively form a triangle strip, for example, in FIG. 4, assume that the number of adjacent triangles is n1, and the side (v) isn1，vn1+1) Is a false edge, when i is odd, the three vertices of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1) Then a first vertex index (v) may be generated as a function of the vertices of the plurality of adjacent triangles0(a)，v1，……，vn1+1(b, c)), wherein a is head point marking information, b is tail point marking information, and c is false edge marking information.
Similarly, a combination of preset mark categories and parameter values can be used as a, b, and c to represent corresponding mark information, and still taking the mark information as an example, in fig. 4, n1 is 4, and the vertex index of the triangle strip can be (v0(head-to-tail FLAG: 1), v1，v2，v3，v4，v5(head-to-tail FLAG: 2, false-edged FLAG: 1)).
In another implementation, the order of the vertices in the first vertex index may beTo change into (v)n1+1(b，c)，……，v1，v0(a))。
In step 102, a three-dimensional model of the map object is built according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index.
In one implementation, the three-dimensional model of the map object may be built according to the first vertex index, the second vertex index, and the three-dimensional coordinates corresponding to the vertices in the first vertex index and the second vertex index.
The three-dimensional coordinates of the vertex comprise data of three coordinate axes of x, y and z. The three-dimensional coordinates of the vertices of each triangle define a trigonometric face. In this embodiment, according to the three-dimensional coordinates corresponding to the vertices in the first vertex index, the second vertex index, and the first vertex index and the second vertex index, the corresponding portion of the three-dimensional surface shape of the map object three-dimensional model may be established.
When a three-dimensional model of a map object is established, and when the vertex index contains head point mark information and tail point mark information during analysis and rendering, the start and the end of each triangular fan or each triangular strip can be obtained according to the head point mark information and the tail point mark information. When the vertex index contains the false edge marking information, the corresponding edge can be known not to be rendered or rendered to be transparent according to the false edge marking information. It is to be understood that the vertex index may not include the false edge marking information, or may include only the leading point marking information or the trailing point marking information.
In this embodiment, the start point, the end point, and the false edge of the triangle fan or the triangle strip are marked by the head point marking information, the tail point marking information, and/or the false edge marking information, and the vertex v of the triangle fan can be directly stored0，v1，v2，v3，v4… … without repeatedly storing the common vertices of each pair of adjacent triangles therein, and therefore, the data storage capacity can be reduced. When analyzing, the map rendering engine can identify the start and the end of each triangle fan or triangle strip according to the head point mark information and the tail point mark information, analyze the corresponding graph according to the organization rule of the triangle fan or triangle strip, and can analyze the corresponding graph according to the organization rule of the triangle fan or triangle stripAnd the edge which does not need to be displayed is not rendered or rendered to be transparent according to the false edge marking information, so that the graphic rendering quality is ensured.
Fig. 5 is a schematic flowchart of a method for creating a three-dimensional map object according to another embodiment of the present application, and referring to fig. 5, the method of the present embodiment includes:
in step 501, a first vertex index is generated according to vertices of a plurality of adjacent triangles of a first set of triangles in the map object surface mesh, and a second vertex index is generated according to vertices of a plurality of adjacent triangles of a second set of triangles in the map object surface mesh.
In this embodiment, the first vertex index includes head point mark information, tail point mark information, and false edge mark information of the first group of triangles, and the second vertex index includes head point mark information, tail point mark information, and false edge mark information of the second group of triangles.
In this embodiment, the first group of triangles, the second group of triangles, the first vertex index, the second vertex index, the head point marking information, the tail point marking information, and the false edge marking information may refer to the related contents in the previous embodiment, and are not described again.
In step 502, the first vertex index and the second vertex index are combined.
In this application, combining the first vertex index and the second vertex index may be directly connecting the two vertex indexes together, or may be connecting the two vertex indexes together after vertex removal according to a preset rule.
In one embodiment, a plurality of adjacent triangles of the first set of triangles collectively form a triangle fan, and the number of adjacent triangles is n1, and the common vertex of each triangle is v0The three vertexes of the ith triangle are (v)0，vi，vi+1) (ii) a A plurality of adjacent triangles of the second group of triangles form a triangle fan together, the number of the adjacent triangles is n2, and the common vertex of each triangle is vn1+1When j is 1, the three vertices of the jth triangle are (v)n1+1，v0，vn1+j) When j is>1, three vertices of the jth triangleIs (v)n1+1，vn1+j，vn1+j+1) And side (v)0，vn1+1) Is a common side of the first set of triangles and the second set of triangles. The vertex index that combines the first vertex index of the first set of triangles and the second vertex index of the second set of triangles may be (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information. It can be seen that in the present embodiment, the other vertex v in the common edges of the first and second sets of triangles is removed from the second vertex index when the combination is performed0Thus, the data amount can be further reduced.
For example, in FIG. 6, the first vertex index of the first set of triangles T1, T2, T3 is (v)0(head-to-tail FLAG: 1), v1，v2，v3，v4(end-to-end FLAG: 2, false edge FLAG: 1)), the second vertex indices of the vertices T4, T5, T6 of the second set of triangles are (v4 (end-to-end FLAG: 1, false edge FLAG: 1), v40，v5，v6，v7(head-to-tail FLAG: 2)), the vertex index obtained by combining the first vertex index and the second vertex index is (v)0(head-to-tail FLAG: 1), v1，v2，v3，v4(head-to-tail FLAG: 2, false edge FLAG: 1), v4(head-to-tail FLAG: 1, false edge FLAG: 1), v5，v6，v7(head-to-tail FLAG: 2)).
In another embodiment, a plurality of adjacent triangles of the first set of triangles collectively form a triangle strip, and the number of adjacent triangles is n1, and when i is odd, the three vertices of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1) (ii) a A plurality of adjacent triangles of the second set of triangles form a triangle strip together, the number of the adjacent triangles is n2, and when j is odd, three vertexes of the jth triangle are (v)n1+j-1，vn1+j，vn1+j+1) When j is an even number, the three vertices of the jth triangle are (v)n1+j，vn1+j-1，vn1+j+1) And side (v)n1，vn1+1) Is a common edge of the first set of triangles and the second set of triangles, and the vertex index combining the first vertex index of the first set of triangles and the second vertex index of the second set of triangles may be (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
In step 503, a three-dimensional model of the map object is built according to the combined vertex index and the three-dimensional coordinates corresponding to the vertices therein.
It is to be understood that, in some other embodiments, instead of generating the first vertex index and the second vertex index and then combining them to generate the vertex indexes of the first triangle group and the second triangle group, the combined vertex indexes may be directly generated according to the vertices of the first triangle group and the vertices of the second triangle group.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
FIG. 7 is a schematic diagram illustrating a computing device according to an exemplary embodiment of the present application.
Referring to fig. 7, computing device 700 includes memory 710 and processor 720.
Processor 720 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 710 may include various types of storage units, such as system memory, Read Only Memory (ROM), and permanent storage. Wherein the ROM may store static data or instructions that are required by processor 720 or other modules of the computer. The persistent storage device may be a read-write storage device. The persistent storage may be a non-volatile storage device that does not lose stored instructions and data even after the computer is powered off. In some embodiments, the persistent storage device employs a mass storage device (e.g., magnetic or optical disk, flash memory) as the persistent storage device. In other embodiments, the permanent storage may be a removable storage device (e.g., floppy disk, optical drive). The system memory may be a read-write memory device or a volatile read-write memory device, such as a dynamic random access memory. The system memory may store instructions and data that some or all of the processors require at runtime. In addition, the memory 710 may include any combination of computer-readable storage media, including various types of semiconductor memory chips (DRAM, SRAM, SDRAM, flash memory, programmable read-only memory), magnetic and/or optical disks, may also be employed. In some embodiments, memory 710 may include a removable storage device that is readable and/or writable, such as a Compact Disc (CD), a digital versatile disc read only (e.g., DVD-ROM, dual layer DVD-ROM), a Blu-ray disc read only, an ultra-dense disc, a flash memory card (e.g., SD card, min SD card, Micro-SD card, etc.), a magnetic floppy disk, or the like. Computer-readable storage media do not contain carrier waves or transitory electronic signals transmitted by wireless or wired means.
The memory 710 has stored thereon executable code that, when processed by the processor 1020, may cause the processor 720 to perform some or all of the methods described above.
The aspects of the present application have been described in detail hereinabove with reference to the accompanying drawings. In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments. Those skilled in the art should also appreciate that the acts and modules referred to in the specification are not necessarily required in the present application. In addition, it can be understood that the steps in the method of the embodiment of the present application may be sequentially adjusted, combined, and deleted according to actual needs, and the modules in the device of the embodiment of the present application may be combined, divided, and deleted according to actual needs.
Furthermore, the method according to the present application may also be implemented as a computer program or computer program product comprising computer program code instructions for performing some or all of the steps of the above-described method of the present application.
Alternatively, the present application may also be embodied as a non-transitory machine-readable storage medium (or computer-readable storage medium, or machine-readable storage medium) having stored thereon executable code (or a computer program, or computer instruction code) which, when executed by a processor of an electronic device (or computing device, server, etc.), causes the processor to perform some or all of the various steps of the above-described method according to the present application.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems and methods according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Having described embodiments of the present application, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (10)

1. A method of building a three-dimensional model of a map object, comprising:
generating a vertex index according to the vertexes of a plurality of adjacent triangles of a first group of triangles and the vertexes of a plurality of adjacent triangles of a second group of triangles in the map object surface mesh, wherein the second group of triangles is adjacent to the first group of triangles, and the vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the first group of triangles and head point marking information, tail point marking information and/or false edge marking information of the second group of triangles;
and establishing a three-dimensional model of the map object according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index.
2. The method of claim 1, wherein:
generating the vertex index according to the vertices of the plurality of adjacent triangles of the first set of triangles and the vertices of the plurality of adjacent triangles of the second set of triangles in the map object surface mesh comprises:
generating a first vertex index according to vertexes of a plurality of adjacent triangles of a first group of triangles in a map object surface mesh, and generating a second vertex index according to vertexes of a plurality of adjacent triangles of a second group of triangles in the map object surface mesh, wherein the first vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the first group of triangles, and the second vertex index comprises head point marking information, tail point marking information and/or false edge marking information of the second group of triangles;
establishing a three-dimensional model of the map object according to the vertex index and the three-dimensional coordinates corresponding to each vertex in the vertex index comprises:
and establishing a three-dimensional model of the map object according to the first vertex index, the second vertex index and the three-dimensional coordinates corresponding to the vertexes in the first vertex index and the second vertex index.
3. The method of claim 2, wherein building the three-dimensional model of the map object according to the first vertex index, the second vertex index, and the three-dimensional coordinates corresponding to the vertices in the first vertex index and the second vertex index comprises:
combining the first vertex index and the second vertex index;
and establishing a three-dimensional model of the map object according to the combined vertex index and the three-dimensional coordinates corresponding to the vertexes.
4. A method according to any one of claims 1 to 3, characterized in that: at least one of the first set of triangles and the second set of triangles forms a triangle fan.
5. The method of claim 4, wherein:
a plurality of adjacent triangles of the first group of triangles jointly form a triangle fan, wherein the number of the adjacent triangles is n1, and the common vertex of each triangle is v0The three vertexes of the ith triangle are (v)0，vi，vi+1)；
The vertex indices include a vertex index (v) of the first set of triangles0(a)，v1，……，vn1+1(b, c)) or (v)n1+1(b，c)，……，v1，v0(a) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
6. The method of claim 1, wherein:
a plurality of adjacent triangles of the first group of triangles form a triangle fan together, the number of the adjacent triangles is n1, and the common vertex of each triangle is v0The three vertexes of the ith triangle are (v)0，vi，vi+1)；
A plurality of adjacent triangles of the second group of triangles form a triangle fan together, the number of the adjacent triangles is n2, and the common vertex of each triangle is vn1+1When j is 1, the three vertices of the jth triangle are (v)n1+1，v0，vn1+j) When j is>At 1, the three vertices of the jth triangle are (v)n1+1，vn1+j，vn1+j+1) And side (v)0，vn1+1) Is a common side of the first set of triangles and the second set of triangles;
the vertex indices include a vertex index (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
7. A method according to any one of claims 1 to 3, characterized in that: at least one of the first set of triangles and the second set of triangles forms a triangle strip.
8. The method of claim 7, wherein:
a plurality of adjacent triangles of the first set of triangles collectively form a triangle strip, and whichThe number of adjacent triangles is n1, and when i is odd, the three vertexes of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1)；
The vertex indices include a vertex index (v) of the first set of triangles0(a)，v1，……，vn1+1(b, c)) or (v)n1+1(b，c)，……，v1，v0(a) A is head point marking information, b is tail point marking information, and c is false edge marking information.
9. The method of claim 1, wherein:
a plurality of adjacent triangles of the first group of triangles form a triangle strip together, the number of the adjacent triangles is n1, and when i is an odd number, three vertexes of the ith triangle are (v)i-1，vi，vi+1) When i is an even number, three vertices of the ith triangle are (v)i，vi-1，vi+1)；
A plurality of adjacent triangles of the second group of triangles form a triangle strip together, the number of the adjacent triangles is n2, and when j is an odd number, three vertexes of the jth triangle are (v)n1+j-1，vn1+j，vn1+j+1) When j is an even number, the three vertices of the jth triangle are (v)n1+j，vn1+j-1，vn1+j+1) And side (v)n1，vn1+1) Is a common side of the first set of triangles and the second set of triangles;
the vertex index includes (v)0(a)，v1，……，vn1+1(b，c)，vn1+1(a，c)，vn1+2，……，vn1+n2+1(b) A is the head point mark information, b is the tail point mark information, and c is the false edge mark information.
10. An electronic device, comprising:
a processor; and
a memory having executable code stored thereon, which when executed by the processor, causes the processor to perform the method of any one of claims 1-9.
CN202010594812.9A 2020-06-28 2020-06-28 Method for establishing map object three-dimensional model and electronic equipment Pending CN113847921A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010594812.9A CN113847921A (en) 2020-06-28 2020-06-28 Method for establishing map object three-dimensional model and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010594812.9A CN113847921A (en) 2020-06-28 2020-06-28 Method for establishing map object three-dimensional model and electronic equipment

Publications (1)

Publication Number Publication Date
CN113847921A true CN113847921A (en) 2021-12-28

Family

ID=78972368

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010594812.9A Pending CN113847921A (en) 2020-06-28 2020-06-28 Method for establishing map object three-dimensional model and electronic equipment

Country Status (1)

Country Link
CN (1) CN113847921A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004102763A (en) * 2002-09-11 2004-04-02 Ricoh Co Ltd Data structure of triangular mesh, triangular mesh data generating method and reference method, program, recording medium and system
JP2004326597A (en) * 2003-04-25 2004-11-18 Ricoh Co Ltd Triangular mesh generation system, triangular mesh generation/reference method, program, and storage medium
JP2005056083A (en) * 2003-08-01 2005-03-03 Ricoh Co Ltd N-dimensional geometric model, n-dimensional geometric model storage device and method, n-dimensional geometric model display device and method, n-dimensional geometric model data structure, and n-dimensional geometric model processing system, program, and storage medium therefor
KR101551741B1 (en) * 2015-04-07 2015-09-10 (주)이지스 Method for Configuring Vertex of Three-dimensional Object Model

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004102763A (en) * 2002-09-11 2004-04-02 Ricoh Co Ltd Data structure of triangular mesh, triangular mesh data generating method and reference method, program, recording medium and system
JP2004326597A (en) * 2003-04-25 2004-11-18 Ricoh Co Ltd Triangular mesh generation system, triangular mesh generation/reference method, program, and storage medium
JP2005056083A (en) * 2003-08-01 2005-03-03 Ricoh Co Ltd N-dimensional geometric model, n-dimensional geometric model storage device and method, n-dimensional geometric model display device and method, n-dimensional geometric model data structure, and n-dimensional geometric model processing system, program, and storage medium therefor
KR101551741B1 (en) * 2015-04-07 2015-09-10 (주)이지스 Method for Configuring Vertex of Three-dimensional Object Model

Similar Documents

Publication Publication Date Title
US11922534B2 (en) Tile based computer graphics
US9305392B2 (en) Fine-grained parallel traversal for ray tracing
US8659599B2 (en) System and method for generating a manifold surface for a 3D model of an object using 3D curves of the object
US10176627B2 (en) Tree-based graphics primitive rendering
US8345064B2 (en) Method and system for tile binning using half-plane edge function
US20140168228A1 (en) Fine-grained parallel traversal for ray tracing
JP6001310B2 (en) Method for generating database, navigation device, and method for determining height information
US10740955B2 (en) Systems and methods for real-time large-scale point cloud surface reconstruction
CN112149677A (en) Point cloud semantic segmentation method, device and equipment
US8564589B1 (en) System and method for accelerated ray-box intersection testing
CN113847921A (en) Method for establishing map object three-dimensional model and electronic equipment
US9030915B2 (en) System and method for swath overlap detection
CN115688497B (en) Load graphic element display method and device, electronic equipment and storage medium
US8817042B2 (en) Graphic rendering system and projection method thereof
JP3692460B2 (en) Numerical analysis system using mixed grid type solution adaptive grid method
US10977861B1 (en) Inferring quality in point cloud-based three-dimensional objects using topographical data analysis
KR20200058205A (en) Automated symbolization of 1:25,000 map based on domestic geometric characteristic
US20230118972A1 (en) Scalable parallel construction of bounding volume hierarchies
US20240104845A1 (en) Mesh topology generation using parallel processing
CN117494289B (en) Feature edge geometry generation method and device, and measurement adsorption method and device
CN113888671B (en) Map road rendering method, device, equipment and storage medium
CN113553009B (en) Data reading method, data writing method and data reading and writing method
US20240104847A1 (en) Techniques for parallel edge decimation of a mesh
CN115115739A (en) Data processing method and equipment and information display method
CN116005583A (en) Zebra stripes generation method, device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination