CN106326255B - A kind of pel laminated cutting method and device - Google Patents

A kind of pel laminated cutting method and device Download PDF

Info

Publication number
CN106326255B
CN106326255B CN201510359216.1A CN201510359216A CN106326255B CN 106326255 B CN106326255 B CN 106326255B CN 201510359216 A CN201510359216 A CN 201510359216A CN 106326255 B CN106326255 B CN 106326255B
Authority
CN
China
Prior art keywords
cutting
level
cut
unit
primitive
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.)
Expired - Fee Related
Application number
CN201510359216.1A
Other languages
Chinese (zh)
Other versions
CN106326255A (en
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.)
Alibaba China Co Ltd
Original Assignee
Autonavi Software 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 Autonavi Software Co Ltd filed Critical Autonavi Software Co Ltd
Priority to CN201510359216.1A priority Critical patent/CN106326255B/en
Publication of CN106326255A publication Critical patent/CN106326255A/en
Application granted granted Critical
Publication of CN106326255B publication Critical patent/CN106326255B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Remote Sensing (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Medical Treatment And Welfare Office Work (AREA)
  • Complex Calculations (AREA)

Abstract

The embodiment of the invention discloses a kind of pel laminated cutting methods, which comprises obtains the original vector data of a pel；Judge whether the quantity of level to be cut is greater than or equal to two, if it is, the sequence according to level to be cut from high to low, is cut into the member of the subgraph in corresponding level for pel.The embodiment of the invention also discloses a kind of pel Slice by slice cutting devices.The present invention realizes the purpose for improving pel cutting efficiency.

Description

Primitive layered cutting method and device
Technical Field
The invention relates to the field of electronic maps, in particular to a primitive layered cutting method and a primitive layered cutting device.
Background
An Electronic Map (Electronic Map) is a Map that is digitally stored and referred to using computer technology. The primitives (features) are basic units forming the electronic map and comprise point primitives, linear primitives and planar primitives. An electronic map often includes many planar primitives representing real buildings, water areas, greenbelts, administrative areas, etc., and each primitive has corresponding space vector data.
When an electronic map is produced, the raw space vector data of the primitives needs to be organized according to a cutting level (which can also be understood as a scale or a display level) of the electronic map. The process of data organization refers to the conversion of vector data from an original data format to a target data format, for example, from an original shape data file to an oracle data file. In the process of data organization, the vector data corresponding to the graphic primitive is generally cut according to the grid corresponding to each cutting level, so as to improve the storage efficiency. In addition, during data access and query, each graphic element is cut into the corresponding grid, so that only the grid corresponding to the needed graphic element needs to be loaded, and the efficiency of data access and query can be improved to a great extent. Therefore, for the manufacture of an electronic map, primitive hierarchical cutting is very important for the storage, access and query of vector data of primitives, and in practical application, because data with different precisions is needed, multi-level cutting can be performed on the same primitive, the grid sizes of the same cutting level are all consistent, the higher the level is, the larger the grid is, the smaller the number of grids is, and conversely, the lower the level is, the smaller the grid is, and the more the data of the grids is.
In the prior art, the primitive is cut based on the original vector data of the primitive, the original vector data of the primitive and the space calculation process of the grid are time-consuming in the cutting process, when the area of the primitive is large, namely the vector data of the primitive is large, the cutting efficiency is low, particularly when the low-layer cutting with large grid number and small grid size is carried out, the cutting needs to take a long time, and the cutting speed is very slow.
Disclosure of Invention
In order to solve the technical defects of slow cutting speed and low efficiency caused by cutting the primitive based on the original vector data of the primitive in the prior art, the invention provides a primitive layered cutting method and a primitive layered cutting device, and the purpose of improving the primitive cutting efficiency is achieved.
The embodiment of the invention provides a primitive layered cutting method, which comprises the following steps:
acquiring original vector data of a primitive;
judging whether the number of the layers to be cut is more than or equal to two, if so, cutting the graphic primitives into sub-graphic primitives in the corresponding layers according to the sequence from high to low of the layers to be cut, and specifically comprising the following steps of:
taking the original vector data of the primitive as input data of the highest cutting level, and performing spatial topology calculation according to a preset grid corresponding to the highest cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
and in other layers to be cut except the highest cutting layer, taking the vector data of the sub-primitives corresponding to the cut layer as the input data of the current layer to be cut, and performing spatial topology calculation according to a preset grid corresponding to the current layer to be cut so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current layer to be cut.
Preferably, when the number of the to-be-cut levels is less than two, the to-be-cut level is used as a target cut level, and the method further comprises:
and taking the original vector data of the primitive as input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level.
Preferably, each layer to be cut corresponds to a number, the higher the layer is, the smaller the number is, and the step of cutting the primitive into sub-primitives in the corresponding layer according to the sequence from high to low of the layer to be cut specifically includes:
and cutting the graphic elements into sub-graphic elements corresponding to the to-be-cut levels according to the sequence of the serial numbers of the to-be-cut levels from small to large.
Preferably, when the number of the to-be-cut levels is judged to be less than two, the method further comprises:
judging whether the number of a target cutting level is smaller than a preset number threshold value or not, if not, executing the step of taking the original vector data of the primitive as the input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level;
if so, taking the original vector data of the primitive as input data of a first cutting level, and performing spatial topology calculation according to a preset grid corresponding to the cutting level to cut the primitive into a plurality of sub-primitives corresponding to the first cutting level, wherein the number of the first cutting level is equal to a preset number threshold minus n, n is a preset number adjustment factor, and n is a natural number which is greater than or equal to 1 and smaller than the preset number threshold;
and taking a plurality of sub-primitives corresponding to the first cutting level as input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the plurality of sub-primitives corresponding to the first cutting level into a plurality of sub-primitives corresponding to the target cutting level.
Preferably, in the other to-be-cut levels except for the highest cutting level, taking vector data of sub-primitives corresponding to the cut level as input data of the current to-be-cut level, and performing spatial topology calculation according to a preset grid corresponding to the current to-be-cut level, so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current to-be-cut level includes:
judging whether the number of the current cutting level and the number of the cutting level during the previous cutting are continuous numbers, if not, judging whether the number of the current cutting level is larger than a preset number threshold, if not, taking the vector data of the sub-primitive corresponding to the cutting level during the previous cutting as the input data of the current cutting level, and performing spatial topology calculation according to a preset grid corresponding to the current cutting level so as to cut the sub-primitive corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level.
Preferably, when the number of the current cutting level is not a consecutive number with the number of the cutting level at the previous cutting and the number of the current cutting level is greater than the preset number threshold, if the number of the cutting level at the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers and j-i > 1, the method further comprises:
step 1: taking the vector data of the sub-primitive corresponding to the cutting level with the number of i as the input data of the cutting level with the number of i +1 to perform spatial topology calculation so as to cut the sub-primitive into a grid corresponding to the cutting level with the number of i + 1;
step 2: and judging whether i +1 is smaller than j, if so, i is equal to i +1, returning to execute the step 1, and if not, ending the step.
Preferably, if one type of primitive corresponds to a preset number threshold, before determining whether the number of the current cut level is greater than the preset number threshold, the method further includes:
and acquiring a preset numbering threshold corresponding to the type of the primitive.
The embodiment of the invention also provides a primitive layered cutting device, which comprises: the cutting device comprises an acquisition unit, a first judgment unit and a cutting unit, wherein the acquisition unit is connected with the first judgment unit, and the first judgment unit is connected with the cutting unit;
the acquiring unit is used for acquiring original vector data of a primitive;
the first judging unit is used for judging whether the number of the layers to be cut is more than or equal to two, and if so, the cutting unit is activated;
the cutting unit is used for cutting the graphic primitives into sub-graphic primitives in corresponding levels according to the order of the levels to be cut from high to low;
wherein the cutting unit includes: a first cutting unit and a second cutting unit;
the first cutting unit is used for taking the original vector data of the primitive as input data of a highest cutting level, and performing spatial topology calculation according to a preset grid corresponding to the highest cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
and the second cutting unit is used for cutting other layers to be cut except the highest cutting layer, taking the vector data of the sub-primitives corresponding to the cut layer as the input data of the current layer to be cut, and performing spatial topology calculation according to a preset grid corresponding to the current layer to be cut so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current layer to be cut.
Preferably, the device further comprises a third cutting unit connected with the first judging unit;
the first judging unit is further configured to take the to-be-cut hierarchy as a target cutting hierarchy and activate the third cutting unit when it is judged that the number of the to-be-cut hierarchies is less than two;
and the third cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting hierarchy by using the original vector data of the primitive as input data of the target cutting hierarchy, so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting hierarchy.
Preferably, each layer to be cut corresponds to a number, and the higher the layer is, the smaller the number is; the cutting unit is configured to cut the primitive into sub-primitives in corresponding levels according to a sequence from a high level to a low level of a level to be cut, and specifically includes:
and the cutting unit is used for cutting the graphic primitives into the sub-graphic primitives corresponding to the to-be-cut hierarchy according to the sequence that the serial numbers of the to-be-cut hierarchies are from small to large.
Preferably, the apparatus further comprises: the cutting device comprises a first judging unit, a second judging unit, a fourth cutting unit and a fifth cutting unit, wherein the first judging unit is connected with the second judging unit, the second judging unit is connected with the third cutting unit and the fourth cutting unit, and the fourth cutting unit is connected with the fifth cutting unit;
the first judging unit is further configured to activate the second judging unit when the number of the to-be-cut tiers is judged to be less than two;
the second judging unit is used for judging whether the number of the target cutting level is larger than a preset number threshold value or not, and if not, the third cutting unit is activated; if so, activating the fourth cutting unit;
the fourth cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the cutting level by using the original vector data of the primitive as input data of the first cutting level, so as to cut the primitive into a plurality of sub-primitives corresponding to the first cutting level, and then activate the fifth cutting unit; the number of the first cutting level is equal to a preset number threshold minus n, n is a preset number adjustment factor, and n is a natural number which is greater than or equal to 1 and smaller than the preset number threshold;
the fifth cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting level by using a plurality of sub-primitives corresponding to the first cutting level as input data of the target cutting level, so as to cut the plurality of sub-primitives corresponding to the first cutting level into a plurality of sub-primitives corresponding to the target cutting level.
Preferably, the second cutting unit comprises a third judging unit, a fourth judging unit and a sixth cutting unit, the first cutting unit is connected with the third judging unit, the third judging unit is connected with the fourth judging unit, and the fourth judging unit is connected with the sixth cutting unit;
the third judging unit is used for judging whether the serial number of the current cutting level and the serial number of the cutting level during the previous cutting are continuous serial numbers or not, and if not, the fourth judging unit is activated;
the fourth judging unit is used for judging whether the number of the current cutting level is larger than a preset number threshold value or not, and if not, the sixth cutting unit is activated;
and the sixth cutting unit is used for taking the vector data of the sub-primitives corresponding to the cutting level during the previous cutting as the input data of the current cutting level, and performing spatial topology calculation according to a preset grid corresponding to the current cutting level so as to cut the sub-primitives corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level.
Preferably, the number of the cutting level during the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers, and j-i is greater than 1;
the second cutting unit further includes: the fourth judging unit is connected with the seventh cutting unit, and the seventh cutting unit is connected with the fifth judging unit;
the fourth judging unit is further configured to activate the seventh cutting unit when the number of the current cutting level is greater than a preset number threshold;
the seventh cutting unit is configured to perform spatial topology calculation by using vector data of a sub-primitive corresponding to the cutting level numbered i as input data of the cutting level numbered i +1, so as to cut the sub-primitive into a grid corresponding to the cutting level numbered i + 1;
the fifth judging unit is configured to judge whether i +1 is smaller than j, if so, i +1, and activate the seventh cutting unit; if not, the process ends.
Preferably, one type of primitive corresponds to a preset numbering threshold;
the device further comprises: and the number threshold acquisition unit is connected with the fourth judgment unit and is used for acquiring a preset number threshold corresponding to the type of the primitive.
Compared with the prior art, the invention has the advantages that:
in the invention, the primitive vector data of the primitive is used as the input data of the highest cutting level to cut the primitive of the highest cutting level, the sub-primitive vector data corresponding to the cut level is used as the input data of the current cutting level to cut the primitive of the current cutting level except the highest cutting level, and compared with the prior art, the area of the primitive subjected to single spatial topology calculation is reduced, so that the efficiency of the spatial topology calculation is improved, and the cutting speed and efficiency of the primitive are improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flowchart of a first embodiment of a method for slicing primitives according to the present invention;
FIG. 2 is a schematic diagram of an original primitive in a primitive segmentation method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a layer 1 primitive in a first embodiment of a method for slicing primitives provided by the present invention;
FIG. 4 is a schematic diagram of a layer 2 primitive in a first embodiment of the primitive layering and cutting method provided in the present invention;
FIG. 5 is a flowchart of a second embodiment of a method for slicing primitives according to the present invention;
FIG. 6 is a flowchart of a third embodiment of a primitive segmentation method according to the present invention;
FIG. 7 is a block diagram illustrating a first embodiment of a primitive segmentation apparatus according to the present invention;
fig. 8 is a block diagram of a second embodiment of a primitive layering and cutting apparatus provided in the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The first embodiment of the method comprises the following steps:
referring to fig. 1, the figure is a flowchart of a primitive layering and cutting method according to a first embodiment of the present invention.
The method for cutting the primitive in layers provided by the embodiment comprises the following steps:
step S101: original vector data of a primitive is obtained.
Step S102: and judging whether the number of the layers to be cut is more than or equal to two, if so, executing the step S103.
Step S103: and cutting the primitives into sub-primitives in the corresponding levels according to the sequence of the levels to be cut from high to low.
In this embodiment, the cutting the primitive into sub-primitives in corresponding hierarchies according to the sequence from the highest to the lowest of the hierarchy to be cut specifically includes:
taking the original vector data of the primitive as input data of the highest cutting level, and performing spatial topology calculation according to a preset grid corresponding to the highest cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
and in other layers to be cut except the highest cutting layer, taking the vector data of the sub-primitives corresponding to the cut layer as the input data of the current layer to be cut, and performing spatial topology calculation according to a preset grid corresponding to the current layer to be cut so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current layer to be cut.
In practical application, because data with different precisions are needed, the original primitive can be cut into multiple levels according to the cutting levels. Each cutting level corresponds to grids with different sizes and quantities, the larger the scale corresponding to the cutting level is, the higher the level of the cutting level is, the larger the grid is, the smaller the number of the grids is, and the lower the precision is; conversely, the smaller the scale corresponding to the hierarchy is, the lower the hierarchy is, the smaller the grid is, the more data of the grid is, and the higher the precision is. The shape, size and number of the grids are not particularly limited.
It should be noted that the highest cutting level may be a highest cutting level among the levels to be cut, or may be a level expanded according to a highest cutting level among actually set cutting levels, or a preset fixed cutting level, and the invention is not limited in particular. For example, assuming that the to-be-cut level is the 7 th, 9 th and 10 th levels, the highest cutting level may be the 7 th level which is the highest level among the three cutting levels, or the 6 th level (expanded level) which is higher than the 7 th level, or the 4 th level which is a preset fixed cutting level. In practical applications, whether to perform the level expansion depends on the type of the primitive. If the highest cutting level is a preset fixed cutting level, it is required to ensure that the levels to be cut are all lower than the preset fixed cutting level.
The cut level may be the highest cut level or a level obtained by cutting based on the highest cut level. For example, assuming that the levels to be cut are 7 th, 9 th and 10 th levels, and the highest cutting level is 7 th level, the 9 th level should be cut by using the vector data of the sub-primitive of the 7 th level as input data, and the 10 th level may be cut by using the vector data of the sub-primitive of the 7 th level of the highest cutting level as input data, or by using the vector data of the cut sub-primitive of the 9 th level as input data.
In the prior art, the primitive is cut based on the original vector data of the primitive, and because the process of calculating the space topology of the grid according to the original vector data of the primitive is time-consuming in the cutting process, when the area of the primitive is large, namely the vector data amount of the primitive is large, the cutting efficiency is low, and particularly when the low-layer cutting with large grid number and small grid size is performed, the cutting needs to take a long time, and the cutting speed is very slow.
For example, fig. 2 shows an original primitive X, and the corresponding vector data is original vector data. FIG. 3 shows the primitive of level 1 after being sliced according to the original vector data of the primitive X in FIG. 2, where the number of grids is 22Each grid is square with a side length dimension of 1 km. As can be seen from fig. 3, the original primitive X and the grid A, B, C, D both have a spatial topological relationship, where the spatial topological relationship refers to a relationship that the grid and the primitive have an inclusion or intersection, where the inclusion refers to a relationship that the primitive all falls within a range of the grid, and the intersection refers to a relationship that the primitive partially falls within a range of the grid. Performing spatial topology calculation on the original primitive X and the grid A to obtain a sub-primitive b segmented in the grid A; performing spatial topology calculation on the original primitive X and the grid B to obtain a sub-primitive c segmented in the grid B; performing spatial topology calculation on the original primitive X and the grid C to obtain sub-primitives a, e and f segmented in the grid C; and carrying out space topology calculation on the original primitive X and the grid D to obtain a sub-primitive D segmented in the grid D.
FIG. 4 is a layer 2 primitive sliced according to the original vector data of the original primitive X in FIG. 2, where the number of meshes is (2)2)2Each grid is square with a side length of 0.5 km. As can be seen from fig. 4, the original primitive X is associated with meshes 2, 5, 6, 7, 10, 11, 14 and15 all have a spatial topological relationship. And respectively carrying out spatial topology calculation on the original primitive X and the grids 2, 5, 6, 7, 10, 11, 14 and 15 to obtain correspondingly segmented sub-primitives a, b, c, d, e and f, g, h and i. Because the layer 2 grid is a spatial topology calculation according to the primitive X of the initial layer, when the area of the primitive X is large and the grid is small, the time consumed for performing the spatial topology calculation is long, which results in a slow cutting speed of the whole layer.
In the embodiment, the primitive vector data of the primitive is used as the input data of the highest cutting level to cut the primitive of the highest cutting level, the sub-primitive vector data corresponding to the cut level is used as the input data of the current cutting level to cut the primitive of the current cutting level except the highest cutting level, and compared with the prior art, the area of the primitive subjected to single spatial topology calculation is reduced, so that the efficiency of the spatial topology calculation is improved, and the cutting speed and efficiency of the primitive are improved.
Taking the above example as an example, in the present embodiment, the levels to be cut are level 1 and level 2. The highest cutting level is the level 1, and the level 1 takes the original vector data of the original graphic element X as input data, and performs spatial topology calculation according to a 2 × 2 grid to obtain sub-graphic elements a, b, c, d, e, and f. And when the 2 nd level is cut, taking the vector data of each sub-primitive of the 1 st level of the highest cutting level as input, and carrying out spatial topology calculation according to a 4 multiplied by 4 grid. For example, using the vector data of the primitive d in fig. 3 as input data, and after being queried, the grids having a topological relationship with the primitive d are the grids 11 and 15 in fig. 4, the primitive d in fig. 3 is cut into the primitive g in fig. 4 corresponding to the grid 11 and the primitive i corresponding to the grid 15. For another example, the vector data of the primitive b in fig. 3 is used as input data, and after being queried, it is determined that the grids having the topological relationship with the primitive b are the grids 2, 5, and 6 in fig. 4, so that the primitive b in fig. 3 is cut into sub-primitive elements a, b, and c in fig. 4 corresponding to the grids 2, 5, and 6, respectively. Because the cutting of the graphics primitives of the 2 nd level is based on the cut graphics primitives of the 1 st level, the efficiency of each graphics primitive is greatly improved when the spatial topology calculation is carried out, and the cutting efficiency of the graphics primitives of the 2 nd level is greatly improved.
In addition, in the process of querying the grid having the topological relation with the primitive, the spatial index tree can be used for querying. After the size and the number of grids corresponding to a certain level are determined, the spatial range of each grid can be determined according to the spatial range of the current cutting level, and therefore a spatial index tree is constructed according to the spatial range of each grid. The spatial index tree is a data structure arranged in a certain order according to the position and shape of the spatial object or a certain spatial relationship between the spatial objects, and includes summary information of the spatial objects, such as an identifier of the object, a circumscribed rectangle, and a pointer pointing to an entity of the spatial object. In this embodiment, the spatial index tree is a data structure arranged according to a certain order according to the spatial range of each grid corresponding to the cutting hierarchy, and includes the name, the attribute, the circumscribed rectangle, and the pointer pointing to the next node of the primitive in the cutting hierarchy.
Common spatial index trees include BSP trees, K-D-B trees, hB trees, R + trees, CELL trees, etc., and the present invention is not limited specifically. In this embodiment, the spatial index tree is an R tree (also called a grid index), the R tree is an n-ary tree, and n is called a fan of the R tree. For an R-tree of order M, the node structure can be described as follows:
leaf node: (the sum, LEVEL,<OI1,MBR1>,<OI2,MBR2>，…，<OIM,MBRM>)
an intermediate node: (the sum, LEVEL,<CP1,MBR1>,<CP2,MBR2>，…，<CPM,MBRM>)
wherein,<OI1,MBR1>called data item, OIiIdentification of spatial objects, MBRiMinimum bounding in k-dimensional space for the objectRectangles (data rectangles for short);<CPi,MBRi>referred to as indexing item, CPiFor pointers to subtree root nodes, MBRiRepresenting its subtree index space as the smallest bounding rectangle (directory rectangle for short) that bounds all directory rectangles or data rectangles in its subtree root node. COUNT indicates the number of index or data items used in a node (i.e., the number of "children" of the node), which is less than or equal to M; LEVEL indicates the number of LEVELs in the tree for the node, which is greater than or equal to the leaf nodes.
Method embodiment two
Referring to fig. 5, the figure is a flowchart of a second embodiment of the primitive layering and cutting method provided by the present invention.
The method for cutting the primitive in layers provided by the embodiment comprises the following steps:
step S201: original vector data of a primitive is obtained.
Step S202: judging whether the number of the layers to be cut is more than or equal to two, if so, executing the step S203; if not, step S204 is performed.
Step S203: and cutting the primitives into sub-primitives in the corresponding levels according to the sequence of the levels to be cut from high to low.
In practical application, each layer to be cut corresponds to a number, the higher the layer is, the smaller the number is, the number corresponding to each layer is unique, and the numbers of the layers are not repeated.
When the number of the to-be-cut levels is greater than or equal to two, the step of cutting the primitive into sub-primitives in corresponding levels according to the sequence from high to low of the cut levels specifically comprises the following steps: and cutting the primitives into sub-primitives in the corresponding levels according to the sequence of the numbers of the cutting levels from small to large.
Step S204: judging whether the number of the target cutting level is smaller than a preset number threshold value, if not, executing the step S205; if so, step S206 is performed.
Step S205: and taking the original vector data of the primitive as input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level.
In practical application, when the number of the to-be-cut levels is judged to be less than two, namely only one to-be-cut level is obtained, the original vector data can be directly used as input data to cut the target cutting level.
In this embodiment, in order to improve the cutting efficiency of a primitive having only one layer to be cut, a preset numbering threshold is set, and only when the number of the target cutting layer is smaller than the preset numbering threshold, that is, the level of the target cutting layer is higher than the level of the layer corresponding to the preset numbering threshold, the original vector data is directly used as the input data of the target cutting layer; and when the number of the target cutting level is greater than or equal to the preset number threshold, that is, the level of the target cutting level is lower than or equal to the level corresponding to the preset number threshold, performing step S206 and step S207.
Step S206: and performing spatial topology calculation by using the original vector data of the primitive as input data of the first cutting level and a preset grid corresponding to the cutting level to cut the primitive into a plurality of sub-primitives corresponding to the first cutting level, and then executing step S207.
Wherein the number of the first cutting level is equal to a preset number threshold minus n, where n is a preset number adjustment factor. And n is greater than or equal to 1 and is less than the natural number of the preset numbering threshold.
Step S207: and performing spatial topology calculation by taking the sub-primitives corresponding to the first cutting level as input data of the target cutting level and a preset grid corresponding to the target cutting level, so as to cut the sub-primitives corresponding to the first cutting level into the sub-primitives corresponding to the target cutting level.
In this embodiment, when the number of the target cutting levels is one, it is determined whether the number of the target cutting levels is greater than a preset number threshold, and if so, a first cutting level with a higher level is cut first, and then the target cutting level is cut based on the first cutting level, so that the cutting efficiency of the target cutting level is improved.
Method embodiment three
Referring to fig. 6, the figure is a flowchart of a third embodiment of the primitive layering and cutting method provided by the present invention.
The method for cutting the primitive in layers provided by the embodiment comprises the following steps:
step S301: original vector data of a primitive is obtained.
Step S302: judging whether the number of the layers to be cut is more than or equal to two, if so, executing the step S303; if not, step S310 is performed.
Step S303: taking the original vector data of the primitive as input data of a highest cutting level, performing spatial topology calculation according to a preset grid corresponding to the highest cutting level to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level, and then executing step S304.
Step S304: it is determined whether the number of the current cutting level and the number of the cutting level at the previous cutting are consecutive numbers, and if not, step S305 is executed.
Step S305: judging whether the number of the current cutting level is larger than a preset number threshold value, if not, executing the step S306; if so, step S307 is executed.
In this embodiment, all types of primitives correspond to a preset numbering threshold, and in practical applications, one type of primitive may correspond to a preset numbering threshold, that is, different types of primitives may correspond to different preset numbering thresholds, so that the preset numbering threshold corresponding to the type of primitive also needs to be obtained before the step S306 is executed.
Step S306: and taking the vector data of the sub-primitives corresponding to the cutting level during the previous cutting as input data of the current cutting level, and performing spatial topology calculation according to a preset grid corresponding to the current cutting level so as to cut the sub-primitives corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level, and ending the process.
Step S307: if the number of the cutting level during the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers, and j-i is larger than 1, the vector data of the sub-primitive corresponding to the cutting level with the number of i is used as the input data of the cutting level with the number of i +1 to perform spatial topology calculation, so that the sub-primitive is cut into the grid corresponding to the cutting level with the number of i + 1.
Step S308: judging whether i +1 is smaller than j, if so, executing step S309; if not, the process ends.
Step S309: i +1, and returning to execute the step S307;
step S310: and taking the original vector data of the primitive as input data of the target cutting level, performing spatial topology calculation according to a preset grid corresponding to the target cutting level, so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level, and ending the process.
In this embodiment, when the number of the current cut level is not a consecutive number with the number of the previous cut level, and the number of the current cut level is greater than the preset number threshold, the vector data of the sub-primitive of the previous cut level is used as the input data of the current cut level to cut the current cut level; when the number of the current cutting level is smaller than or equal to the preset number threshold, the cutting level cut at the previous time is taken as the initial level to be cut step by step until the current cutting level is cut, and the cutting efficiency of the current cutting level is improved.
It should be noted that if the segmentation is performed stage by stage, the vector data corresponding to the primitive of the segmentation level between the cutting level of the previous segmentation and the current cutting level may be stored in the buffer for the next segmentation level if the segmentation level is not the level that needs to be displayed, and the buffer may be emptied after the current cutting level is completely cut, so as to release the space and avoid continuously occupying the system memory.
Based on the vector layer cutting method provided by the above embodiment, the embodiment of the invention also provides a primitive layered cutting device, and the working principle of the primitive layered cutting device is explained in detail below by combining with the attached drawings.
The first embodiment of the device:
referring to fig. 7, the figure is a block diagram of a first embodiment of a primitive layering and cutting device provided in the present invention.
The primitive layering cutting device that this embodiment provided includes: the cutting device comprises an acquisition unit 101, a first judgment unit 201 and a cutting unit 301, wherein the acquisition unit 101 is connected with the first judgment unit 201, and the first judgment unit 201 is connected with the cutting unit 301;
the acquiring unit 101 is configured to acquire original vector data of a primitive;
the first judging unit 201 is configured to judge whether the number of layers to be cut is greater than or equal to two, and if so, activate the cutting unit 301;
the cutting unit 301 is configured to cut the primitive into sub-primitives in corresponding hierarchies according to a sequence from a high hierarchy to a low hierarchy to be cut;
wherein the cutting unit 301 comprises: a first cutting unit 302 and a second cutting unit 303;
the first cutting unit 302 is configured to perform spatial topology calculation according to a preset grid corresponding to a highest cutting level by using the original vector data of the primitive as input data of the highest cutting level, so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
the second cutting unit 303 is configured to perform spatial topology calculation according to a preset grid corresponding to the current level to be cut, by using vector data of sub-primitives corresponding to a cut level as input data of the current level to be cut, so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current level to be cut.
In this embodiment, the primitive of the highest cutting level is cut by using the original vector data of the primitive as input data of the highest cutting level, and the primitive of the current cutting level is cut by using sub-primitive vector data corresponding to the cut level as input data of the current cutting level except for the highest cutting level.
Device embodiment II
Referring to fig. 7, the figure is a block diagram of a second embodiment of the primitive layering and cutting device provided in the present invention.
On the basis of the first embodiment of the apparatus, the apparatus further includes a third cutting unit 304 connected to the first determining unit 201;
the first determining unit 201 is further configured to, when it is determined that the number of the to-be-cut levels is less than two, take the to-be-cut level as a target cutting level, and activate the third cutting unit 406;
the third cutting unit 304 is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting hierarchy by using the original vector data of the primitive as input data of the target cutting hierarchy, so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting hierarchy.
In practical application, each layer to be cut may correspond to a number, and the number is smaller when the layer is higher.
Then, the cutting unit 301 is configured to cut the primitive into sub-primitives in corresponding hierarchies according to a sequence from a high hierarchy to a low hierarchy to be cut, and specifically includes:
the cutting unit 301 is configured to cut the primitive into sub-primitives corresponding to the to-be-cut hierarchy according to a sequence that the serial numbers of the to-be-cut hierarchies are from small to large.
In this implementation, when the number of the to-be-cut levels is one, the original vector data is directly used as the to-be-cut level for cutting.
In practical applications, in order to improve the cutting efficiency of the to-be-cut level when the number of to-be-cut levels is one, the apparatus further includes: a second judging unit 202, a fourth cutting unit 305 and a fifth cutting unit 306, wherein the first judging unit 201 is connected with the second judging unit 202, the second judging unit 202 is connected with the third cutting unit 304 and the fourth cutting unit 305, and the fourth cutting unit 305 is connected with the fifth cutting unit 306.
The first judging unit 201 is further configured to activate the second judging unit 202 when it is judged that the number of the to-be-cut tiers is less than two;
the second determining unit 202 is configured to determine whether the number of the target cutting level is greater than a preset number threshold, and if not, activate the third cutting unit 304; if so, said fourth cutting unit 305 is activated;
the fourth cutting unit 305 is configured to perform spatial topology calculation according to a preset grid corresponding to the cutting hierarchy by using the original vector data of the primitive as input data of the first cutting hierarchy, so as to cut the primitive into a plurality of sub-primitives corresponding to the first cutting hierarchy, and then activate the fifth cutting unit 306; the number of the first cutting level is equal to a preset number threshold minus n, n is a preset number adjustment factor, and n is a natural number which is greater than or equal to 1 and smaller than the preset number threshold;
the fifth cutting unit 306 is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting level by using a plurality of sub-primitives corresponding to the first cutting level as input data of the target cutting level, so as to cut the plurality of sub-primitives corresponding to the first cutting level into a plurality of sub-primitives corresponding to the target cutting level.
In this embodiment, when the number of the target cutting levels is one, it is determined whether the number of the target cutting levels is greater than a preset number threshold, and if so, a first cutting level with a higher level is cut first, and then the target cutting level is cut based on the first cutting level, so that the cutting efficiency of the target cutting level is improved.
In addition, in the first embodiment of the apparatus, when the number of the to-be-cut levels is greater than or equal to two, the vector data of the sub-primitive corresponding to the cut level is used as the input data of the current to-be-cut level in the other to-be-cut levels except for the highest to-be-cut level, and spatial topology calculation is performed according to a preset grid corresponding to the current to-be-cut level, so that the sub-primitive is cut into a plurality of sub-primitives corresponding to the current to-be-cut level. The cut level may be the highest cut level, or a cut level cut based on the primitive of the highest cut level.
In this embodiment, for the case whether the number of the to-be-cut layers is greater than or equal to two, the second cutting unit 303 includes a third determining unit 203, a fourth determining unit 204, and a sixth cutting unit 307, the first cutting unit 302 is connected to the third determining unit 203, the third determining unit 203 is connected to the fourth determining unit 204, and the fourth determining unit 204 is connected to the sixth cutting unit 307;
the third judging unit 203 is configured to judge whether the number of the current cutting level and the number of the cutting level at the time of the previous cutting are consecutive numbers, and if not, activate the fourth judging unit 204;
the fourth judging unit 204 is configured to judge whether the number of the current cutting level is greater than a preset number threshold, and if not, activate the sixth cutting unit 307;
the sixth cutting unit 307 is configured to perform spatial topology calculation according to a preset grid corresponding to the current cutting level, using vector data of sub-primitives corresponding to the cutting level during the previous cutting as input data of the current cutting level, so as to cut the sub-primitives corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level.
Assuming that the number of the cutting level at the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers, and j-i > 1.
The second cutting unit 303 further includes: a seventh cutting unit 308 and a fifth judging unit 205, wherein the fourth judging unit 204 is connected with the seventh cutting unit 308, and the seventh cutting unit 308 is connected with the fifth judging unit 205;
the fourth determining unit 204 is further configured to activate the seventh cutting unit 308 when the number of the current cutting level is greater than a preset number threshold;
the seventh cutting unit 308 is configured to perform spatial topology calculation by using vector data of a sub-primitive corresponding to the cutting level with the number i as input data of the cutting level with the number i +1, so as to cut the sub-primitive into a grid corresponding to the cutting level with the number i + 1;
the fifth judging unit 205 is configured to judge whether i +1 is smaller than j, if so, i +1, and activate the seventh cutting unit 308; if not, the process ends.
In this embodiment, when the number of the current cut level is not a consecutive number with the number of the previous cut level, and the number of the current cut level is greater than the preset number threshold, the vector data of the sub-primitive of the previous cut level is used as the input data of the current cut level to cut the current cut level; when the number of the current cutting level is smaller than or equal to the preset number threshold, the cutting level cut at the previous time is taken as the initial level to be cut step by step until the current cutting level is cut, and the cutting efficiency of the current cutting level is improved.
In addition, in practical applications, one type of primitive may correspond to a preset numbering threshold. The apparatus then further comprises: the number threshold obtaining unit 102 is connected to the fourth determining unit 204, and is configured to obtain a preset number threshold corresponding to the type of the primitive.
It should be noted that, as one of ordinary skill in the art would understand, all or part of the processes of the above method embodiments may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when executed, the computer program may include the processes of the above method embodiments. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points. The above-described apparatus embodiments are merely illustrative, and the units and modules described as separate components may or may not be physically separate. In addition, some or all of the units and modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The foregoing is directed to embodiments of the present invention, and it is understood that various modifications and improvements can be made by those skilled in the art without departing from the spirit of the invention.

