CN110765298B - Tile coding method for decoupling geometric attributes of vector data - Google Patents
Tile coding method for decoupling geometric attributes of vector data Download PDFInfo
- Publication number
- CN110765298B CN110765298B CN201910992103.3A CN201910992103A CN110765298B CN 110765298 B CN110765298 B CN 110765298B CN 201910992103 A CN201910992103 A CN 201910992103A CN 110765298 B CN110765298 B CN 110765298B
- Authority
- CN
- China
- Prior art keywords
- tile
- information
- geometric
- attribute
- range
- 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
Links
Images
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/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/58—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
- G06F16/587—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using geographical or spatial information, e.g. location
Abstract
The invention discloses a tile coding method for decoupling geometric attributes of vector data, which comprises the following steps: (1) initializing vector data slice parameters; (2) storing the tile attribute information; (3) slicing vector data; (4) encoding geometric information; (5) and (5) putting the geometrical information of the tiles into a storage. The invention provides a vector tile data organization method with decoupled geometric attributes, which stores geometric information based on longitude and latitude relative coordinates and realizes independent and associated storage of the geometric information and the attribute information by using a tile association strategy, thereby meeting the dynamic projection drawing requirements of an application end and reducing the data storage pressure.
Description
Technical Field
The invention relates to the technical field of slicing of GIS spatial data, in particular to a tile coding method for decoupling geometric attributes of vector data.
Background
Vector data is an effective carrier for expressing geospatial information, and with the continuous development of observation and measurement technologies, large-scale vector data becomes a data base for many practical applications. In order to be able to efficiently visualize and express large-scale vector data, the vector tile technology is currently the most approved solution.
The existing vector tiles mainly surround the requirement of static visualization in the data organization level, so that the internal geometric information of the vector tiles is stored according to the pixel coordinates of a screen, and each tile stores the geometry and the attributes in a centralized manner, which causes difficulty in dynamic projection transformation and drawing by using the vector tiles, and causes the attribute information of the same space entity to be repeatedly stored in the vector tiles of different levels, thereby increasing the storage burden.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a tile coding method for decoupling geometric attributes of vector data, and to provide a slicing method for decoupling geometry and attributes of vector data in a Spatialite spatial database when a data source is the Spatialite spatial database, and to realize compressed storage of geometric information of vector tiles by type conversion of relative coordinates inside the tiles and by means of corresponding coordinate scaling coefficients.
In order to solve the technical problem, the invention provides a tile coding method for decoupling geometric attributes of vector data, which comprises the following steps:
(1) initializing vector data slice parameters and setting main parameters of vector data slices;
(2) storing the tile attribute information; traversing each record of a spatial database, acquiring a tile range of geometric information of each record in a current level, wherein the tile range comprises a left lower tile LXY and a right upper tile LXY, correcting the range to obtain a minimum level tile which can completely contain the range, calculating a unique ID of the minimum level tile IDcode as an attribute tile, sequentially acquiring a target field attribute value of the current record, temporarily storing the attribute value into an attribute value memory with the attribute tile ID as an identifier, and finally importing the tile attribute information into the database by taking the ID of the attribute tile as the unique ID of the tile attribute information;
(3) slicing vector data; initializing a tile calculator, calculating a tile range of a current vector data layer range, wherein the tile range comprises a lower left tile LXY and an upper right tile LXY, traversing each tile in the tile range, solving records of all spatial databases intersected with the current tile through topological operation of the spatial databases, and cutting geometric data of each record by using the range of the current tile to obtain tile data;
(4) encoding geometric information; organizing the geometric information in the tiles according to the coordinate precision parameter setting in the step (1) in a local coordinate mode, wherein each piece of geometric information needs to be bound with the ID of a source data record and the ID of tile attribute information because the geometric information in the tiles can be sourced from a plurality of records in a database;
(5) putting the geometric information of the tiles into a warehouse; and (4) calculating the IDcode of the current tile as the unique ID of the tile geometric information, and importing the tile geometric information which is encoded in the step (4) into the database.
Preferably, in step (1), the main parameters of the vector data slice include a target layer, a slice level, a projection, a coordinate precision, a cutting mode, and a target attribute field for setting each layer.
Preferably, in the step (2), the step of storing the tile attribute information specifically includes the following steps:
(21) determining the tile range of the geometric information of each record in the current level, calculating the total number of rows and columns of tiles of a map layer according to a tile cutting mode, calculating the size of each tile according to the total number of rows and columns of tiles of the map layer, calculating the offset between coordinates of a left lower corner and a right upper corner of a bounding box and the left lower corner of the map by using the bounding box of the geometric information, and obtaining the tiles where coordinate points of the left lower corner and the right upper corner of the bounding box are located, namely a left lower corner tile LXY and a right upper corner tile LXY according to the ratio of the offset to the size of the tiles;
(22) determining a minimum level tile that is capable of fully encompassing the range; performing right shift operation on the row and column of the tile range of the current level, and performing descending operation on the level until the lower left tile row and column is equal to the upper right tile row and column to obtain a minimum level tile LXY which can completely contain the range;
(23) calculating a tile IDcode; the IDcode value of the tile is INT64 type, the tile can be uniquely identified, and the IDcode value is obtained by calculating the hierarchy, column value and row value of the tile; the first 56 bits store row and column information of the tile, the last 8 bits store hierarchy information of the tile, and the IDcode of the tile is calculated according to the formula width (_ int64) Y + (_ int64) X + (((_ int64) L) < <56), wherein width is the width of the tile, X and Y respectively represent the column value and the row value of the tile, and L is the hierarchy of the tile.
Preferably, in the step (4), the geometric information encoding specifically includes the following steps:
(41) the geometric information in the tiles is organized according to a local coordinate mode; according to the configuration of display precision, performing type conversion on relative coordinates inside a tile, converting coordinate values from a double-precision floating point number double type of 8 bytes to a short integer type of 2 bytes or an integer type of 4 bytes by using a corresponding coordinate scaling factor, thereby achieving the compressed storage of vector tile geometric information, and according to a formula d (X-currentVertexTileBound.x0)/currentVertexTileBound.width (), wherein d is a coordinate scaling factor, X is a coordinate X value, CurentVertexTileUnd.x0 is a tile range where a current vertex is located, CurentVertexTileBound.wih () is the width of a tile where the current vertex is located, a coordinate Y value is calculated in the same way, and a calculation formula of d is ((int)0X1 < (sizeof (VertexT 8/2)) -1, wherein the coordinate values are stored in a compressed structure after being stored;
(42) the geometric information needs to be bound with the ID of the source data record and the ID of the tile attribute information; the geometric information in the tile database is organized in a data flow mode, the first two bytes in the data flow store attribute ID information, the third byte stores tile level information, the fourth byte stores whether the geometric data is multi-point, multi-line and multi-face type information, the fifth byte stores the geometric type information, the sixth and seventh bytes store point information, all the data flows store specific geometric information, and if the geometric data is multi-point, multi-line and multi-face type, the last byte stores an end mark.
The invention has the beneficial effects that: the invention provides a vector tile data organization method with decoupled geometric attributes, which stores geometric information based on longitude and latitude relative coordinates and realizes independent and associated storage of the geometric information and the attribute information by using a tile association strategy, thereby meeting the dynamic projection drawing requirements of an application end and reducing the data storage pressure.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
FIG. 2(a) is a schematic diagram of the hierarchical block organization structure of the vector tile of the present invention.
FIG. 2(b) is a block-wise organization diagram of the vector tiles of the present invention.
Fig. 3 is a schematic diagram of storage of attribute information association according to the present invention.
FIG. 4 is a schematic diagram of the relative coordinate system inside the tile of the present invention.
FIG. 5 is a diagram of a geometric information coding memory block according to the present invention.
Detailed Description
As shown in fig. 1, a tile encoding method for geometric attribute decoupling of vector data includes the following steps:
(1) initializing vector data slice parameters and setting main parameters of vector data slices;
(2) and (3) putting tile attribute information into a warehouse: traversing each record of a spatial database, acquiring a tile range of geometric information of each record in a current level, wherein the tile range comprises a left lower tile LXY and a right upper tile LXY, correcting the range to obtain a minimum level tile which can completely contain the range, calculating a unique ID of the minimum level tile IDcode as an attribute tile, sequentially acquiring a target field attribute value of the current record, temporarily storing the attribute value into an attribute value memory with the attribute tile ID as an identifier, and finally importing the tile attribute information into the database by taking the ID of the attribute tile as the unique ID of the tile attribute information;
(3) vector data slicing: initializing a tile calculator, calculating a tile range of a current vector data layer range, wherein the tile range comprises a lower left tile LXY and an upper right tile LXY, traversing each tile in the tile range, solving records of all spatial databases intersected with the current tile through topological operation of the spatial databases, and cutting geometric data of each record by using the range of the current tile to obtain tile data;
(4) and (3) encoding geometric information: organizing the geometric information in the tiles according to the coordinate precision parameter setting in the step (1) in a local coordinate mode, wherein each piece of geometric information needs to be bound with the ID of a source data record and the ID of tile attribute information because the geometric information in the tiles can be sourced from a plurality of records in a database;
(5) and (3) putting the geometrical information of the tiles into a warehouse: and (4) calculating the IDcode of the current tile as the unique ID of the tile geometric information, and importing the tile geometric information which is encoded in the step (4) into the database.
The vector tiles are layered according to a certain mathematical rule and are divided into tile matrixes with fixed sizes according to a fixed multi-level scale, and the tile matrixes are stored in a database according to a naming rule to form a multi-layer pyramid structure with the detailed data degree from low to high and the number of the tiles from small to large, as shown in fig. 2(a) and 2 (b).
Acquiring main parameters of vector data slices through an interactive interface: target layers (data sources), slice levels, projections, coordinate precision, cutting modes, and setting target attribute fields for each layer.
Creating and initializing a metadata table of the tile database, wherein the metadata table comprises fields such as a database map range, a tile maximum level, a tile cutting mode and the like; and creating a layer information table, wherein the layer information table comprises fields such as layer names, layer tile levels, geometric types and coordinate storage formats.
Creating and initializing a layer attribute information table, wherein the layer attribute information table comprises information such as attribute names, attribute types and the like; creating a tile attribute information table, wherein the tile attribute information table comprises fields such as attribute tile IDs, levels, rows, columns, attribute information and the like; creating a tile geometric information table, wherein the tile geometric information table comprises fields such as geometric tile IDs, rows, columns and geometric information; initializing property tiles and geometry tiles to insert SQL statements.
Traversing each record in a data table in a Spatialite spatial database, obtaining geometric information to obtain a bounding box of the current record, and calculating a minimum hierarchy tile which can completely contain the geometric data of the current record by the bounding box, wherein as shown in fig. 3, the tile ID is used as an ID of an attribute tile in the tile database, and the ID calculation formula is width (_ int64) Y + (_ int64) X + (((_ int64) L) < <56), wherein width is the width of the tile, X and Y respectively represent a column value and a row value of the tile, and L is the hierarchy of the tile; and obtaining target field attribute information, saving the attribute information into a minimum level tile which can completely contain the geometric data of the current record, and taking the tile ID as the ID of the attribute tile in the tile database.
Creating and initializing a layer attribute information table, wherein the layer attribute information table comprises information such as attribute names, attribute types and the like; creating a tile attribute information table, wherein the tile attribute information table comprises fields such as attribute tile IDs, levels, rows, columns, attribute information and the like; creating a tile geometric information table, wherein the tile geometric information table comprises fields such as geometric tile IDs, rows, columns and geometric information; initializing property tiles and geometry tiles to insert SQL statements.
The tile attribute information is organized in a data stream, and since there is a case where attribute information of a plurality of database records is in a single tile, the attribute information of each database record in the data stream is marked with fid (ID of the database record) at the beginning, followed by attribute information of a fixed size.
And calculating the tile range (the lower left tile LXY and the upper right tile LXY) of the current vector data layer range according to each database record bounding box in the D, traversing each tile in the tile range, solving the records of all spatial databases intersected with the current tile through the topological operation of the spatial database, and cutting the geometric data of each record by using the range of the current tile to obtain the tile data.
The geometric information of each tile is organized according to the local coordinate mode, the relative coordinate inside the tile is subjected to type conversion according to the configuration of display precision, as shown in fig. 4, the coordinate values are converted from a double-precision floating-point double type of 8 bytes to a short integer short type of 2 bytes or an integer inter type of 4 bytes, with the aid of corresponding coordinate scaling coefficients, thereby achieving the compression storage of the geometric information of the vector tiles according to the formula d (x-CurrentVertexTileBound.x0)/CurrentVertexTileBound.Width (), wherein d is a coordinate scaling coefficient, X is a coordinate X value, currentvertexttilebound.x0 is a tile range where a current vertex is located, currentvertexttilebound.width () is a width of a tile where the current vertex is located, a calculation mode of the coordinate Y value is the same as that, and a calculation formula of d is (((int)0X1) < (sizeof (VertexT) 8/2)) -1, wherein VertexT is a storage structure after coordinate compression.
Since the geometric information in the tile may be derived from multiple records in the database, each geometric information needs to be bound with the ID of the source data record and the ID of the tile attribute information, the geometric information in the tile database is organized in a data stream manner, the first two bytes in the data stream store the attribute ID information, the third byte stores the tile hierarchy information, the fourth byte stores whether the geometric data is of multi-point, multi-line, and multi-surface types, the fifth byte stores the geometric type information, the sixth and seventh bytes store the point information, all the subsequent data streams store specific geometric information, and if the geometric data is of multi-point, multi-line, and multi-surface types, the last byte stores an end mark, as shown in fig. 5.
The invention provides a vector tile data organization method with decoupled geometric attributes, which stores geometric information based on longitude and latitude relative coordinates and realizes independent and associated storage of the geometric information and the attribute information by using a tile association strategy, thereby meeting the dynamic projection drawing requirements of an application end and reducing the data storage pressure.
Claims (3)
1. A tile coding method for decoupling geometric attributes of vector data is characterized by comprising the following steps:
(1) initializing vector data slice parameters and setting parameters of vector data slices; parameters of the vector data slice comprise a target layer, a slice level, projection, coordinate precision, a cutting mode and a target attribute field for setting each layer;
(2) storing the tile attribute information; traversing each record of a spatial database, acquiring a tile range of geometric information of each record in a current level, wherein the tile range comprises a left lower tile LXY and a right upper tile LXY, correcting the range to obtain a minimum level tile which can completely contain the range, calculating a unique ID of the minimum level tile IDcode as an attribute tile, sequentially acquiring a target field attribute value of the current record, temporarily storing the attribute value into an attribute value memory with the attribute tile ID as an identifier, and finally importing the tile attribute information into the database by taking the ID of the attribute tile as the unique ID of the tile attribute information;
(3) slicing vector data; initializing a tile calculator, calculating a tile range of a current vector data layer range, wherein the tile range comprises a lower left tile LXY and an upper right tile LXY, traversing each tile in the tile range, solving records of all spatial databases intersected with the current tile through topological operation of the spatial databases, and cutting geometric data of each record by using the range of the current tile to obtain tile data;
(4) encoding geometric information; organizing the geometric information in the tiles according to the coordinate precision parameter setting in the step (1) in a local coordinate mode, wherein each piece of geometric information needs to be bound with the ID of a source data record and the ID of tile attribute information because the geometric information in the tiles can be sourced from a plurality of records in a database;
(5) putting the geometric information of the tiles into a warehouse; and (4) calculating the IDcode of the current tile as the unique ID of the tile geometric information, and importing the tile geometric information which is encoded in the step (4) into the database.
2. The method for coding the tiles with decoupled geometric attributes of the vector data according to claim 1, wherein the step (2) of storing the tile attribute information specifically comprises the following steps:
(21) determining the tile range of the geometric information of each record in the current level, calculating the total number of rows and columns of tiles of a map layer according to a tile cutting mode, calculating the size of each tile according to the total number of rows and columns of tiles of the map layer, calculating the offset between coordinates of a left lower corner and a right upper corner of a bounding box and the left lower corner of the map by using the bounding box of the geometric information, and obtaining the tiles where coordinate points of the left lower corner and the right upper corner of the bounding box are located, namely a left lower corner tile LXY and a right upper corner tile LXY according to the ratio of the offset to the size of the tiles;
(22) determining a minimum level tile that is capable of fully encompassing the range; performing right shift operation on the row and column of the tile range of the current level, and performing descending operation on the level until the lower left tile row and column is equal to the upper right tile row and column to obtain a minimum level tile LXY which can completely contain the range;
(23) calculating a tile IDcode; the IDcode value of the tile is INT64 type, the tile can be uniquely identified, and the IDcode value is obtained by calculating the hierarchy, column value and row value of the tile; the first 56 bits store row and column information of the tile, the last 8 bits store hierarchy information of the tile, and the IDcode of the tile is calculated according to the formula width (_ int64) Y + (_ int64) X + (((_ int64) L) < <56), wherein width is the width of the tile, X and Y respectively represent the column value and the row value of the tile, and L is the hierarchy of the tile.
3. The tile coding method for geometric attribute decoupling of vector data according to claim 1, wherein in the step (4), the geometric information coding specifically comprises the following steps:
(41) the geometric information in the tiles is organized according to a local coordinate mode; according to the configuration of display precision, performing type conversion on relative coordinates inside a tile, converting coordinate values from a double-precision floating point number double type of 8 bytes to a short integer type of 2 bytes or an integer type of 4 bytes by using a corresponding coordinate scaling factor, thereby achieving the compressed storage of vector tile geometric information, and according to a formula d (X-currentVertexTileBound.x0)/currentVertexTileBound.width (), wherein d is a coordinate scaling factor, X is a coordinate X value, CurentVertexTileUnd.x0 is a tile range where a current vertex is located, CurentVertexTileBound.wih () is the width of a tile where the current vertex is located, a coordinate Y value is calculated in the same way, and a calculation formula of d is ((int)0X1 < (sizeof (VertexT 8/2)) -1, wherein the coordinate values are stored in a compressed structure after being stored;
(42) the geometric information needs to be bound with the ID of the source data record and the ID of the tile attribute information; the geometric information in the tile database is organized in a data flow mode, the first two bytes in the data flow store attribute ID information, the third byte stores tile level information, the fourth byte stores whether the geometric data is multi-point, multi-line and multi-face type information, the fifth byte stores the geometric type information, the sixth and seventh bytes store point information, all the data flows store specific geometric information, and if the geometric data is multi-point, multi-line and multi-face type, the last byte stores an end mark.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910992103.3A CN110765298B (en) | 2019-10-18 | 2019-10-18 | Tile coding method for decoupling geometric attributes of vector data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910992103.3A CN110765298B (en) | 2019-10-18 | 2019-10-18 | Tile coding method for decoupling geometric attributes of vector data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110765298A CN110765298A (en) | 2020-02-07 |
| CN110765298B true CN110765298B (en) | 2022-03-15 |
Family
ID=69332688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910992103.3A Active CN110765298B (en) | 2019-10-18 | 2019-10-18 | Tile coding method for decoupling geometric attributes of vector data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110765298B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116830579A (en) * | 2021-02-09 | 2023-09-29 | Oppo广东移动通信有限公司 | Geometric reconstruction method, decoder, and computer storage medium |
| CN115086716B (en) * | 2021-03-12 | 2023-09-08 | 腾讯科技（深圳）有限公司 | Method and device for selecting neighbor points in point cloud and coder-decoder |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103412962A (en) * | 2013-09-04 | 2013-11-27 | 国家测绘地理信息局卫星测绘应用中心 | Storage method and reading method for mass tile data |
| US8872848B1 (en) * | 2010-09-29 | 2014-10-28 | Google Inc. | Rendering vector data as tiles |
| CN106384371A (en) * | 2016-09-20 | 2017-02-08 | 国家基础地理信息中心 | Map drawing method based on vector tile |
| CN107180033A (en) * | 2016-03-09 | 2017-09-19 | 高德软件有限公司 | A kind of electronic map data storage method and device |
| CN108133044A (en) * | 2018-01-12 | 2018-06-08 | 适普远景遥感信息技术（北京）有限公司 | Space big data three-dimensional visualization method and platform based on attribute separation |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150379957A1 (en) * | 2014-06-30 | 2015-12-31 | Ulrich Roegelein | Mobile tile renderer for vector data |
-
2019
- 2019-10-18 CN CN201910992103.3A patent/CN110765298B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8872848B1 (en) * | 2010-09-29 | 2014-10-28 | Google Inc. | Rendering vector data as tiles |
| CN103412962A (en) * | 2013-09-04 | 2013-11-27 | 国家测绘地理信息局卫星测绘应用中心 | Storage method and reading method for mass tile data |
| CN107180033A (en) * | 2016-03-09 | 2017-09-19 | 高德软件有限公司 | A kind of electronic map data storage method and device |
| CN106384371A (en) * | 2016-09-20 | 2017-02-08 | 国家基础地理信息中心 | Map drawing method based on vector tile |
| CN108133044A (en) * | 2018-01-12 | 2018-06-08 | 适普远景遥感信息技术（北京）有限公司 | Space big data three-dimensional visualization method and platform based on attribute separation |
Non-Patent Citations (1)
| Title |
|---|
| 基于矢量瓦片的矢量数据组织方法研究;孙晨龙等;《测绘与空间地理信息》;20160430;第39卷(第4期);122-124 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110765298A (en) | 2020-02-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102306180B (en) | Modeling method based on mass laser radar grid point cloud data | |
| CN102609525B (en) | Method for dissecting and unifying geographic grid based on longitude and latitude | |
| CN103425772B (en) | A kind of mass data inquiry method with multidimensional information | |
| CN102411616B (en) | Method and system for storing data and data management method | |
| CN110245368A (en) | A kind of the structuring processing and storage method of BIM data | |
| CN104199986A (en) | Vector data space indexing method base on hbase and geohash | |
| US20130339371A1 (en) | Spatio-temporal data management system, spatio-temporal data management method, and program thereof | |
| CN107766433B (en) | Range query method and device based on Geo-BTree | |
| US9877031B2 (en) | System and method for multi-resolution raster data processing | |
| CN110765298B (en) | Tile coding method for decoupling geometric attributes of vector data | |
| CN106649882B (en) | Spatial data management middleware applied to telecommunication field and implementation method thereof | |
| CN105550977A (en) | Parallel mode grid image slicing method | |
| CN105956165A (en) | Tile type large file organization storage method of three-dimensional model data | |
| CN111339599A (en) | Conversion method from BIM model to GIS model | |
| Zlatanova | 3D geometries in spatial DBMS | |
| CN116720480A (en) | Method and device for establishing unified identifier of city management element | |
| Lai et al. | A spatial multi-scale integer coding method and its application to three-dimensional model organization | |
| CN110475204A (en) | A kind of geography fence inverse address analytic method, device and equipment | |
| CN110019632A (en) | A kind of geographic element shape analysis method based on shape tree | |
| He et al. | Data conversion between CAD and GIS in land planning | |
| CN109492069B (en) | Ray computing unit-based mobile cube parallel computing method and system | |
| CN109597865B (en) | Massive geographic information data storage and retrieval method based on embedded platform | |
| CN113032405A (en) | Spatio-temporal data management method, system, host and computer readable storage medium | |
| Weiss et al. | Supercubes: A high-level primitive for diamond hierarchies | |
| CN117392331B (en) | Visualization method of CAD file in three-dimensional scene based on vector tile serialization |
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 | ||
| CB02 | Change of applicant information |
Address after: No.1 Lingshan South Road, Qixia District, Nanjing City, Jiangsu Province 210046 Applicant after: THE 28TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY Group Corp. Address before: 210000 No. 1 East Garden Street, Qinhuai District, Jiangsu, Nanjing Applicant before: THE 28TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY Group Corp. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |