CN101586963B - Map coordinates transformation method based on shape fidelity - Google Patents
Map coordinates transformation method based on shape fidelity Download PDFInfo
- Publication number
- CN101586963B CN101586963B CN2009100629811A CN200910062981A CN101586963B CN 101586963 B CN101586963 B CN 101586963B CN 2009100629811 A CN2009100629811 A CN 2009100629811A CN 200910062981 A CN200910062981 A CN 200910062981A CN 101586963 B CN101586963 B CN 101586963B
- Authority
- CN
- China
- Prior art keywords
- coordinate
- coordinate system
- coordinates
- shape
- 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.)
- Active
Links
- 238000011426 transformation method Methods 0.000 title claims abstract description 6
- 230000006835 compression Effects 0.000 claims abstract description 22
- 238000007906 compression Methods 0.000 claims abstract description 22
- 238000010606 normalization Methods 0.000 claims abstract description 4
- 238000004422 calculation algorithm Methods 0.000 claims description 13
- 230000009466 transformation Effects 0.000 claims description 6
- 238000000034 method Methods 0.000 abstract description 20
- 230000008569 process Effects 0.000 abstract description 8
- 238000006243 chemical reaction Methods 0.000 abstract description 2
- 230000001131 transforming effect Effects 0.000 abstract 1
- 230000008859 change Effects 0.000 description 4
- 230000000903 blocking effect Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 238000011282 treatment Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 238000009432 framing Methods 0.000 description 1
- 239000000047 product Substances 0.000 description 1
Images
Abstract
The invention provides a map coordinates transformation method based on shape fidelity, comprising the steps of: 1) coordinates conversion, namely, a high-accuracy virtual coordinate system is established so that an original coordinate system and an objective coordinate system can be simultaneously visible under the coordinate system; 2) movement of coordinates, namely, all the coordinates are moved from the original coordinate system to the objective coordinate system on the basis of remaining shape of road network; 3) normalization of coordinates, namely, the virtual coordinate system is transformed into the objective coordinate system via coordinate scaling; 4) compression of shape points, namely, on the basis of remaining fundamental shape of the road network and not causing new LINK reversion, unnecessary shape points are removed; 5) processing of LINK reversion, namely, the existing LINK reversion problem is solved by moving objective coordinates. With the method, the shape of the road network can be remained to a maximum extent on the basis of avoiding the generation of LINK reversion problem in the process of transforming map coordinate system.
Description
Technical field
The invention belongs to the electronic chart field, particularly relate to a kind of map of navigation electronic Data Format Transform process.
Background technology
In the map of navigation electronic Data Format Transform process, often need be with the origin coordinate system transform of high-precision coordinate system to low precision.Common coordinate transformation method is after coordinate is carried out transformation of scale, does to round up or directly truncation.Because LINK (highway section) angle that round-off error causes changes, and problems such as road shape distortion and LINK counter-rotating often occur.Cause trouble for the map match and the voice guide of navigational system, influence the map display effect of navigational system simultaneously.
Relevant explanation of nouns:
(1.MESH mesh)
Navigational system management for convenience and inquiry map datum by certain geographic coordinate scope, are stored the map datum framing usually.A geographic coordinate scope like this is called a MESH, and each MESH distributes a unique identification by geographic position and range size, is called MESH CODE (mesh numbering).The present invention based on coordinate format all be with integer representation with respect to normalized coordinates in the MESH of MESH lower left corner skew, be a kind of relative coordinate, and all coordinates are integer.
(2.NODE node)
Be used to represent the path connected network in the navigation map, the virtual node object that comes out.A crossing that is interpreted as real road that can be similar to.Be called border NODE at the borderline NODE of MESH, border NODE is used for the relation of continuing of the road data of related different MESH.It is considered herein that border NODE continue and only the continue LINK of two different MESH.
(3.LINK highway section)
Be used to represent the shaped form object of path between NODE and the NODE in the navigation map, form by two NODE and some shape points.The real road that is interpreted as that can be similar to connects one section road at two crossings.
4. form point compression
In order between road shape and data capacity, to obtain a balance, need to remove unnecessary shape point with the form point compression algorithm.Form point compression algorithm Ubox Lars form point compression algorithm commonly used now and distance limit difference form point compression algorithm.
5.LINK counter-rotating
Because coordinate system difference and conversion method error, cause the road phase relation of target data to compare and overlap or the reverse problem with raw data.As shown in Figure 1, left side figure is a raw data; In figure be the target data that is converted to by the direct mode of blocking, the LINK counter-rotating has taken place.Reverse has appearred in L1 and L2 in the middle figure target data, and L3 and L4 have occurred overlapping.
Summary of the invention
Problem to be solved by this invention is: a kind of map coordinates transformation method based on shape fidelity is provided, use this method in the map of navigation electronic origin coordinate system transform, particularly the high-precision coordinate system is in the process of low precision origin coordinate system transform, can on the basis of avoiding producing LINK counter-rotating problem, reduce the shape distortion of road network to greatest extent.
The step of the technical solution adopted in the present invention comprises:
1) coordinate transformation is promptly set up a high-precision virtual coordinates system, and simultaneously as seen original coordinate system and coordinates of targets are tied up under this coordinate system;
2) coordinate moves, and promptly on the basis that keeps the road net shape, all coordinates is moved to target-based coordinate system from original coordinate system;
3) coordinate normalization, promptly by the coordinate convergent-divergent, system is converted to target coordinate system with virtual coordinates;
4) form point compression promptly keeping the road basic configuration and not causing on the basis of new LINK counter-rotating, is removed unnecessary shape point.
5) the LINK counter-rotating is handled, and promptly by the moving target coordinate, solves the LINK counter-rotating problem of both having deposited.
Advantage of the present invention is: when the original coordinate systems precision is higher than target coordinate system or two coordinate systems when disproportionate, can avoid producing LINK counter-rotating problem, keep the global shape of road net to greatest extent.
Description of drawings
Fig. 1 is that the present invention and prior art are in the comparison example of avoiding producing on the LINK counter-rotating problem.
Fig. 2 is the example that must recover the necessary shape point deleted by Douglas form point compression algorithm.
Fig. 3 is the example that must handle the LINK counter-rotating.
Fig. 4 is implementing procedure figure.
Fig. 5 is the actual effect comparison diagram.
Embodiment
As shown in Figure 4, implementation of the present invention may further comprise the steps after beginning:
1) coordinate transformation
The purpose of coordinate transformation is to multiply by certain coefficient on the original coordinates basis, obtain a high-precision virtual coordinate system, make the mesh lines of original coordinate system and target-based coordinate system can under this virtual coordinate system, find corresponding coordinate, there is not the round-off error problem near only original coordinates need being moved to when coordinate moves like this only coordinates of targets.This is that coordinate moves and the normalized necessary preparation of coordinate.
Definite method of coefficient is as follows:
With the coordinate system size definition of virtual coordinate system is the lowest common multiple original coordinate systems breadth length ratio (the directions X size is length, and Y direction size is a width) of original coordinate system size and target-based coordinate system size and the product of target coordinate system length breadth ratio.
Such as the MESH size of original coordinate system is 2750 to multiply by 2250 (breadth length ratio is 9: 11), the MESH size of target-based coordinate system is 2047 to multiply by 2047 (length breadth ratio is 1: 1), and then the MESH size of virtual coordinate system need be defined as: 2750*2047*9 multiply by 2250*2047*11.When original coordinate system is scaled virtual coordinate system, only need (x carries out y) that (2047*9*x 2047*11*y) converts and gets final product to coordinate.
2) coordinate moves
The purpose that coordinate moves is under virtual coordinate system, according to around the shape of all LINK of continuing, on the basis that keeps the road net shape, the grid of all coordinates from original coordinate system moved on the grid of only target-based coordinate system.
According to the difference of coordinate type, coordinate moves and is divided into following two steps and carries out respectively:
A) NODE coordinate in border moves
Because road data generally is a mass data, thus just can not consider the disposable internal memory that reads of data is handled from designing, and must be designed to batch treatment by MESH.
Is but so just certainly lead to a problem: the identical border NODE coordinate of the adjacent MESH that how to guarantee not in same batch processed also consistent after processing? our way is that border NODE coordinate is adopted following rule treatments:
Because border NODE is the simple NODE of two LINK of only having continued, and coordinate also can only move on same border, so the magnitude relationship of border NODE coordinate does not change before and after only need guaranteeing to move, with regard to guaranteeing the LINK that continues with border NODE LINK counter-rotating problem can not take place; In addition, as long as guarantee that the processing sequence of same borderline NODE is certain, also be consistent with regard to the coordinate after the same borderline NODE processing that can guarantee adjacent MESH, thereby can not stride the inconsistent problem of NODE coordinate of MESH.In a word, this step is exactly to be order to all border NODE with MESH and coordinate, moves to successively on the boundary coordinate of nearest target-based coordinate system.
Specific practice is that all the border NODE in this batch processed are handled successively by MESH CODE, boundary direction, the ordering of coordinate size.When a border NODE coordinate is handled, current coordinate Calculation according to this NODE goes out nearest legitimate targets coordinate earlier, obtain the coordinate offset value of this NODE, if also have other NODE between current coordinate and the coordinates of targets, then these NODE are also done the move operation of same offset value.Like this, just problem only is confined to consider the global coherency problem in the MESH, and has successfully avoided borderline LINK counter-rotating problem.
As shown in Figure 1, left side figure is a raw data, and middle figure is the target data that is converted to by the direct mode of blocking, and right side figure is the target data that is converted to by this method.The lower end NODE of L3 and L4 is border NODE, and the coordinate moving method carries out according to top step.Compare with middle figure, because L3 lower end NODE X coordinate is less than L4 lower end NODE X coordinate in the raw data, therefore the target data the inside also must guarantee this point, so the lower end NODE of L4 has been moved to only position, thus success avoided the overlapping counter-rotating problem of borderline LINK.
B) NODE and shape point coordinate move in the MESH
The mobile disposal route of MESH internal coordinate is the key that keeps the LINK shape.
All coordinates in the MESH can be divided into two kinds on NODE coordinate and shape point coordinate, and both are the same keeping LINK status in shape.Unique difference is that NODE is the skeleton of LINK, no matter carries out which kind of operation, and this coordinate does not allow deleted, and the shape point coordinate in the case of necessary, is that permission is deleted or interpolation.
Understanding above having had just can also be used as the NODE coordinate with shape point and treat, and so, all nodes that problem just can be converted into a undirected network of being made up of the nonoriented edge of some nodes and connected node and node carry out the problem that shape fidelity moves.Therefore, each coordinate is carried out when mobile, can change mean value according to the angle that moves to all limits of continuing on this node behind the different target position and sort from small to large, assess the size of each target location the change of road shape.
Each coordinate all has 4 target locations to move in principle, determine the priority of each target location according to top method after, find out a position that can not produce the LINK counter-rotating more in order (if all can produce LINK counter-rotating problem, directly choose first target location) as the final position of this coordinate, just can realize that all coordinates have moved.
In a word, this step is exactly to the inside NODE of all MESH and shape point coordinate, on the basis that does not cause unnecessary LINK counter-rotating problem, moves on the coordinates of targets of the mean value minimum that makes all line segment angles variations that are connected on this coordinate.
Owing to considered road deformation and LINK counter-rotating problem in the coordinate moving process simultaneously, target data can be avoided modal LINK counter-rotating problem when taking into account road shape.
As shown in Figure 1, left side figure is a raw data, and middle figure is the target data that is converted to by the direct mode of blocking, and right side figure is the target data that obtains according to this method.L1 among the right figure, all coordinates of L2 move according to the method described above.Wherein the moving process of the upper end NODE of L1 is as follows: to four optional target locations of the upper end NODE of L1 by size ordering to the LINK alteration of form, be followed successively by " upper right ", " bottom right ", " upper left ", " lower-left " (with reference to left figure), and " upper right " position of alteration of form minimum just in time can not produce the LINK counter-rotating yet, and therefore the upper end NODE of mobile L1 is to " upper right " position.Compare with middle figure, be that the upper end NODE of L1 has found a position that can keep the LINK shape not produce the best of LINK counter-rotating problem again by above method, thereby successfully avoided LINK counter-rotating problem, and guaranteed the change of shape minimum.
3) coordinate normalization
The normalized purpose of coordinate is that the coordinate after moving under virtual coordinate system is carried out proportional zoom, and virtual coordinate system is converted to target-based coordinate system.Under the situation as given example in step 1), here only need (x y) carries out (x/ (2750*9), y/ (2250*11)) and converts to all coordinates.
Owing to carry out step 2) processing after, on the target network ruling, carry out zoom operations all will be to divide exactly computing, the LINK angle variation issue that will not exist round-off error to cause here to all coordinates.
4) form point compression
The purpose of common form point compression algorithm is on the basis that keeps the LINK basic configuration, deletes unnecessary shape point as far as possible, thereby reaches the purpose of cutting down data capacity.Because the operation of deletion form point can cause that the LINK angle changes, just may produce new LINK counter-rotating problem.Therefore, need on the basis of common form point compression algorithm, improve here,, need to keep the shape point that causes the counter-rotating problem if find to have produced new LINK counter-rotating problem.The present invention adopts improved Douglas form point compression algorithm, that is: a) utilize Douglas form point compression algorithm to remove unnecessary shape point; B) judge that whether initial NODE place is because of the form point compression produces the LINK counter-rotating, if then recover second shape point that begins from initial NODE; C) judge whether stop the NODE place reverses because of the form point compression produces LINK, if then recover from stopping second shape point that NODE begins.
As shown in Figure 2, left side figure is the figure after handling through step 3), and middle figure is the figure after handling through Douglas form point compression algorithm, and right figure is through the figure after this step process.Because after the processing of Douglas form point compression algorithm, the intermediate shape point P1 of L1 is deleted, so just caused L1 and L2 that the LINK counter-rotating takes place, so P1 can not be deleted, so through after this step process, P1 is resumed.
5) the LINK counter-rotating is handled
Because step 2) under the condition that allows, considered to avoid producing LINK counter-rotating problem, so need the just more special situation of shape of minority handled here.
As shown in Figure 3, left side figure is a raw data, and middle figure is the data after coordinate moves, and right figure is the target data after counter-rotating is handled through LINK.Because no matter L2 where moves, LINK counter-rotating problem all can take place, therefore need in target-based coordinate system, move once more, to solve the LINK counter-rotating problem of both having deposited.
As shown in Figure 3, the LINK counter-rotating takes place in L2 and L3, because L2 is shorter, moves less distance and just can obtain bigger angle changing value, therefore pays the utmost attention to mobile L2.Here because LINK counter-rotating problem occurs in NODE place, lower end, so move second coordinate points (being the upper end NODE of L2) that begins from lower end NODE.Owing to have only L2 could effectively be solved herein LINK counter-rotating problem toward rotation counterclockwise, so be that the center of circle is rotated counterclockwise and surveys feasible solution successively (under the situation that the moving displacement that is moved coordinate allows with lower end NODE with L2.When this programme is realized, allow coordinates of targets to be moved 2 coordinate unit at most), find that upper extreme point with L2 up moves a unit and just can solve herein LINK counter-rotating problem, therefore finally solve figure after the LINK counter-rotating problem shown in the right figure of Fig. 3.
6) check whether also have untreatment data.If "Yes" goes to step 1); If "No" then finishes.
As shown in Figure 5, left side figure is a raw data, and middle figure is the target data of changing out by this method, and right figure is the target data of changing out by the mode of rounding up.As can be seen, the present invention has a suitable obvious effects in shape what keep road net.
Claims (1)
1. map coordinates transformation method based on shape fidelity is characterized in that its step comprises:
1) coordinate transformation is promptly set up a high-precision virtual coordinates system, and simultaneously as seen original coordinate system and coordinates of targets are tied up under the high-precision virtual coordinate system, and step 1) specifically may further comprise the steps:
11) according to original coordinate systems size M, target coordinate system size N, the size of determining the virtual coordinates system is the lowest common multiple of M and N and the product of original coordinate systems breadth length ratio and target coordinate system length breadth ratio;
12) all coordinates in the original coordinate systems are carried out transformation of scale, be scaled the coordinate under the virtual coordinates system;
2) coordinate moves, and promptly on the basis that keeps the road net shape, all coordinates is moved to target-based coordinate system, step 2 from original coordinate system) specifically may further comprise the steps:
21) moving all border NODE coordinates, is order to all border NODE with MESH and coordinate promptly, moves to successively on the boundary coordinate of nearest target-based coordinate system;
22) move all MESH intrinsic coordinatess, promptly to inside NODE and the shape point coordinate of all MESH, on the basis that does not cause unnecessary LINK counter-rotating problem, move on the coordinates of targets of the mean value minimum that makes all line segment angles variations that are connected on this coordinate;
3) coordinate normalization, promptly by the coordinate convergent-divergent, system is converted to target coordinate system with virtual coordinates;
4) form point compression promptly keeping the road basic configuration and not causing on the basis of new LINK counter-rotating, is removed unnecessary shape point; Step 4) adopts improved Douglas form point compression algorithm, that is:
41) utilize Douglas form point compression algorithm to remove unnecessary shape point;
42) judge that whether initial NODE place is because of the form point compression produces the LINK counter-rotating, if then recover second shape point that begins from initial NODE;
43) judge whether stop the NODE place reverses because of the form point compression produces LINK, if then recover from stopping second shape point that NODE begins;
5) the LINK counter-rotating is handled, and promptly by the moving target coordinate, solves the LINK counter-rotating problem of both having deposited.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100629811A CN101586963B (en) | 2009-07-03 | 2009-07-03 | Map coordinates transformation method based on shape fidelity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100629811A CN101586963B (en) | 2009-07-03 | 2009-07-03 | Map coordinates transformation method based on shape fidelity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101586963A CN101586963A (en) | 2009-11-25 |
| CN101586963B true CN101586963B (en) | 2011-08-17 |
Family
ID=41371309
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100629811A Active CN101586963B (en) | 2009-07-03 | 2009-07-03 | Map coordinates transformation method based on shape fidelity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101586963B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102374866B (en) * | 2011-08-25 | 2013-03-13 | 武汉光庭信息技术有限公司 | Destructive road shape fusion method based on traveling direction |
| CN104048659B (en) * | 2014-06-16 | 2017-04-05 | 广州杰赛科技股份有限公司 | The conversion method and system of map coordinates system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6507784B1 (en) * | 2000-03-14 | 2003-01-14 | Aisin Aw Co., Ltd. | Road map display device and redoce media for use in the same |
| CN1645056A (en) * | 2004-01-20 | 2005-07-27 | Lg电子有限公司 | Method for converting coordinate values of map data |
| CN1712898A (en) * | 2004-06-25 | 2005-12-28 | 私立逢甲大学 | Geographic space conversion |
-
2009
- 2009-07-03 CN CN2009100629811A patent/CN101586963B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6507784B1 (en) * | 2000-03-14 | 2003-01-14 | Aisin Aw Co., Ltd. | Road map display device and redoce media for use in the same |
| CN1645056A (en) * | 2004-01-20 | 2005-07-27 | Lg电子有限公司 | Method for converting coordinate values of map data |
| CN1712898A (en) * | 2004-06-25 | 2005-12-28 | 私立逢甲大学 | Geographic space conversion |
Non-Patent Citations (2)
| Title |
|---|
| 何睿,章坚武.GPS电子地图坐标转换算法研究.《火控雷达技术》.2006,第35卷82-85. * |
| 张菊清,杨元喜,曾安敏.多种地图坐标系统的转换方法及比较.《测绘通报》.2008,(第8期),32-35. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101586963A (en) | 2009-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6998964B2 (en) | Methods and equipment for determining the geofence index grid | |
| CN102306396B (en) | Three-dimensional entity model surface finite element mesh automatic generation method | |
| KR20200115173A (en) | An intersection drawing method, an apparatus, a server and a storage medium | |
| CN104966270A (en) | Multi-image stitching method | |
| CN107974945B (en) | BIM modeling method based on the construction of Section Rigid Surveillance of Continuous Beam cantilever pouring | |
| CN111079801A (en) | Method, medium, terminal and device for quickly searching closest point based on point cloud matching | |
| CN109545072A (en) | Pose calculation method, device, storage medium and the system of map structuring | |
| JP2024511492A (en) | Vehicle trajectory offset correction method, device and electronic equipment | |
| CN112733318B (en) | Adaptive grid subdivision method, device, equipment and storage medium | |
| Montenegro et al. | Tetrahedral mesh generation for environmental problems over complex terrains | |
| CN105931256A (en) | CUDA (compute unified device architecture)-based large-format remote sensing image fast segmentation method | |
| CN101586963B (en) | Map coordinates transformation method based on shape fidelity | |
| CN111707262B (en) | Point cloud matching method, medium, terminal and device based on closest point vector projection | |
| CN112484738A (en) | Robot mapping method and device, computer readable storage medium and robot | |
| CN113050660B (en) | Error compensation method, error compensation device, computer equipment and storage medium | |
| CN103399730A (en) | Parallel processing method for judgment of segment intersection for solid geometrical bodies on the basis of CPU-GPU architecture | |
| AU2013399651B2 (en) | Global grid building in reverse faulted areas by an optimized unfaulting method | |
| Xu et al. | Computing the map of geometric minimal cuts | |
| CN113849498B (en) | Index construction and query method | |
| CN114138925A (en) | Location point belonging area retrieval method, device, electronic equipment, medium and product | |
| CN117193278A (en) | Method, apparatus, computer device and storage medium for dynamic edge path generation | |
| CN113239905A (en) | Lane line simplification method and device, electronic equipment and storage medium | |
| CN102509258B (en) | Method for quickly clipping elliptic curve in rectangular window | |
| CN107256281B (en) | FPGA (field programmable Gate array) reconfigurable resource non-rectangular layout method based on cutting method | |
| CN101477583A (en) | Computer-aided design method for cam curve of three-component zooming system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent for invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Luo Yuejun Inventor after: Dai Zejun Inventor after: Song Xiangbo Inventor after: Wang Peng Inventor after: Feng Ying Inventor after: Xia Dan Inventor before: Zhu Dunyao Inventor before: Dai Zejun Inventor before: Song Xiangbo Inventor before: Wang Peng Inventor before: Feng Ying Inventor before: Xia Dan |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: ZHU DUNYAO DAI ZEJUN SONG XIANGBO WANG PENG FENG YING XIA DAN TO: LUO YUEJUN DAI ZEJUN SONG XIANGBO WANG PENG FENG YING XIA DAN |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: WUHAN KOTEI INFORMATICS CO., LTD. Free format text: FORMER OWNER: KOTEI NAVI+DATA (WUHAN) CORPORATION Effective date: 20130216 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20130216 Address after: 8, building 2, building E, 4 Optics Valley City,, Wuhan Software Park, East Lake Development Zone, Hubei, China Patentee after: Wuhan Kotei Information Technology Co., Ltd. Address before: The East Lake Development Zone in Hubei province Wuhan City Road 430073 No. 1 Optics Valley Software Park building C6 room 210 Patentee before: Kotei Navi & Data (Wuhan) Corporation |
|
| C56 | Change in the name or address of the patentee | ||
| CP03 | Change of name, title or address |
Address after: 430073 Optics Valley, Hubei, East Lake Development Zone, a Software Park West, South Lake South Road, Optics Valley Software Park, No. six, No. 8, layer 2, No. 208 Patentee after: WUHAN KOTEI INFORMATICS CO., LTD. Address before: 8, building 2, building E, 4 Optics Valley City,, Wuhan Software Park, East Lake Development Zone, Hubei, China Patentee before: Wuhan Kotei Information Technology Co., Ltd. |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20161123 Address after: 430073 Hubei province East Lake New Technology Development Zone Software Park, No. 4 Optics Valley Software Park, No. six, building 2, room 7, room 01 Patentee after: Wuhan Zhonghai Data Technology Co., Ltd. Address before: 430073 Optics Valley, Hubei, East Lake Development Zone, a Software Park West, South Lake South Road, Optics Valley Software Park, No. six, No. 8, layer 2, No. 208 Patentee before: WUHAN KOTEI INFORMATICS CO., LTD. |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Map coordinate transformation method based on shape fidelity Effective date of registration: 20210909 Granted publication date: 20110817 Pledgee: Wuhan Jiangxia sub branch of Bank of Communications Co., Ltd Pledgor: WUHHAN KOTEL BIG DATE Corp. Registration number: Y2021980009115 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |