CN106599025B - Vector data slicing method and system based on data exchange format - Google Patents

Vector data slicing method and system based on data exchange format Download PDF

Info

Publication number
CN106599025B
CN106599025B CN201610939909.2A CN201610939909A CN106599025B CN 106599025 B CN106599025 B CN 106599025B CN 201610939909 A CN201610939909 A CN 201610939909A CN 106599025 B CN106599025 B CN 106599025B
Authority
CN
China
Prior art keywords
vector data
original image
data
slicing
graph
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.)
Active
Application number
CN201610939909.2A
Other languages
Chinese (zh)
Other versions
CN106599025A (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.)
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
State Grid Anhui Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
State Grid Anhui Electric Power 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 State Grid Corp of China SGCC, China Electric Power Research Institute Co Ltd CEPRI, State Grid Anhui Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201610939909.2A priority Critical patent/CN106599025B/en
Publication of CN106599025A publication Critical patent/CN106599025A/en
Application granted granted Critical
Publication of CN106599025B publication Critical patent/CN106599025B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/50Information retrieval; Database structures therefor; File system structures therefor of still image data
    • G06F16/56Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format

Abstract

The invention discloses a vector data slicing method based on a data exchange format, which comprises the following steps: setting the structure of the original graph as a vector data exchange format, wherein the geometric type geographic data structure represented by the vector data exchange format comprises: a set of points, lines, faces, multiple lines, and multiple faces; splitting the vector data interchange format artwork into at least 1 object, the vector data interchange format artwork object comprising the representation geometry type geographic data structure or object, and a set of methods to express the object; classifying the original image objects in the vector data exchange format, and determining the derivative relation of the grouped original image objects in the vector data exchange format; and slicing the original image object in the hierarchical vector data exchange format according to a rectangular blocking mode.

Description

Vector data slicing method and system based on data exchange format
Technical Field
The invention relates to the field of geographic information systems, in particular to a vector data slicing method and a vector data slicing system based on a data exchange format.
Background
Map slicing refers to a process of cutting a map within a specified geographic range into square pictures with fixed sizes in rows and columns under a certain scale level, and the regular pictures are also called map tiles. The tile pyramid model is a multi-resolution hierarchical model, and the resolution is lower and lower from the bottom layer to the top layer of the tile pyramid, but the represented geographical range is unchanged. The graphic data loaded on the GIS system generally includes vector data and image data. The image data is generally sliced by using a pyramid technique, and a map or an image at a designated level can be quickly accessed. However, the sliced image is still a picture, and thus, more interactive operations cannot be performed. Vector data is then introduced for displaying a point-line surface, such as a vector road network, a vector map, etc. Such vector data is convenient to store and use when the amount of data is small, but when the amount of data is large (for example, data of detailed roads and rivers throughout the country), there are several problems as follows:
(1) presentation of the same set of data may require different styles (e.g., day and night modes) under different requirements that must be re-sliced for traditional pyramid slicing.
(2) Because the resolution ratio of the slice is fixed, the slice volume is too large when the resolution ratio is too high, and the resolution ratio is too low and the high-definition screen cannot clearly display.
(3) If the request of the vector data is an on-demand request, the server pressure is increased by requesting the data from the server every time; if a request is shown on demand, the stress on the client is too great when the vector data is too large (e.g., national water system data).
(4) Due to the integrity of the vector data elements, if the vector data is forcedly clipped and partitioned by adopting a tile structure similar to the image data, the vector data may be internally partitioned for a complete geometric element, and the topological relation of the vector data may be damaged. Therefore, this approach may affect the integrity of the vector data, and may cause data distortion during reconstruction.
The prior art has no mature slicing method in the aspects of data processing and display by using massive vectors.
Disclosure of Invention
In order to solve the problem of a method for partitioning and slicing massive vector data, the invention provides a method, wherein the slicing method comprises the following steps:
splitting an original image of vector data into at least 1 object, said original image object of vector data comprising said geometric type geographical data structure or object, and a set of methods to express said object;
grading the original image objects, and determining the derivative relation of the graded original image objects;
and slicing the classified original image object according to a rectangular blocking mode.
Preferably, the slicing the ranked original image object in a rectangular blocking manner includes:
automatically subdividing a large graph cutting task into unit tasks which can be executed by child nodes according to the size of the original graph object;
distributing the subdivided unit tasks to the plurality of child nodes to synchronously execute the graph cutting tasks;
and storing the original image object slice unit after cutting to the designated node position.
Preferably, automatically subdividing the large graph cutting task into unit tasks that can be executed by child nodes according to the size of the original graph object includes:
and determining the total number of the slicing lines and the total number of the slicing lines N of the original image object according to the size of the original image object slicing unit, and taking N original image object slicing units.
Preferably, the file size of the original image object slice unit is less than 100K.
Preferably, the step of distributing the subdivided unit tasks to a plurality of child nodes to synchronously execute the graph cutting task comprises:
monitoring the load state of the child node;
and distributing the graph cutting task according to the load states of all the child nodes recorded by the main node.
Preferably, the geometry type of the artwork object after splitting includes: dots, lines, and closed figures.
Preferably, the ranking the artwork objects includes:
and grading the original image objects according to the map scale, wherein the graded original image objects are used for displaying the graphic elements with different geometric types.
Preferably, the structure of the primitive is set to a vector data exchange format, and the geometric type geographic data structure represented by the vector data exchange format includes: the set of points, lines, facets and multilines, facets comprising:
the vector data exchange format is a data structure expanded based on a data structure of a vector data exchange format JSON;
the geographic data structure that the expanded vector data exchange format is capable of representing includes geometry, features, and feature sets.
According to an embodiment of the present invention, there is provided a vector data slicing system based on a data exchange format, the slicing system including:
a data set unit, configured to set a structure of an original graph to a vector data exchange format, where the geometry-type geographic data structure represented by the vector data exchange format includes: a set of points, lines, faces, multiple lines, and multiple faces;
a data splitting unit, configured to split an original graph in the vector data interchange format into at least 1 object, where the original graph object includes the geographic data structure or object representing the geometric type, and a set of methods for expressing the object;
the data grading unit is used for grading the original image objects and determining the derivative relation of the grouped original image objects;
and the data slicing unit is used for slicing the original image object in a rectangular blocking mode.
Preferably, the data slicing unit includes:
the task confirmation module is used for automatically subdividing the large image cutting task into unit tasks with moderate granularity according to the scale, the geographical range and the vector data factors of the original image object;
the task execution module is used for distributing the subdivided unit tasks to a plurality of child nodes to synchronously execute the graph cutting tasks;
and the data storage module is used for storing the original image object slicing unit after the image is cut to the position of the designated node.
The invention has the beneficial effects that: the original image based on the data exchange format is partitioned into each object, the partitioned objects of the original image are graded, and the graded objects are sliced. The slicing method provided by the invention has the advantages of fast slicing, small graphic data volume, convenient data transmission, less redundant data and the like, and greatly improves the transmission and rendering efficiency of massive vector graphics.
Drawings
A more complete understanding of exemplary embodiments of the present invention may be had by reference to the following drawings in which:
FIG. 1 is a flow chart of a vector data slicing method based on a data exchange format according to an embodiment of the present invention;
FIG. 2 is a flowchart of a method for slicing vector data based on a data exchange format according to an embodiment of the present invention;
FIG. 3 is a block diagram of a data exchange format based vector data slicing system according to an embodiment of the present invention;
FIG. 4 is a block diagram of a data exchange format based vector data slicing system according to an embodiment of the present invention;
FIG. 5 is an original image object relationship structure of different scale vector data exchange formats according to an embodiment of the present invention;
FIG. 6 is a diagram of derivation relationships between primitive objects in different scaling vector data interchange formats in accordance with an embodiment of the present invention;
FIG. 7 is a block diagram of vector data based on a data exchange format according to an embodiment of the present invention;
FIG. 8 is a diagram of vector data based on a data exchange format according to an embodiment of the present invention;
fig. 9 is a diagram illustrating a vector data distributed slicing system according to an embodiment of the present invention.
Detailed Description
The exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, however, the present invention may be embodied in many different forms and is not limited to the embodiments described herein, which are provided for complete and complete disclosure of the present invention and to fully convey the scope of the present invention to those skilled in the art. The terminology used in the exemplary embodiments illustrated in the accompanying drawings is not intended to be limiting of the invention. In the drawings, the same units/elements are denoted by the same reference numerals.
Unless otherwise defined, terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Further, it will be understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense.
Fig. 1 is a flowchart of a vector data slicing method based on a data exchange format according to an embodiment of the present invention. As shown in fig. 1, method 100 starts at 101: setting the structure of the original graph into a vector data exchange format, wherein the geometric type geographic data structure represented by the vector data exchange format comprises: a collection of points, lines, facets, multiple lines, and facets. The invention provides a data exchange format for storing vector slices, which is based on vector data in a data exchange format and aims to enable the content of the vector data slices to be stored and called more easily. Different from picture format tiles such as JPG (joint picture group) or PNG (public network group) and the like generally adopted by the traditional data slice, the vector slice data provided by the embodiment of the invention does not need to call a large number of picture tiles, but is stored in a descriptive file form, and the data file is small. The descriptive file is a set of exchange format GCJSON suitable for geographic information vector data established on the basis of a standard data format JSON (JavaScript Object Notation). JSON is a light-weight data exchange format, is based on characters, can represent various complex structures, is easy to generate and is convenient for computer analysis. JSON does not have a strict closed tag, the effective data volume and the total data packet ratio are improved compared with data in other formats, and the transmission pressure of the network is correspondingly reduced under the condition of the same data flow, so that the transmission efficiency of the data is greatly improved. The GCJSON provided by the embodiment of the invention is a vector data exchange format data structure based on JSON and expanded, and can represent various geographic information data structures such as geometry, features and feature sets. Several geometric types are supported, point, line, face, multiline, and a collection of multifaceted and geometric types. The vector data exchange format is simple and easy to read and write, and is convenient for transmission, storage and interaction of massive vector slice data. When rendering a massive vector map, the vector slice data is charted using a series of internal data stored as GCJSON. Layers (e.g., roads, water, regions) organized into vector slices, each layer having independent elements (e.g., name, type, etc.) containing geometry and variable attributes. The object splitting, object grading and object slicing methods of the embodiment of the invention are based on the GCJSON format for storing and transmitting slices.
Preferably, step 102: an original graphic in a vector data interchange format is split into at least 1 object, the original graphic in the vector data interchange format including a set of methods representing geometric type geographic data structures or objects, and representing the objects.
Preferably, (1) the raw display data model is created in a vector data interchange format.
The physical storage capacity occupied by the space data stored in the original image in the vector data exchange format is D, and the speed V of loading the original image data in the vector data exchange format from the server by the client is V1Showing a velocity of V2The data loading preparation time is f (n), the time that the user can wait is T, the memory of the client is M, and the following formula (one) holds true:
Figure BDA0001139628230000061
if V is the data read preparation time is fixed due to the fixed size of the memory of the client1,V2T is a constant, and D must be reduced to meet the original image data display and processing requirements of the vector data exchange format. Due to the fact thatThe graphic data displayed on the screen at any moment is only a part of the read data D, so that the data of the non-screen display area of D is properly reduced, and the display of the graphic data on the screen is not influenced. The vector data slicing method adopted by the embodiment of the invention divides the space vector data D into N parts, and only reads part of graphic data when displaying the original graphic data in the vector data exchange format at any time, so as to meet the requirement of rapidly displaying the graphic and the data storage requirement.
(2) Original image object model establishment in vector data exchange format
The embodiment of the invention treats the original image data in the vector data exchange format as a set of a plurality of objects. The original image data map in any vector data exchange format can be divided into a plurality of objects, one node or one arc segment can be used as an object, and one country, one province and one image can also be used as an object. An object is composed of a set of data (or objects) that describe the state of the object and a set of methods that express it. The 2 maps with different scales in a region can be regarded as 2 map objects, the large-scale map object contains all information of the small-scale map object and also contains object information which is not contained in the small-scale map object, and the large-scale map object can be regarded as an object obtained by adding information to the small-scale map object. Therefore, the large-scale map object completely inherits all the information of the small-scale map object and possesses own specific information.
Referring to fig. 5, fig. 5 is a diagram illustrating an original image object relationship structure according to another embodiment of the present invention. As shown in fig. 5, the two line objects on the small-scale map object are enlarged to become two closed graphic objects on the large-scale map object, and the large-scale map object is added with a curve object on the basis of the small-scale map object.
In a GIS system, when a client needs to perform operations such as enlarging, reducing, and roaming on an original graph object in a vector data exchange format, a client user can only see the general view of the graph or a local detailed graph object at any time, and the user only browses graph objects of a graph with different scales or only a subset of all the graph objects of the graph under the same scale. The embodiments of the present invention propose that the original image in the vector data exchange format can be regarded as the above-mentioned objective data, and then the objective vector data slice is formed.
Preferably, step 102: and classifying the original image objects in the vector data exchange format, and determining the derivative relation of the original image objects in the vector data exchange format after grouping. For original image object data in a vector data exchange format having a large data amount, in order to improve processing and display efficiency, it is necessary to integrate the data, that is, to accept or reject original image object elements in the vector data exchange format on a different scale. The embodiment of the invention adopts a step-by-step grading method, and different graphic elements are displayed in each grade. Taking the road network diagram of Beijing as an example, the first level data only displays the general view of Beijing, a few main loops and expressways, the second level displays slightly detailed road information and main streets, and so on, and the last level displays the detailed information and the notes of each street of Beijing (equivalent to a traffic travel diagram with a scale of 1: 25000). One level of a graph can be regarded as an object, and corresponding objects of the graph in the same area under different scales have derivation relations. The large-scale image object is obtained by adding specific information to the small-scale image object information. With reference to fig. 6, fig. 6 is a drawing of the derivation relationship between the map objects with different scales.
In vector map viewing, a small scale vector graphics data is typically selected to display a profile of the graphics object. After the user selects the interested area, the interested area is enlarged to acquire more detailed vector map object information. By the step-by-step grading and objectification slicing algorithm, the process of amplifying the small-scale map object into the large-scale map object is regarded as the process of obtaining the large-scale map object by the additional information of the small-scale map object. Therefore, the read content of the image object amplified every time is accumulated for the previous image object data, thereby avoiding redundant data to the maximum extent and improving the efficiency.
The embodiment of the invention can obtain the vector data of different levels after grading the original image object data in the vector data exchange format, and the original image object data in the vector data exchange format is treated. Dividing the first-level map object data into nr parts according to the horizontal direction and nc parts in the vertical direction, so that the map object data is composed of nr x nc parts of vector data. The second-level map object is based on the second-level blocks, each block is divided into nr parts according to the horizontal direction and nc parts according to the vertical direction, so that the data is composed of (nr x nc)2And (4) composing vector data. By analogy, the ith stage consists of (nr x nc)iAnd (4) composing vector data.
Referring to fig. 7, when nr is 2 and nc is 2, 701 is a first-level map object and a small-scale map object, a 2 nd-level map object is a larger-scale map object, the first-level map object is equally divided into equal rectangles of "0", "1", "2", "3" and "4", and the second-level map object is equally divided into equal rectangles of "0", "1", "2", "3", "4", "5", "6", "7", "8" and "9" up to "16", as shown in fig. 7. The rectangular block "0" in the first-level 701 map object is enlarged to correspond to 4 rectangular blocks "0", "1", "4", and "5" in the second-level map object 702; rectangle "1" in first level view object 701 corresponds to "2", "3", "6", "7" in level 2 view after enlargement; rectangle "2" in first level view object 701 is enlarged to correspond to "8", "9", "12", "13" in the second level view object; rectangle "3" in first level frame object 701 is enlarged to correspond to "10", "11", "14" and "15" in the second level frame object. And (4) carrying out analogy according to the blocking method on the third-level map object and the map object at the smaller scale level.
Thus, an original object in the vector data interchange format is a collection of graphics objects, as in equation (two):
Figure BDA0001139628230000081
in equation (II), F is the total set of n graphics objects, and object represents the subset under the total set of graphics objects F. The client browses only a part of a graph, namely a subset of a graph object set at any time, so that a graph object can be divided into a plurality of graph object subsets in a rectangular blocking mode. Each tile is a grid, each grid is a set of graphical objects, and may contain from 0 to any number of graphical objects.
Referring to fig. 8, as shown in fig. 8, a rectangular mesh in row 2 and column 2 includes a planar object, and all the meshes form a graph. The spatial data is stored and managed in a rectangular block mode in the whole view, and the content of each grid is vector data, namely a block storage data structure of the vector.
Preferably, step 104: and slicing the original image object in the hierarchical vector data exchange format according to a rectangular blocking mode. According to the vector data map object blocking principle provided by the embodiment of the invention, the vector data is sliced.
Fig. 2 is a flowchart of a vector data slicing method based on a data exchange format according to an embodiment of the present invention. As shown in fig. 2, a vector data slicing method 200 based on a data exchange format, the slicing method includes:
preferably, step 201, the structure of the primitive is set to a vector data exchange format, and the geometric type geographic data structure represented by the vector data exchange format includes: a collection of points, lines, facets, multiple lines, and facets. Step 201 corresponds to step 101 in fig. 1, and is not described herein again.
Preferably, in step 202, the original graphic in the vector data interchange format is split into at least 1 object, and the original graphic in the vector data interchange format includes a set of methods representing a geometric type geographic data structure or object and an expression object. Step 202 corresponds to step 102 in fig. 1, and is not described herein again.
Preferably, step 203, the original image objects in the vector data exchange format are ranked, and the derivation relationship of the original image objects in the vector data exchange format after grouping is determined. Step 203 corresponds to step 103 in fig. 1, and is not described herein again. As described with reference to fig. 9, the present invention uses a distributed file system to store original image object data in a vector data exchange format in a distributed storage unit 903. In a distributed slicing system, how to assign these slicing tasks is addressed first. The graph cutting task splitting is to divide original graph object data in a vector data exchange format which needs to be subjected to graph cutting, and split the original graph object data into unit tasks with moderate granularity according to the principle that the operation speed executable by the host 901 is not exceeded. The graph cutting task execution means that each graph cutting node task executes the graph cutting tasks under the unified scheduling of the graph cutting main nodes, and the original graph object data slice storage in the vector data exchange format is to store the sliced data in the storage unit 903 in a distributed manner.
Preferably, in step 204, the original image object in the hierarchical vector data exchange format is sliced in a distributed slicing task manner in a rectangular block manner. For slicing of massive vector data, more slicing tasks need to be faced, and the load is large. Therefore, the embodiment of the invention provides a method for slicing original image object data in a vector data exchange format by a distributed file system. In distributed slicing systems, there is a need to address how these slicing tasks are distributed. The graph cutting task splitting is to divide original graph object data in a vector data exchange format which needs to be subjected to graph cutting, and split the original graph object data into unit tasks with moderate granularity according to the principle that the operation speed executable by the host 901 is not exceeded. The graph cutting task execution means that each graph cutting node task executes the graph cutting tasks under the unified scheduling of the graph cutting main nodes, and the original graph object data slice storage in the vector data exchange format is to store the sliced data in the storage unit 903 in a distributed manner. Preferably, step 205 automatically subdivides the large graph cutting task into unit tasks with moderate granularity according to the scale, geographical range and vector data factors of the original graph object in the vector data exchange format. The subdivision of the image cutting task in the embodiment of the invention is automatic, and the large image cutting task is automatically subdivided into a series of unit tasks with moderate granularity according to factors such as a scale, a geographical range, vector data complexity and the like. The method comprises the specific steps that in a map of each scale, the upper left corner is used as a starting point, the total number of rows and columns of tiles is calculated according to the size of original image object tiles in a vector data exchange format, N multiplied by N tiles are taken as image cutting unit tasks according to the sequence of line-by-line calculation, most of the unit tasks are evenly divided and have proper size, namely N is selected to meet the requirement that original image object data in the vector data exchange format after slicing does not exceed 100K. The complexity of the map format object is high, the value of N is small when the tile is large, the complexity of the map format object is low, and the value of N is large when the tile is small. After the slicing unit task is split, the slicing unit task is stored in a unit task pool, and the graph cutting main node can automatically forward the graph cutting main node to each idle graph cutting node according to the node condition.
Preferably, in step 206, the original image object slice unit in the vector data exchange format after the graph cutting is stored in the designated node position. The embodiment of the invention adopts the distributed file system 900 to store vector data after slicing, and stores the tiles in the GCJSON format into the storage unit 903 in the distributed file system.
Fig. 3 is a diagram illustrating a system for slicing vector data based on a data exchange format according to an embodiment of the present invention. As shown in fig. 3, the system 300 includes:
a data set unit 301, configured to set a structure of the primitive to a vector data interchange format, where the geometric type geographic data structure represented by the vector data interchange format includes: a set of points, lines, faces, multiple lines, and multiple faces;
a data splitting unit 302, configured to split the original graph in the vector data exchange format into at least 1 object, where the original graph in the vector data exchange format includes the geographic data structure or object representing the geometric type and a set of methods for expressing the object;
a data classification unit 303, configured to classify the original image objects in the vector data exchange format, and determine a derivative relationship of the original image objects in the vector data exchange format after grouping;
a data slicing unit 304, configured to slice the original image object in the vector data exchange format in a rectangular block manner.
The system 300 is a vector data slicing system based on a data exchange format, and corresponds to the vector data slicing method 100 based on the data exchange format, which is not described herein again.
Fig. 4 is a block diagram of a vector data slicing system based on a data exchange format according to an embodiment of the present invention, and as shown in fig. 4, the system 400 includes:
a data set unit 401, configured to set a structure of the primitive to a vector data interchange format, where the geometric type geographic data structure represented by the vector data interchange format includes: a set of points, lines, faces, multiple lines, and multiple faces;
a data splitting unit 402, configured to split the vector data interchange format original graph into at least 1 object, where the vector data interchange format original graph object includes the geographic data structure or object representing the geometric type and a set of methods for expressing the object;
a data classification unit 403, configured to classify the original image objects in the vector data exchange format, and determine a derivative relationship of the original image objects in the vector data exchange format after grouping;
a data slicing unit 404, configured to slice the original image object in the vector data exchange format in a distributed slicing task manner according to a rectangular block manner, where the slicing unit includes:
the task confirming module 4041 is used for automatically subdividing the large graph cutting task into unit tasks with moderate granularity according to the scale, the geographical range and the vector data factors of the original graph object in the vector data exchange format;
a task execution module 4042, configured to allocate the subdivided unit tasks to multiple child nodes to synchronously execute the graph cutting task;
the data storage module 4043 is configured to store the original image object slice unit in the vector data exchange format after the graph cutting to the designated node position.
The system 400 is a data exchange format-based vector data slicing system corresponding to the data exchange format-based vector data slicing method 200, and will not be described herein again.
The original image based on the data exchange format is partitioned into each object, the partitioned objects of the original image are graded, and the graded objects are sliced. The slicing method provided by the invention has the advantages of fast slicing, small graphic data volume, convenient data transmission, less redundant data and the like, and greatly improves the transmission and rendering efficiency of massive vector graphics.
The invention has been described with reference to a few embodiments. However, other embodiments of the invention than the one disclosed above are equally possible within the scope of the invention, as would be apparent to a person skilled in the art from the appended patent claims.
Generally, all terms used in the claims are to be interpreted according to their ordinary meaning in the technical field, unless explicitly defined otherwise herein. All references to "a/an/the [ device, component, etc ]" are to be interpreted openly as referring to at least one instance of said device, component, etc., unless explicitly stated otherwise. The steps of any method disclosed herein do not have to be performed in the exact order disclosed, unless explicitly stated.
In addition, as will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Claims (8)

1. A data exchange format based vector data slicing method, the slicing method comprising:
splitting an original image of vector data into at least 1 object, the original image object of vector data comprising a geometric type geographic data structure or object, and a set of methods to express the object;
grading the original image objects, and determining the derivative relation of the graded original image objects;
slicing the classified original image object according to a rectangular blocking mode; the slicing the graded original image object according to a rectangular blocking mode comprises:
automatically subdividing a large graph cutting task into unit tasks which can be executed by child nodes according to the size of the original graph object;
distributing the subdivided unit tasks to a plurality of child nodes to synchronously execute the graph cutting tasks, wherein the graph cutting tasks comprise: monitoring the load state of the child node;
distributing the graph cutting tasks according to the load states of all the child nodes recorded by the main node;
and storing the original image object slice unit after cutting to the designated node position.
2. The method of claim 1, automatically subdividing a large graph cut task into unit tasks that child nodes can perform according to the size of the original graph object comprises:
and determining the total number of the slicing lines and the total number of the slicing lines N of the original image object according to the size of the original image object slicing unit, and taking N original image object slicing units.
3. The method of claim 2, wherein the artwork object slice units have a file size of less than 100K.
4. The method of claim 1, wherein the geometry type of the artwork object after splitting comprises: dots, lines, and closed figures.
5. The method of claim 1, the ranking the artwork objects comprising:
and grading the original image objects according to the map scale, wherein the graded original image objects are used for displaying the graphic elements with different geometric types.
6. The method of claim 1, setting the structure of the primitive to a vector data interchange format, the vector data interchange format representing a geometric type geographic data structure comprising: the set of points, lines, facets and multilines, facets comprising:
the vector data exchange format is a data structure expanded based on a data structure of a vector data exchange format JSON;
the geographic data structure that the expanded vector data exchange format is capable of representing includes geometry, features, and feature sets.
7. A data exchange format-based vector data slicing system, the slicing system comprising:
a data set unit, configured to set a structure of an original graph to a vector data exchange format, where the geometry-type geographic data structure represented by the vector data exchange format includes: a set of points, lines, faces, multiple lines, and multiple faces;
a data splitting unit, configured to split an original graph in the vector data interchange format into at least 1 object, where the original graph includes a geographical data structure or object representing a geometric type, and a set of methods for expressing the objects;
the data grading unit is used for grading the original image objects and determining the derivative relation of the grouped original image objects;
the data slicing unit is used for slicing the original image object according to a rectangular blocking mode; the slicing the graded original image object according to a rectangular blocking mode comprises:
automatically subdividing a large graph cutting task into unit tasks which can be executed by child nodes according to the size of the original graph object;
distributing the subdivided unit tasks to a plurality of child nodes to synchronously execute the graph cutting tasks, wherein the graph cutting tasks comprise: monitoring the load state of the child node;
distributing the graph cutting tasks according to the load states of all the child nodes recorded by the main node;
and storing the original image object slice unit after cutting to the designated node position.
8. The system of claim 7, the data slicing unit comprising:
the task confirmation module is used for automatically subdividing the large image cutting task into unit tasks with moderate granularity according to the scale, the geographical range and the vector data factors of the original image object;
the task execution module is used for distributing the subdivided unit tasks to a plurality of child nodes to synchronously execute the graph cutting tasks;
and the data storage module is used for storing the original image object slicing unit after the image is cut to the position of the designated node.
CN201610939909.2A 2016-10-25 2016-10-25 Vector data slicing method and system based on data exchange format Active CN106599025B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610939909.2A CN106599025B (en) 2016-10-25 2016-10-25 Vector data slicing method and system based on data exchange format

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610939909.2A CN106599025B (en) 2016-10-25 2016-10-25 Vector data slicing method and system based on data exchange format