Claims (12)

1. A method for layered cutting of primitives, the method comprising:
acquiring original vector data of a primitive;
judging whether the number of the layers to be cut is more than or equal to two, if so, cutting the graphic primitives into sub-graphic primitives in the corresponding layers according to the sequence from high to low of the layers to be cut, and specifically comprising the following steps of:
taking the original vector data of the primitive as input data of the highest cutting level, and performing spatial topology calculation according to a preset grid corresponding to the highest cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
in other layers to be cut except the highest cutting layer, vector data of sub-primitives corresponding to the cut layer are used as input data of the current layer to be cut, and spatial topology calculation is carried out according to a preset grid corresponding to the current layer to be cut so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current layer to be cut;
each layer to be cut corresponds to one number, and the number is smaller when the layer is higher; when the number of the layers to be cut is judged to be less than two, the method further comprises the following steps: judging whether the number of a target cutting level is smaller than a preset number threshold value or not, if not, executing the step of taking the original vector data of the primitive as the input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level;
if so, taking the original vector data of the primitive as input data of a first cutting level, and performing spatial topology calculation according to a preset grid corresponding to the cutting level to cut the primitive into a plurality of sub-primitives corresponding to the first cutting level, wherein the number of the first cutting level is equal to a preset number threshold minus n, n is a preset number adjustment factor, and n is a natural number which is greater than or equal to 1 and smaller than the preset number threshold;
and taking a plurality of sub-primitives corresponding to the first cutting level as input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the plurality of sub-primitives corresponding to the first cutting level into a plurality of sub-primitives corresponding to the target cutting level.
2. The method of claim 1, wherein when the number of to-be-cut levels is determined to be less than two, the to-be-cut level is taken as a target cut level, the method further comprising:
and taking the original vector data of the primitive as input data of the target cutting level, and performing spatial topology calculation according to a preset grid corresponding to the target cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting level.
3. The method according to claim 1, wherein the step of cutting the primitives into sub-primitives in corresponding levels in the order from high to low of the level to be cut is specifically as follows:
and cutting the graphic elements into sub-graphic elements corresponding to the to-be-cut levels according to the sequence of the serial numbers of the to-be-cut levels from small to large.
4. The method according to claim 1, wherein the step of performing spatial topology calculation according to a preset grid corresponding to the current cutting level by using vector data of sub-primitives corresponding to the cut level as input data of the current cutting level at the other cutting level except for the highest cutting level to cut the sub-primitives into a plurality of sub-primitives corresponding to the current cutting level comprises:
judging whether the number of the current cutting level and the number of the cutting level during the previous cutting are continuous numbers, if not, judging whether the number of the current cutting level is larger than a preset number threshold, if not, taking the vector data of the sub-primitive corresponding to the cutting level during the previous cutting as the input data of the current cutting level, and performing spatial topology calculation according to a preset grid corresponding to the current cutting level so as to cut the sub-primitive corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level.
5. The method of claim 4, wherein when the number of the current cutting level is not a consecutive number with the number of the cutting level at the previous cutting and the number of the current cutting level is greater than the preset number threshold, if the number of the cutting level at the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers, and j-i > 1, the method further comprises:
step 1: taking the vector data of the sub-primitive corresponding to the cutting level with the number of i as the input data of the cutting level with the number of i +1 to perform spatial topology calculation so as to cut the sub-primitive into a grid corresponding to the cutting level with the number of i + 1;
step 2: and judging whether i +1 is smaller than j, if so, i is equal to i +1, returning to execute the step 1, and if not, ending the step.
6. The method as claimed in claim 4 or 5, wherein a type of primitive corresponds to a predetermined number threshold, and before determining whether the number of the current cut level is greater than the predetermined number threshold, the method further comprises:
and acquiring a preset numbering threshold corresponding to the type of the primitive.
7. A primitive layering and cutting apparatus, the apparatus comprising: the cutting device comprises an acquisition unit, a first judgment unit and a cutting unit, wherein the acquisition unit is connected with the first judgment unit, and the first judgment unit is connected with the cutting unit;
the acquiring unit is used for acquiring original vector data of a primitive;
the first judging unit is used for judging whether the number of the layers to be cut is more than or equal to two, and if so, the cutting unit is activated;
the cutting unit is used for cutting the graphic primitives into sub-graphic primitives in corresponding levels according to the order of the levels to be cut from high to low;
wherein the cutting unit includes: a first cutting unit and a second cutting unit;
the first cutting unit is used for taking the original vector data of the primitive as input data of a highest cutting level, and performing spatial topology calculation according to a preset grid corresponding to the highest cutting level so as to cut the primitive into a plurality of sub-primitives corresponding to the highest cutting level;
the second cutting unit is used for cutting other layers to be cut except the highest cutting layer, taking vector data of sub-primitives corresponding to the cut layer as input data of the current layer to be cut, and performing spatial topology calculation according to a preset grid corresponding to the current layer to be cut so as to cut the sub-primitives into a plurality of sub-primitives corresponding to the current layer to be cut;
each layer to be cut corresponds to one number, and the number is smaller when the layer is higher;
the device further comprises: the cutting device comprises a first judging unit, a second judging unit, a third cutting unit, a fourth cutting unit and a fifth cutting unit, wherein the first judging unit is connected with the second judging unit, the second judging unit is connected with the fourth cutting unit and the fourth cutting unit, and the fourth cutting unit is connected with the fifth cutting unit;
the first judging unit is further configured to activate the second judging unit when the number of the to-be-cut tiers is judged to be less than two;
the third cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to a target cutting hierarchy by using the original vector data of the primitive as input data of the target cutting hierarchy, so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting hierarchy;
the second judging unit is used for judging whether the number of the target cutting level is larger than a preset number threshold value or not, and if not, the third cutting unit is activated; if so, activating the fourth cutting unit;
the fourth cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the cutting level by using the original vector data of the primitive as input data of the first cutting level, so as to cut the primitive into a plurality of sub-primitives corresponding to the first cutting level, and then activate the fifth cutting unit; the number of the first cutting level is equal to a preset number threshold minus n, n is a preset number adjustment factor, and n is a natural number which is greater than or equal to 1 and smaller than the preset number threshold;
the fifth cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting level by using a plurality of sub-primitives corresponding to the first cutting level as input data of the target cutting level, so as to cut the plurality of sub-primitives corresponding to the first cutting level into a plurality of sub-primitives corresponding to the target cutting level.
8. The device of claim 7, further comprising a third cutting unit connected to the first judging unit;
the first judging unit is further configured to take the to-be-cut hierarchy as a target cutting hierarchy and activate the third cutting unit when it is judged that the number of the to-be-cut hierarchies is less than two;
and the third cutting unit is configured to perform spatial topology calculation according to a preset grid corresponding to the target cutting hierarchy by using the original vector data of the primitive as input data of the target cutting hierarchy, so as to cut the primitive into a plurality of sub-primitives corresponding to the target cutting hierarchy.
9. The apparatus according to claim 7, wherein the cutting unit is configured to cut the primitive into sub-primitives in corresponding levels according to a sequence from a high level to a low level of a level to be cut, and specifically includes:
and the cutting unit is used for cutting the graphic primitives into the sub-graphic primitives corresponding to the to-be-cut hierarchy according to the sequence that the serial numbers of the to-be-cut hierarchies are from small to large.
10. The apparatus according to claim 7, wherein the second cutting unit comprises a third judging unit, a fourth judging unit and a sixth cutting unit, the first cutting unit is connected with the third judging unit, the third judging unit is connected with the fourth judging unit, and the fourth judging unit is connected with the sixth cutting unit;
the third judging unit is used for judging whether the serial number of the current cutting level and the serial number of the cutting level during the previous cutting are continuous serial numbers or not, and if not, the fourth judging unit is activated;
the fourth judging unit is used for judging whether the number of the current cutting level is larger than a preset number threshold value or not, and if not, the sixth cutting unit is activated;
and the sixth cutting unit is used for taking the vector data of the sub-primitives corresponding to the cutting level during the previous cutting as the input data of the current cutting level, and performing spatial topology calculation according to a preset grid corresponding to the current cutting level so as to cut the sub-primitives corresponding to the previous cutting level into a plurality of sub-primitives corresponding to the current cutting level.
11. The apparatus of claim 10, wherein the number of the cutting level at the previous cutting is i, the number of the current cutting level is j, i and j are natural numbers and j-i > 1;
the second cutting unit further includes: the fourth judging unit is connected with the seventh cutting unit, and the seventh cutting unit is connected with the fifth judging unit;
the fourth judging unit is further configured to activate the seventh cutting unit when the number of the current cutting level is greater than a preset number threshold;
the seventh cutting unit is configured to perform spatial topology calculation by using vector data of a sub-primitive corresponding to the cutting level numbered i as input data of the cutting level numbered i +1, so as to cut the sub-primitive into a grid corresponding to the cutting level numbered i + 1;
the fifth judging unit is configured to judge whether i +1 is smaller than j, if so, i +1, and activate the seventh cutting unit; if not, the process ends.
12. The apparatus according to claim 10 or 11, wherein a type of primitive corresponds to a preset numbering threshold;
the device further comprises: and the number threshold acquisition unit is connected with the fourth judgment unit and is used for acquiring a preset number threshold corresponding to the type of the primitive.
CN201510359216.1A 2015-06-25 2015-06-25 A kind of pel laminated cutting method and device Expired - Fee Related CN106326255B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510359216.1A CN106326255B (en) 2015-06-25 2015-06-25 A kind of pel laminated cutting method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510359216.1A CN106326255B (en) 2015-06-25 2015-06-25 A kind of pel laminated cutting method and device

