[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN110059210A - A kind of map vector tile method for organizing of band topology - Google Patents

A kind of map vector tile method for organizing of band topology Download PDF

Info

Publication number
CN110059210A
CN110059210A CN201910192667.9A CN201910192667A CN110059210A CN 110059210 A CN110059210 A CN 110059210A CN 201910192667 A CN201910192667 A CN 201910192667A CN 110059210 A CN110059210 A CN 110059210A
Authority
CN
China
Prior art keywords
tile
topology
face
layer
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910192667.9A
Other languages
Chinese (zh)
Inventor
陆毅
陈长林
贾俊涛
陈超
牛红光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
92859 Troops Of Pla
Original Assignee
92859 Troops Of Pla
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 92859 Troops Of Pla filed Critical 92859 Troops Of Pla
Priority to CN201910192667.9A priority Critical patent/CN110059210A/en
Publication of CN110059210A publication Critical patent/CN110059210A/en
Pending legal-status Critical Current

Links

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The present invention relates to a kind of map vector tile method for organizing of band topology, comprising the following steps: carries out geographical segmentation to the figure layer of global sea chart, the figure layer after segmentation, which is sorted out, becomes fragment figure layer, carries out the storage of tile boundaries;Establish wing side topology component, using the wing while ergodic algorithm building figure layer while and face, create across the piece topology based on wing side.The present invention has rational design, its fragment tissue that data are carried out using holographyization general matter as basic unit, and the integrality of boundary topology information is realized using wing side topological model, to carry out effective tissue of vector tile to global sea chart, improve efficiency when across map sheet subdispatch, its spatial analysis result is accurate and reliable, can be widely applied and global sea chart process field.

Description

A kind of map vector tile method for organizing of band topology
Technical field
The invention belongs to map vector processing technology field, especially a kind of map vector tile organizer of band topology Method.
Background technique
The key problem of map vector data tissue is the construction of map data strategy of global range.Conventional map data Tissue be data dispatch using map sheet as unit, in global range can only as unit of map sheet, the problem is that: when with When uniform data service interface provides map datum service, it is low to will lead to data dispatch index efficiency, especially in across map sheet area Efficiency influence becomes apparent from when domain scheduling, while there is also element glands;In addition, there is also the Topology connections between each width map to ask Topic, because of the enterprise schema as unit of map sheet, the topology information of the element on each map sheet boundary be it is incomplete, this will lead Cause the spatial analysis result inaccuracy across map sheet on a large scale.
Summary of the invention
It is an object of the invention to overcome the deficiencies in the prior art, propose that a kind of design is reasonable, high-efficient and analyzes result Map vector tile method for organizing accurately with topology.
The present invention solves its technical problem and adopts the following technical solutions to achieve:
A kind of map vector tile method for organizing of band topology, comprising the following steps:
Step 1 carries out geographical segmentation to the figure layer of global sea chart, and the figure layer after segmentation, which is sorted out, becomes fragment figure layer, into The storage of row tile boundaries;
Step 2 establishes wing side topology component, using the wing while ergodic algorithm building figure layer while and face, creation be based on wing side Across piece topology.
The fragment figure layer physically carries out fragment according to fragmentation schema, and every of fragmentation schema has unique tile ID;Fragment figure layer contains attribute information identical with non-fragment figure layer;Every figure layer becomes a list under figure layer catalogue Only son's catalogue, and include the respective primitive table of those elements;Fragment figure layer includes the single element table of each factor kind;Tile The primitive that the combination of ID and primitive ID keep the element in the table consistent with them connects.
The primitive table includes side, face and connecting-type node:
The attribute on the side are as follows: when side is interrupted by tile boundaries, a connecting-type node will be placed in sideline-tile Intersection;Identical connecting-type node reappears in two tiles for forming boundary;All will on all sides along tile boundaries distribution There is the topology for passing through tile;Identical side reappears in two tiles for forming boundary;
The attribute in the face are as follows: had the side of a reconstruction by the face that tile boundaries are divided, and be on the boundary of each tile Sealing surface and be inserted into new boundary;
The attribute of the connecting-type node are as follows: all connecting-type nodes positioned at tile boundaries have the group for passing through tile Part.
It includes as properties that the tile ID, which uses triple ID, triple ID: for baseline, triple ID is for tieing up Topology of the shield across tile: the topology across tile only occurs between each tile in library.
The method that the step 2 establishes wing side topology component are as follows: using three defined components to mention in the primitive table of side For the continuity between node, side and face;Three topological grades are given, it will be comprising corresponding to each topological level in the primitive of side Special column;Each edge includes node information, side information and face information.
The node information is defined as: each edge will all include a start node and a termination node column, topology Information application is in the direction for defining side;The side information is defined as: side and its adjacent side are connected conduct by the right and the left side Wing side, the right are to surround node to start in a counterclockwise direction, connect a line of end node;The left side is to surround node with inverse Clockwise starts a line of connection start node;The face information is defined as: each edge all will comprising left side and The right side, the left side and the right side only rely on the direction on side to distinguish, which allows to learn its proximal surface by side, the outer ring in face and The composition of inner ring is determined by wing side topology rule, and the floating side in face will be treated as inner ring.
It is described using the wing while ergodic algorithm building figure layer while and face method are as follows:
1. determining which face drawn, area surface then is contacted with the code of face and ring table;
2. having identified initial line:
3. traversing the left side to track the left side;Traversal the right is to track the right side;
4. according to initial line is played, to complete the building on the side and face of figure layer.
Determining which face of drawing is area surface select factors by needing with attribute come given.
Across the piece topology of the creation based on wing side should follow following rule:
1. connecting node is all set in the intersection of every block of tile when side is intersected with tile boundaries to be cut, if there is A line is present in adjacent tile, and all sides to be terminated by the link node will all contain across tile topology;
2. across tile side will be from the adjacent a line being coupled on tile of the node dependence edge counter-clockwise;
3. all will appear in two tiles simultaneously while consistent with tile boundaries, and containing across the tile left side, Right side topology, and across the tile left side, the right topology;
4. being created along tile boundaries sealing surface multiple when tile boundaries split off face;
5. appearing in the connected node of tile boundaries, if side exists, will exist simultaneously in two tiles and with reference to outer Portion and internal a line, which is optional in inside and outside tile simultaneously.
The advantages and positive effects of the present invention are:
The present invention has rational design, and the fragment tissue of data is carried out using holographyization general matter as basic unit, and utilizes Wing side topological model realizes the integrality of boundary topology information, to carry out effective tissue of vector tile to global sea chart, mentions Efficiency when high across map sheet subdispatch, spatial analysis result is accurate and reliable, can be widely applied and lead with global sea chart processing Domain.
Detailed description of the invention
Fig. 1 is the storage schematic diagram of tile boundaries;
Fig. 2 is the structural schematic diagram of fragmentation schema;
Fig. 3 is the matching principle figure across tile;
Fig. 4 is the structure chart of wing side component;
Fig. 5 a is an inner ring example (face 5 is expressed as an independent ring in ring table);
Fig. 5 b is an inner ring example (free rings of two inner faces and connection side composition);
Fig. 6 is an outer ring example;
Fig. 7 is a face and the set with side;
Fig. 8 is across tile side rule schematic diagram;
Fig. 9 is tile boundaries primitive behavior schematic diagram;
Figure 10 is the example across tile side.
Specific embodiment
The embodiment of the present invention is further described below in conjunction with attached drawing.
A kind of mentality of designing of the map vector tile method for organizing of band topology is as follows:
Since the map vector data of global range inevitably includes mass data, these map datums are being handled In the process, vector data collection usually needs to manage in memory, this has specific limitation to the size of vector data.In order to break through This limitation, the present invention will realize the fragment tissue of global chart data using vector tile technology.
For the fragment organizational politics of accurate description map vector data, provide first defined below:
Geometric primitive: there are three types of geometric primitives in map vector data: point, line and face;Wherein, there are two types of types for point: real Figure node and connecting-type node.
Drawing primitive: three kinds of geometric primitives and drawing primitive combine, and can be simulated by using vector geometry any Geographical phenomenon, all primitives can be connected with each other by topological relation in addition to text.
Topological primitive: for the relationship for keeping the loke shore line primitives between tile, the primitive across tile boundaries is needed Both make dependent on tile boundaries itself (in order to keep the topological relation of tile) and it for simplifying the recovery of primitive feature Across tile extension.This patent is reached by the boundary of the triple ID of the internal reference comprising boundary or edge in current tile To this demand, and when suitable, triple ID also may include the external reference of adjacent tile edges.
Tile technology is the bottom layer realization mode for hardware and storage limitation, while should be to imaged holograph general matter Such concept structure does not influence.Because when primitive caused by tile technology is divided in independent table, they are corresponded to Attribute also destroy, so this patent is not destroyed by guaranteeing attribute list and factor kind table and rationalization solves The above problem.They are not primary all but sequentially processed, therefore can destroy and want to avoid because hardware limitation is met Element itself.These tables are stored in a figure layer, and the practical vector data collection partitioning portion for indicating tile appears under figure layer In grade catalogue.Concerned issue is the primitive being stored in numerous small vector data sets and to be stored in an independent big vector Attribute connects in data set.This is by relevant design principle standard implementation, and as each element increases by a column and closes In the column based on vector data collection, including there being the row id in the matrix of the attribute of that primitive.If five factor kinds all come Derived from primitive topology figure layer, need to increase by five additional column in primitive table.Increasing by a column for each factor kind will lead to table very Greatly, because the type of element has nearly 500.Not every factor kind can all be applied to three primitive dimensions or all productions Product or All Layers, but number is also to be easily accessible to 100 for vertical or thematic integral data.It traces back to and wants Element pointer only because performance demand.
The present invention handles fragment and data segmentation problem in primitive level, by triple ID keep across piece topology and Connection on primitive between independent attribute table of the additional factor kind column to guarantee more logical consistencies.It needs to guarantee simultaneously The reference data, size, mode etc. of tile itself and storage about tile, these are completed in tile reference layer 's.
" tile reference layer " only is used to express the polygon figure layer of tile.Other than tile boundaries and tile label, It is not related to other data.It is stored on the level of library as an individual figure layer, while the figure as tile mode Index describes all tile and those title in tile, tile in library and relationships between them.This figure layer Face element table have important role.Because it stores the attribute of each tile, it can be used for controlling each factor kind Packing density, tile data capacity and summary content, and on tile level manage vector data other metadata.
Concrete methods of realizing of the invention the following steps are included:
Step 1 carries out geographical segmentation to the figure layer of global sea chart, and the figure layer after segmentation, which is sorted out, becomes fragment figure layer, into The storage of row tile boundaries.
Fragment is that in order to reinforce the management of data and figure layer is carried out geographical segmentation;After figure layer is divided in this way Sorting out becomes fragment figure layer.Fragment figure layer contains attribute information identical with non-fragment figure layer.The logical interpretation of fragment figure layer Also identical with non-fragment figure layer.To all an independent subdirectory under figure layer catalogue be become per a piece of, and include those in piece The respective primitive table of element.Fragment figure layer is by the single element table comprising each factor kind.Pass through the knot of tile ID and primitive ID The primitive that closing keeps the element in the table consistent with them connects.For lacking the tile of data in figure layer, then in figure layer There is no subdirectory in catalogue, fragment figure layer physically carries out fragment according to fragmentation schema, every of fragmentation schema have one only One tile mark, as shown in Figure 1.
Primitive is defined as an entirety to be occurred in tile.Following paragraphs elaborates the influence of tile:
(1) exist: when while interrupted by tile boundaries when, a connecting-type node will be placed in sideline-tile intersection. Identical (geographical coordinate) connecting-type node reappears in two tiles for forming boundary.All will on all sides along tile boundaries distribution There is the topology for passing through tile.Identical (geographical coordinate) side reappears in two tiles for forming boundary.
(2) face: by tile boundaries divide face have one reconstruction side, and the boundary of each tile for sealing surface and It is inserted into new boundary.These will be embodied in the topological relation of multiple tiles.
(3) face 1 (universe face): as shown in Figure 1, face 1 (universe face) describes a special circumstances of slice boundaries.At that In the case that a little faces 1 are unique divided face, actual tile boundaries will not be stored.For example, in face 2 by tile boundaries It is the just meeting of necessary sideline for sealing surface 2 only on tile boundaries in the case that segmentation and the equal quilt cover 1 of remaining tile identify It is stored.Tile while file will only store while 1,2,3 and 4.The dotted line sideline in universe face is implicit, but is not stored.
(4) connecting-type node: all connecting-type nodes positioned at tile boundaries have the component for passing through tile.
Other two kinds of situations in need of consideration are exactly only comprising point element or 3 grades of topology-level figure layers not comprising element Tile.In these cases, tile may include solid type basic point and face 1, or only include face 1.3 grades of topologys need Face, ring, sideline, connecting-type node, face boundary rectangle table and a side variable length index.Face, ring, face boundary rectangle table are only Referring to universe face (face 1).Since ring table is referring to side table, then side table there must be.Since side table is referring to connecting node table, then Connecting node table also there must be.When the presence of table needs one, variable length is indexed, and the presence of face table needs a face external Rectangle table.While table, connecting node table and while variable length index do not include any record.
As shown in Fig. 2, due in fragment figure layer per a piece of primitive be all in other tiles those primitives separately manage Reason, thus the label for providing primitive is only unique in the tile.For the continuous spatial database of support logic, Ke Yili Replace integer code come the primitive referring to a variety of tiles of tile boundaries with triple ID.
(1) for baseline, triple ID is for safeguarding the topology across tile.The left side, the right side, the left side and right-hand column are all determined Justice is triple ID to support fragment figure layer.Triple ID contains the reference of inner topology in current tile;Other two portion Divide then referring to the primitive in external tile catalogue and tile.For example, for the face divided by tile boundaries, left region in Fig. 3 The part exterior I D will include comprising the continuous surface in other tiles.The reference for containing inside and outside tile examines software It surveys the boundary of tile and operation operates in current tile across tile boundaries or only.If figure layer is not fragmented, the left side, the right side These column of face, the left side and the right may be defined as integer column;Otherwise the external tile ID and primitive in triple ID subregion ID will be not present.
(2) topology across tile only occurs between each tile in library.Component across tile will only be increased and be used for library The tile that inner edge is crossed over.The component across tile will not be made to increased with the side on the consistent tile boundaries of library partition.
Step 2 establishes wing side topology component, using the wing while ergodic algorithm building figure layer while and face, creation be based on wing side Across piece topology.Concrete methods of realizing is as follows:
Wing side topological model is an important component of data model, its function is to provide linear network, face is opened up Flutter and keep the topological seamlessness across tile figure layer.Following part is by the component of specific definition wing side topology, wing side network time The algorithm gone through, and across tile topology.
(1) wing side component is established
The wing while topology while primitive table in using three defined components to provide the continuity between node, side and face. 1,2,3 three topological grades are given, will include the special column for corresponding to each topological level in the primitive of side.As shown in figure 4, having three A topological structure: each edge includes node, side and the information in face.This definition will be described in detail below.
1. node information.Each edge will all include a start node and a termination node column.The topology information application In the direction (digitlization direction) for defining side.
2. side information.The right and the left side will be connected in the adjacent side with it (because referred to herein as " when the wing ").The right is circular Node is started in a counterclockwise direction, connects a line of end node.The left side is to surround the node company of start of calculation in a counterclockwise direction Connect a line of start node.
3. face information.Due to the division of three-level topology, each edge all will include a left side and the right side.The left side and the right side are only It is distinguished by the direction on side.The information allows to learn its proximal surface by side.
4. inner ring and outer ring.The outer ring in one face and the composition of inner ring are determined by wing side topology rule.Moreover, The boundary in face is only considered due to not considering side inside face, and the floating side in face will be treated as inner ring.Fig. 5 a, Fig. 5 b give Having gone out the example of inner ring, (face 5 is expressed as an independent ring in ring table in Fig. 5 a, and two inner faces in Fig. 5 b and connection side are constituted Free ring) Fig. 6 gives an outer ring example (floating side).
(2) use the wing in ergodic algorithm building figure layer and face
The definition on given wing side, the face and side that each figure layer includes create in the same manner.With flat topology The reinforcement of model, corresponding viewing algorithm can apply.Fig. 7 gives a face and the set with side.In order to construct One face is needed using following algorithm:
1. determining which face should be drawn.Determining which face should be drawn will be selected by the area surface element needed with attribute It fetches given;Then area surface is contacted with the code of face and ring table.Following table gives and the consistent face element table example of Fig. 7.
Using face 3 identifies tile 95 as the primitive of 436 face elements, as follows
It is as follows corresponding to the face table of Fig. 7 about tile 95:
The ring table of Fig. 7 is as follows:
3.3 ring table example of table
2. having identified initial line: (in this example, being side 12)
3. traversing the left side to track the left side;Traversal the right is to track the right side.Because face 3 is the left side on side 12, the left side is read It records on (side 11).In 11 connection 10, in 10 connection 9, in 9 connection 8, in 8 connection 7, in 7 connection 6, side 6 is connected Side 5, in 5 connection 12.
4. side 12 has been initial line, therefore ring is accomplished.
It is assumed that a Linear element table is present in example, and each Linear element contains for distinguishing in network just The attribute column of true side selection.The value of Linear element will determine the opportunity that the rule of traversal and traversal terminate.Rising in traversal Initial point and terminating point depend on the use of user.One network can have various traversal strategies.Example below will be retouched The search of a depth-first is stated, algorithm is as follows:
1. working as front using determination according to user: (side 12).
2. reading in when then termination node in front collects all sides occurred in the node.
3. reading in the attribute value of related Linear element for each edge occurred in node.Judging whether attribute contains needs The value wanted if being, continues step 5.
4. going to step 3, above procedure is repeated.
5. judging, whether network is traversed completely, if being, is exited whole network, is otherwise gone to step 2.
(3) across the piece topology based on wing side is created
The tile across physical composition can be extended to using the web browsing on wing side.If they exist, which passing through in figure layer Using the information of previous case, can introduce across tile structure.It is assumed that Fig. 7 carries out intersection operation with tile boundaries, and New figure layer created in Figure 10 (along in Fig. 7 in 5 broad sense).
Figure 10 describes an individual face by the intersection with four tiles, cuts into four faces.Area is discussed below Divide different tile boundaries examples, including passing through wing side topology from primitive face (non-fragment) to the retrieval in tile face.
When creating across tile topology, following rule should be followed:
1. connecting node is all arranged in the intersection of every block of tile when side is intersected with tile boundaries to be cut.Such as Fig. 9 B and C.If there is a line is present in adjacent tile, all sides to be terminated by the link node will all contain across tile topology.Such as The A and B of Fig. 8.
2. across tile side will be from the adjacent a line being coupled on tile of the node dependence edge counter-clockwise.Such as Fig. 8 A and B.
3. all while consistent with tile boundaries (all coordinates on side are all on boundary lines) will appear in two simultaneously In tile (A, D, E and the F of such as Fig. 9), and contain across the tile left side, right side topology, and across the tile left side, the right topology. Such as the A and B of Fig. 8.
4. creating along tile boundaries sealing surface multiple when tile boundaries split off face, the A of Fig. 9 is seen.On boundary Side for sealing surface is equally handled in method described in c.Such as the B of Fig. 8.
5. appearing in the connected node of tile boundaries, if side exists, will exist simultaneously in two tiles and with reference to outer Portion and internal a line.A line is optional in inside and outside tile simultaneously.
Fig. 9 and Figure 10 gives the example of the original initial behavior of tile boundaries:
Actually and not comprising tile ID in triple ID, detailed step is as follows:
1. reading in the left side since the side of MJ21 tile 1, selection strides into tile MJ11, side 6;
2. the chain obtained from side 6,5,4,3,2 and 1 is included in tile MJ11;
3. striding into tile MJ12, side 1 from the side 1 in MJ11;
4. from MJ12 while 1 stride into tile MJ22 while 3;
5. passing through the chain on side 3,2 and 1;
6. striding into the side 1 of tile MJ21 from the side of MJ22 1;
7. being jumped out when the terminal for encountering face ring.
It is emphasized that embodiment of the present invention be it is illustrative, without being restrictive, therefore packet of the present invention Include and be not limited to embodiment described in specific embodiment, it is all by those skilled in the art according to the technique and scheme of the present invention The other embodiments obtained, also belong to the scope of protection of the invention.

Claims (9)

1. a kind of map vector tile method for organizing of band topology, it is characterised in that the following steps are included:
Step 1 carries out geographical segmentation to the figure layer of global sea chart, and the figure layer after segmentation, which is sorted out, becomes fragment figure layer, progress watt The storage of sheet border;
Step 2 establishes wing side topology component, using the wing while ergodic algorithm building figure layer while and face, creation based on wing side across Piece topology.
2. a kind of map vector tile method for organizing of band topology according to claim 1, it is characterised in that: the fragment Figure layer physically carries out fragment according to fragmentation schema, and every of fragmentation schema has unique tile ID;Fragment figure layer includes Identical with non-fragment figure layer attribute information;Every figure layer becomes an independent subdirectory under figure layer catalogue, and includes The respective primitive table of those elements;Fragment figure layer includes the single element table of each factor kind;The knot of tile ID and primitive ID The primitive that closing keeps the element in the table consistent with them connects.
3. a kind of map vector tile method for organizing of band topology according to claim 2, it is characterised in that: the primitive Table includes side, face and connecting-type node:
The attribute on the side are as follows: when side is interrupted by tile boundaries, a connecting-type node will be placed in the friendship of sideline-tile At remittance;Identical connecting-type node reappears in two tiles for forming boundary;All sides along tile boundaries distribution will all be worn The more topology of tile;Identical side reappears in two tiles for forming boundary;
The attribute in the face are as follows: had the side of a reconstruction by the face that tile boundaries are divided, and on the boundary of each tile in order to seal It closes face and is inserted into new boundary;
The attribute of the connecting-type node are as follows: all connecting-type nodes positioned at tile boundaries have the component for passing through tile.
4. a kind of map vector tile method for organizing of band topology according to claim 2, it is characterised in that: the tile It includes as properties that ID, which uses triple ID, triple ID: for baseline, triple ID is for safeguarding the topology across tile: Topology across tile only occurs between each tile in library.
5. a kind of map vector tile method for organizing of band topology according to claim 1, it is characterised in that: the step 2 methods for establishing wing side topology component are as follows: while provided in primitive table using three defined components node, while and face between Continuity;Three topological grades are given, will include the special column for corresponding to each topological level in the primitive of side;Each edge includes Node information, side information and face information.
6. a kind of map vector tile method for organizing of band topology according to claim 5, it is characterised in that: the node Information is defined as: each edge all will be applied to define side comprising a start node and a termination node column, topology information Direction;The side information is defined as: by when the adjacent side with it is connected as the wing, the right is to surround knot for the right and the left side Point is started in a counterclockwise direction, connects a line of end node;The left side is to surround node to start connection in a counterclockwise direction The a line of start node;The face information is defined as: each edge all will include a left side and the right side, and the left side and the right side are only It is distinguished by the direction on side, which allows to learn its proximal surface by side, and the outer ring in face and the composition of inner ring are by the wing What side topology rule determined, the floating side in face will be treated as inner ring.
7. a kind of map vector tile method for organizing of band topology according to claim 1, it is characterised in that: the use The wing while ergodic algorithm building figure layer while and face method are as follows:
1. determining which face drawn, area surface then is contacted with the code of face and ring table;
2. having identified initial line:
3. traversing the left side to track the left side;Traversal the right is to track the right side;
4. according to initial line is played, to complete the building on the side and face of figure layer.
8. a kind of map vector tile method for organizing of band topology according to claim 7, it is characterised in that: the determination Drawing which face is area surface select factors by needing with attribute come given.
9. a kind of map vector tile method for organizing of band topology according to claim 1, it is characterised in that: the creation Across piece topology based on wing side should follow following rule:
1. connecting node is all arranged in the intersection of every block of tile, if there is one when side is intersected with tile boundaries to be cut While being present in adjacent tile, all sides to be terminated by the link node will all contain across tile topology;
2. across tile side will be from the adjacent a line being coupled on tile of the node dependence edge counter-clockwise;
3. all will appear in two tiles simultaneously while consistent with tile boundaries, and contain across the tile left side, the right side Topology, and across the tile left side, the right topology;
4. being created along tile boundaries sealing surface multiple when tile boundaries split off face;
5. appear in the connected node of tile boundaries, if side exists, will exist simultaneously in two tiles and with reference to external and Internal a line, which is optional in inside and outside tile simultaneously.
CN201910192667.9A 2019-03-14 2019-03-14 A kind of map vector tile method for organizing of band topology Pending CN110059210A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910192667.9A CN110059210A (en) 2019-03-14 2019-03-14 A kind of map vector tile method for organizing of band topology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910192667.9A CN110059210A (en) 2019-03-14 2019-03-14 A kind of map vector tile method for organizing of band topology

Publications (1)

Publication Number Publication Date
CN110059210A true CN110059210A (en) 2019-07-26

Family

ID=67316978

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910192667.9A Pending CN110059210A (en) 2019-03-14 2019-03-14 A kind of map vector tile method for organizing of band topology

Country Status (1)

Country Link
CN (1) CN110059210A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112233240A (en) * 2020-10-29 2021-01-15 湖北亿咖通科技有限公司 Three-dimensional vector data slicing method and device of three-dimensional vector map and electronic equipment
CN113626550A (en) * 2021-08-05 2021-11-09 生态环境部卫星环境应用中心 Image tile map service method based on triple bidirectional index and optimized cache
CN114048280A (en) * 2022-01-07 2022-02-15 成都国星宇航科技有限公司 Vector slice processing method, device, server and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101655886A (en) * 2009-09-18 2010-02-24 永凯软件技术(上海)有限公司 Realizing method of surface patch extraction based on engineering drawing three-dimensional reconstruction system
CN102622419A (en) * 2012-02-22 2012-08-01 中国人民解放军92859部队 Conversion method of DNC (Digital Nautical Chart) and ENC (Electronic Nautical Chart) data models
CN102646282A (en) * 2012-02-22 2012-08-22 中国人民解放军92859部队 Digital nautical chart (DNC) surface geometric construction method based on adjacent edge binary tree
CN103455624A (en) * 2013-09-16 2013-12-18 湖北文理学院 Implement method of lightweight-class global multi-dimensional remote-sensing image network map service
CN107481306A (en) * 2017-07-05 2017-12-15 国家电网公司 A kind of method of three-dimension interaction

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101655886A (en) * 2009-09-18 2010-02-24 永凯软件技术(上海)有限公司 Realizing method of surface patch extraction based on engineering drawing three-dimensional reconstruction system
CN102622419A (en) * 2012-02-22 2012-08-01 中国人民解放军92859部队 Conversion method of DNC (Digital Nautical Chart) and ENC (Electronic Nautical Chart) data models
CN102646282A (en) * 2012-02-22 2012-08-22 中国人民解放军92859部队 Digital nautical chart (DNC) surface geometric construction method based on adjacent edge binary tree
CN103455624A (en) * 2013-09-16 2013-12-18 湖北文理学院 Implement method of lightweight-class global multi-dimensional remote-sensing image network map service
CN107481306A (en) * 2017-07-05 2017-12-15 国家电网公司 A kind of method of three-dimension interaction

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
陈长林 等: ""DNC与ENC的自动转换方法"", 《武汉大学学报 信息科学报》 *
陈长林: ""同源多尺度海图生产体系设计及其关键技术研究"", 《中国博士学位论文全文数据库 基础科学辑》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112233240A (en) * 2020-10-29 2021-01-15 湖北亿咖通科技有限公司 Three-dimensional vector data slicing method and device of three-dimensional vector map and electronic equipment
CN112233240B (en) * 2020-10-29 2021-10-22 湖北亿咖通科技有限公司 Three-dimensional vector data slicing method and device of three-dimensional vector map and electronic equipment
CN113626550A (en) * 2021-08-05 2021-11-09 生态环境部卫星环境应用中心 Image tile map service method based on triple bidirectional index and optimized cache
CN113626550B (en) * 2021-08-05 2022-02-25 生态环境部卫星环境应用中心 Image tile map service method based on triple bidirectional index and optimized cache
CN114048280A (en) * 2022-01-07 2022-02-15 成都国星宇航科技有限公司 Vector slice processing method, device, server and storage medium

Similar Documents

Publication Publication Date Title
Beckmann et al. A revised R*-tree in comparison with related index structures
CN110059210A (en) A kind of map vector tile method for organizing of band topology
Matsuyama et al. A file organization for geographic information systems based on spatial proximity
Goodrich et al. Dynamic trees and dynamic point location
Aluru Quadtrees and octrees
CN109635068A (en) Mass remote sensing data high-efficiency tissue and method for quickly retrieving under cloud computing environment
CN105608142B (en) A kind of storage method and device of Json data
CN106528622B (en) It is a kind of to vacuate method towards S57 chart data
CA2519179C (en) A computer implemented compact 0-complete tree dynamic storage structure and method of processing stored data
CN110309248A (en) A method of the traffic route network based on Voronoi diagram divides traffic zone automatically
Subramanian A fully dynamic data structure for reachability in planar digraphs
CN107368545A (en) A kind of De-weight method and device based on MerkleTree deformation algorithms
Agarwal A deterministic algorithm for partitioning arrangements of lines and its application
US7098912B1 (en) Method of modifying a volume mesh using sheet insertion
Szymczak Subdomain aware contour trees and contour evolution in time-dependent scalar fields
US7646386B2 (en) Modifying a path in a drawing
CN117454206A (en) Clustering method, system, equipment and computer readable medium for wafer defect
CN105740371A (en) Density-based incremental clustering data mining method and system
Lefèvre et al. Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees
CN115525918A (en) Encryption method and system for paperless office file
Kvet Database Block Management using Master Index
CN108170987B (en) BIM technology-based PBS structure automatic hanging method
Lai et al. HV/VH trees: a new spatial data structure for fast region queries
Vagena et al. Efficient processing of XML containment queries using partition-based schemes
Chen et al. Topologically robust mesh modeling: concepts, data structures and operations

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
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20190726

WD01 Invention patent application deemed withdrawn after publication