Publications (2)

Publication Number Publication Date
CN106599025A CN106599025A (en) 2017-04-26
CN106599025B true CN106599025B (en) 2022-03-04

Family

ID=58589819

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610939909.2A Active CN106599025B (en) 2016-10-25 2016-10-25 Vector data slicing method and system based on data exchange format

Country Status (1)

Country Link
CN (1) CN106599025B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108664619B (en) * 2018-05-14 2020-06-19 江西理工大学 Primitive storage and scheduling method for mass line-drawing topographic map of tile-like technology
CN108647336B (en) * 2018-05-14 2020-06-19 江西理工大学 Method for processing vector diagram by using key scale and tile-like technology
CN109902135B (en) * 2019-02-19 2021-03-19 武大吉奥信息技术有限公司 Vector tile preprocessing method and device
CN109977183B (en) * 2019-03-18 2021-06-08 武大吉奥信息技术有限公司 Drawing method of planning and natural resource service drawings in WebGIS environment
CN111310089B (en) * 2020-02-17 2023-04-28 自然资源部第三地理信息制图院 Vector river network data online rapid loading and rendering method suitable for scale
CN111915614B (en) * 2020-08-12 2024-03-22 苏州中科蓝迪软件技术有限公司 Vector map production method
CN114661841A (en) * 2022-02-24 2022-06-24 广州市城市规划勘测设计研究院 Electronic map publishing method, device and equipment and electronic map scheduling method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102663119A (en) * 2012-04-19 2012-09-12 北京天下图数据技术有限公司 Method for rendering massive vector data
CN102737076A (en) * 2011-08-26 2012-10-17 新奥特(北京)视频技术有限公司 Method and system for structuring geographical vector-data data tree
CN102779165A (en) * 2012-06-21 2012-11-14 上海众恒信息产业股份有限公司 Building method of grid map picture base
CN105045930A (en) * 2015-08-31 2015-11-11 武汉云空间地理信息技术有限公司 Raster data slice generating method and raster data slice generating system
CN105206173A (en) * 2015-10-23 2015-12-30 上海斐讯数据通信技术有限公司 Cloud-based map cutting system and method
CN105354206A (en) * 2015-06-15 2016-02-24 中国地质大学(武汉) Big map cutting based vector data tile map cutting acceleration method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080228783A1 (en) * 2007-03-14 2008-09-18 Dawn Moffat Data Partitioning Systems

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102737076A (en) * 2011-08-26 2012-10-17 新奥特(北京)视频技术有限公司 Method and system for structuring geographical vector-data data tree
CN102663119A (en) * 2012-04-19 2012-09-12 北京天下图数据技术有限公司 Method for rendering massive vector data
CN102779165A (en) * 2012-06-21 2012-11-14 上海众恒信息产业股份有限公司 Building method of grid map picture base
CN105354206A (en) * 2015-06-15 2016-02-24 中国地质大学(武汉) Big map cutting based vector data tile map cutting acceleration method
CN105045930A (en) * 2015-08-31 2015-11-11 武汉云空间地理信息技术有限公司 Raster data slice generating method and raster data slice generating system
CN105206173A (en) * 2015-10-23 2015-12-30 上海斐讯数据通信技术有限公司 Cloud-based map cutting system and method