Publications (2)

Publication Number Publication Date
CN106326255A CN106326255A (en) 2017-01-11
CN106326255B true CN106326255B (en) 2019-09-13

Family

ID=57729583

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510359216.1A Expired - Fee Related CN106326255B (en) 2015-06-25 2015-06-25 A kind of pel laminated cutting method and device

Country Status (1)

Country Link
CN (1) CN106326255B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113255273B (en) * 2021-06-07 2021-10-01 上海国微思尔芯技术股份有限公司 Segmentation and verification method, device, electronic equipment and storage medium
CN115033329B (en) * 2022-06-22 2023-09-26 北京世冠金洋科技发展有限公司 Virtual subsystem creation method and related device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582215A (en) * 2009-06-12 2009-11-18 张志刚 Multi-stage nine-grid locating method of spatial information
CN102682654A (en) * 2011-03-16 2012-09-19 高德软件有限公司 Method and device for rendering traffic information
CN102831613A (en) * 2012-08-29 2012-12-19 武汉大学 Parallel fractural network evolution image segmentation method
CN103034999A (en) * 2012-12-05 2013-04-10 上海创图网络科技发展有限公司 Pyramid slicing method based on dynamic effect model (DEM) data
CN103208225A (en) * 2012-01-12 2013-07-17 中国科学院遥感应用研究所 Tile map manufacturing method and system
CN104361556A (en) * 2014-10-22 2015-02-18 华为技术有限公司 Image synthesis method, image chip and image equipment

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582215A (en) * 2009-06-12 2009-11-18 张志刚 Multi-stage nine-grid locating method of spatial information
CN102682654A (en) * 2011-03-16 2012-09-19 高德软件有限公司 Method and device for rendering traffic information
CN103208225A (en) * 2012-01-12 2013-07-17 中国科学院遥感应用研究所 Tile map manufacturing method and system
CN102831613A (en) * 2012-08-29 2012-12-19 武汉大学 Parallel fractural network evolution image segmentation method
CN103034999A (en) * 2012-12-05 2013-04-10 上海创图网络科技发展有限公司 Pyramid slicing method based on dynamic effect model (DEM) data
CN104361556A (en) * 2014-10-22 2015-02-18 华为技术有限公司 Image synthesis method, image chip and image equipment

Also Published As

Publication number Publication date
CN106326255A (en) 2017-01-11

Similar Documents

Publication Publication Date Title
CN108038249B (en) Global map data storage organization method and call method
CN102663801B (en) Method for improving three-dimensional model rendering performance
CN111475597B (en) Non-rigid grid coding, spatial object unique identification and query method and device
KR101546705B1 (en) Method for visualizing building-inside bim data by bim data process terminal
CN105718480A (en) Method for scheduling massive three-dimensional data on basis of geographic information
CN108255864A (en) Photomap service issuing method based on distributed storage and Distributed Calculation
CN102629391A (en) Three-dimensional space structure graph cutting and slicing method based on digital graph medium
CN111090716A (en) Vector tile data processing method, device, equipment and storage medium
JP2017509043A (en) Graph data query method and apparatus
Han et al. Development of a hashing-based data structure for the fast retrieval of 3D terrestrial laser scanned data
CN112115226B (en) Map rendering method and map rendering device
CN104102637A (en) Method and device for generating hot spot region
CN115687675A (en) Airborne vector map data processing method
CN106326255B (en) A kind of pel laminated cutting method and device
CN112150610A (en) Retaining wall modeling method and system based on dimension marking
CN114119939A (en) Data lightweight processing method and device, storage medium and electronic device
CN104143214A (en) Electronic map polygon triangulation method and device
CN108153572A (en) GIS display methods, device and system
CN112687007B (en) Stereoscopic grid chart generation method based on LOD technology
CN113094536B (en) Power transmission tower lightweight display method and device based on power grid GIM
CN107506485B (en) Discrete site grading display method and device based on GIS
CN113112594A (en) Power transmission and transformation project three-dimensional model lightweight method and device based on electric power GIM
CN103034999B (en) A kind of pyramid dicing method based on dem data
CN112184900B (en) Method, device and storage medium for determining elevation data
CN109949421B (en) Triangular net cutting method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20200508

Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province

Patentee after: Alibaba (China) Co.,Ltd.

Address before: 102200, No. 8, No., Changsheng Road, Changping District science and Technology Park, Beijing, China. 1-5

Patentee before: AUTONAVI SOFTWARE Co.,Ltd.

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20190913

Termination date: 20200625

CF01 Termination of patent right due to non-payment of annual fee