Also Published As

Publication number Publication date
CN106599025A (en) 2017-04-26

Similar Documents

Publication Publication Date Title
CN106599025B (en) Vector data slicing method and system based on data exchange format
CN107423445B (en) A kind of map data processing method, device and storage medium
CN103595791B (en) Cloud accessing method for mass remote sensing data
CN108664619B (en) Primitive storage and scheduling method for mass line-drawing topographic map of tile-like technology
CN108647336B (en) Method for processing vector diagram by using key scale and tile-like technology
KR101785982B1 (en) Method and apparatus for generating mosaic image
Li et al. Visualizing dynamic geosciences phenomena using an octree-based view-dependent LOD strategy within virtual globes
CN110956673A (en) Map drawing method and device
Ruzinoor et al. A review on 3D terrain visualization of GIS data: techniques and software
CN111354084A (en) Network geographic information service system based on three-dimensional model tiles
CN112419498B (en) Scheduling rendering method for massive oblique photographic data
CN108255864A (en) Photomap service issuing method based on distributed storage and Distributed Calculation
CN109859109B (en) Series scale PDF map seamless organization and display method
CN107170040A (en) A kind of three-dimensional bridge scenario building method and apparatus
CN102117494A (en) Method and device for delaminating and blocking data in three-dimensional modeling
CN107479871A (en) A kind of access and rendering intent of the vector data of magnanimity, electronic equipment and storage medium
CN103268221A (en) Three-dimensional weather data volume display method and device based on WEB technique
Deibe et al. Supporting multi-resolution out-of-core rendering of massive LiDAR point clouds through non-redundant data structures
Guo et al. A spatially adaptive decomposition approach for parallel vector data visualization of polylines and polygons
CN111143502A (en) Map tile efficient generation method and device
CN111026891A (en) Map bottom map integration method
CN101656037A (en) Method for displaying large-format picture on small screen equipment and small screen equipment
CN112115226B (en) Map rendering method and map rendering device
CN102819533B (en) The warehouse compartment information processing method in visualization warehouse and device
CN113902832A (en) Flood three-dimensional dynamic evolution and rendering method and device and electronic equipment

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
GR01 Patent grant
GR01 Patent grant