CN106649776A - Method of semi-automating comprehensive vector polygon - Google Patents

Method of semi-automating comprehensive vector polygon Download PDF

Info

Publication number
CN106649776A
CN106649776A CN201611229053.6A CN201611229053A CN106649776A CN 106649776 A CN106649776 A CN 106649776A CN 201611229053 A CN201611229053 A CN 201611229053A CN 106649776 A CN106649776 A CN 106649776A
Authority
CN
China
Prior art keywords
polygon
comprehensive
semi
key element
right angle
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.)
Granted
Application number
CN201611229053.6A
Other languages
Chinese (zh)
Other versions
CN106649776B (en
Inventor
王枫
姚勇
龙振杰
李月华
胡磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Science Mapuniverse Tchndogy Co Ltd
Original Assignee
China Science Mapuniverse Tchndogy Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Science Mapuniverse Tchndogy Co Ltd filed Critical China Science Mapuniverse Tchndogy Co Ltd
Priority to CN201611229053.6A priority Critical patent/CN106649776B/en
Publication of CN106649776A publication Critical patent/CN106649776A/en
Application granted granted Critical
Publication of CN106649776B publication Critical patent/CN106649776B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Landscapes

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

Abstract

The invention discloses a method of semi-automating a comprehensive vector polygon, relating to the technical field of geographic information data processing. The method comprises the following steps: before executing a comprehensive process, appointing a comprehensive object and a distance tolerance value permitted to synthesize by a user so as to select a comprehensive element list by the user in a mouse frame manner; synthesizing the two selected elements by way of circular process by a program; constructing a multi-point object by nodes meeting the requirements and acquiring a convex hull polygon and performing rectangularity; by taking the rectangular polygon as a filling polygon between two polygons, acquiring a comprehensive result by element merging; and finally, endowing the attribute of the synthesized previous element to the comprehensive result and deleting the original element. In the production process of DLG data in geographic information industry, the invention provides a semi-automatic synthesizing method for representing the downsizing process of vector surface elements of a surface building, so that an existing data downsizing mode is improved, and the data production efficiency is improved.

Description

A kind of polygonal method of semi-automatic synthetic vector
Technical field
The present invention relates to geographic information data processing technology field, more particularly to a kind of semi-automatic synthetic vector polygon Method.
Background technology
In geographic information data processing procedure, the information content that the map of different scale can be carried is different, many In the process of construction of engineer's scale database, the production of large scale data generally by high-precision remote sensing or photogrammetric image, Produce through vector quantization and obtain, if each DBMS causes data long the production cycle, workload by the way of vector quantization collection Greatly, the phenomenon such as repeated acquisition, therefore the method generally reduced the staff using data obtains small scale data.
In the production process for carrying out small scale data on the basis of existing large scale data, due to the carrying of map Selection and summary that the diminution of amount is carried out to map datum, referred to as map is reduced the staff.In the point-line-surface three types of vector data, The integrated approach of point data is gradually ripe, line, face data because its data structure is complicated, with diversity, its synthesis side Method still needs to further exploitation.
The content of the invention
It is an object of the invention to provide a kind of polygonal method of semi-automatic synthetic vector, so as to solve prior art Present in foregoing problems.
To achieve these goals, the technical solution used in the present invention is as follows:
A kind of polygonal method of semi-automatic synthetic vector, comprises the steps:
S1, it is intended that pending VectorLayer, arranging allows comprehensive tolerance;
S2, in the pending VectorLayer, by user mutual multiple polygon key elements is chosen;
S3, according to the tolerance for arranging, the multiple polygon key elements to selecting in S2 are carried out two-by-two comprehensively, and circular treatment is extremely Complete it is geometric reduce the staff, obtain comprehensive polygon;
S4, by the attribute assignment of any one the polygon key element before synthesis the comprehensive polygon is given, and completes described comprehensive Reducing the staff for polygon attribute is closed, synthesis result is obtained;
S5, preserves the synthesis result, while deleting the comprehensive front selected polygon key element.
Preferably, S2 specifically, by mouse frame select interactive mode select close on, meet reduce the staff rule it is multiple many Side shape key element.
Preferably, S3 comprises the steps:
S31, obtains two key elements in polygon key element selected in S2 as current operation object;
S32, calculates the polygonal node and another polygonal distance in current operation object, obtains and is holding Node set in difference;
S33, by the node set multiple spot object is converted into, and obtains the convex closure polygon of the multiple spot object;
S34, to the convex closure polygon right angle is carried out, and obtains right angle polygon, and the right angle polygon is made For the filled polygon between two polygons of current operation object;
S35, two polygons of current operation object are merged with filled polygon, obtain comprehensive polygon;
S36, chooses in the comprehensive polygon and remaining polygon key element as current operation object, repeats S32-S35, selected all of polygon key element is processed and completed into S2.
Preferably, S31 is specially:According to the ascending sequence of ID values of selected key element, the one of ID values minimum is taken first Individual key element is used as a current operation object A;The space length of other key elements and current operation object A is calculated, is selected and A distances Nearest key element is used as another current operation object B.
Preferably, S32 is specially:The minimum distance Dis1 of each node with B key elements of A key elements is calculated successively, if distance Dis1 is less than tolerance, then the near distance spot on corresponding node and B key elements is stored in the node set in tolerance; The minimum distance Dis2 of each node with A key elements of B key elements is calculated successively, if being less than tolerance apart from Dis2, will be corresponding The near distance spot on node and A key elements is stored in the node set in tolerance.
Preferably, S33 is specially:The node set preserved in S32 is constituted into multiple spot object, by ConverxHull () Method obtains the convex closure polygon of the multiple spot object.
Preferably, it is described that right angle is carried out to the convex closure polygon in S34, comprise the steps:
S341, obtains initial sideline, and two end points in the initial sideline belong to polygon before same merging treatment Shape;
S342, judges the angle between next sideline and the initial sideline, if angle is far smaller than or more than 90 Degree, then insert right angle electrical between the terminal in the next sideline, otherwise, without the need for processing;
S343, the line using the right angle electrical of insertion and initial sideline terminal repeats S342, to institute as new initial sideline Some sidelines process and complete, and obtain the convex closure polygon of right angle.
Preferably, it is described to insert right angle electrical between the terminal in the next sideline in S342, specifically, in institute The destination county for stating initial sideline does vertical line, using the intersection point point of the lower a line to the vertical line as right angle electrical.
Preferably, in S1, the unit of the tolerance is consistent with the spatial frame of reference of the pending VectorLayer, institute State tolerance to be configured according to the engineer's scale that data are reduced the staff.
The invention has the beneficial effects as follows:The polygonal method of semi-automatic synthetic vector provided in an embodiment of the present invention, In the production process of geography information industry DLG data, to represent that the process of reducing the staff of vector face key element of surface buildingses is provided A kind of semi-automatic comprehensive method, improves existing data and reduces the staff mode, improves data production efficiency.
Description of the drawings
Fig. 1 is the polygonal method flow schematic diagram of semi-automatic synthetic vector provided in an embodiment of the present invention.
Specific embodiment
In order that the objects, technical solutions and advantages of the present invention become more apparent, below in conjunction with accompanying drawing, the present invention is entered Row is further described.It should be appreciated that specific embodiment described herein is not used to only to explain the present invention Limit the present invention.
As shown in figure 1, a kind of polygonal method of semi-automatic synthetic vector is embodiments provided, including it is as follows Step:
S1, it is intended that pending VectorLayer, arranging allows comprehensive tolerance;
S2, in the pending VectorLayer, by user mutual multiple polygon key elements is chosen;
S3, according to the tolerance for arranging, the multiple polygon key elements to selecting in S2 are carried out two-by-two comprehensively, and circular treatment is extremely Complete it is geometric reduce the staff, obtain comprehensive polygon;
S4, by the attribute assignment of any one the polygon key element before synthesis the comprehensive polygon is given, and completes described comprehensive Reducing the staff for polygon attribute is closed, synthesis result is obtained;
S5, preserves the synthesis result, while deleting the comprehensive front selected polygon key element.
The practical work process of said method is:
Before combined process is performed, by user specify synthesis object and allow it is comprehensive apart from tolerance, and then by with Mode is selected to select comprehensive key element list, program to carry out two to selected key element by way of circular treatment by mouse frame in family Two is comprehensive, constitutes multiple spot object, obtains its convex closure polygon and carry out right angle satisfactory node, and right angle is polygon Shape is merged by key element and obtains synthesis result as the filled polygon between two polygons, finally will comprehensive previous key element Attribute assignment to synthesis result, delete original key element.
Said method can realize line of vector, the semi-automatic combined process of face factor data of expression surface buildingses, For complex structure, multifarious line, face data synthesis, improve data production efficiency.
In a preferred embodiment of the invention, S2 specifically, by mouse frame select interactive mode select close on, Meet the multiple polygon key elements for reducing the staff rule.
In actual mechanical process, it is possible to use ArcGIS Objects secondary exploitation technologies, the reality in the way of mouse frame choosing The interactive selection of existing key element, it is that the polygon key element storage intersected or include is arranged to data to select the spatial relationship of figure with mouse frame In table, as treating comprehensive object.
In a preferred embodiment of the invention, S3 may include steps of:
S31, obtains two key elements in polygon key element selected in S2 as current operation object;
S32, calculates the polygonal node and another polygonal distance in current operation object, obtains and is holding Node set in difference;
S33, by the node set multiple spot object is converted into, and obtains the convex closure polygon of the multiple spot object;
S34, to the convex closure polygon right angle is carried out, and obtains right angle polygon, and the right angle polygon is made For the filled polygon between two polygons of current operation object;
S35, two polygons of current operation object are merged with filled polygon, obtain comprehensive polygon;
S36, chooses in the comprehensive polygon and remaining polygon key element as current operation object, repeats S32-S35, selected all of polygon key element is processed and completed into S2.
Wherein, S31 is specifically as follows:According to the ascending sequence of ID values of selected key element, ID values minimum is taken first One key element is used as a current operation object A;Calculate the space length of other key elements and current operation object A, select with A away from From nearest key element as another current operation object B.
S32 is specifically as follows:The minimum distance Dis1 of each node with B key elements of A key elements is calculated successively, if apart from Dis1 Less than tolerance, then the near distance spot on corresponding node and B key elements is stored in the node set in tolerance;Successively Each node of B key elements and the minimum distance Dis2 of A key elements are calculated, if being less than tolerance apart from Dis2, by corresponding node And the near distance spot in A key elements is stored in the node set in tolerance.
S33 is specifically as follows:The node set preserved in S32 is constituted into multiple spot object, by ConverxHull () method Obtain the convex closure polygon of the multiple spot object.
In a preferred embodiment of the invention, it is described that right angle is carried out to the convex closure polygon in S34, can be with Comprise the steps:
S341, obtains initial sideline, and two end points in the initial sideline belong to polygon before same merging treatment Shape;
S342, judges the angle between next sideline and the initial sideline, if angle is far smaller than or more than 90 Degree, then insert right angle electrical between the terminal in the next sideline, otherwise, without the need for processing;
S343, the line using the right angle electrical of insertion and initial sideline terminal repeats S342, to institute as new initial sideline Some sidelines process and complete, and obtain the convex closure polygon of right angle.
It is described to insert right angle electrical between the terminal in the next sideline in S342, it is specifically as follows, at described The destination county of initial line line does vertical line, using the intersection point point of the lower a line to the vertical line as right angle electrical.
In S1, the unit of the tolerance is consistent with the spatial frame of reference of the pending VectorLayer, the tolerance Value is configured according to the engineer's scale that data are reduced the staff.
Wherein, tolerance is referred to allows comprehensive ultimate range, the unit of tolerance and the pending VectorLayer Spatial frame of reference it is consistent, if the georeferencing of processed figure layer is geographic coordinate system, unit is degree;If processed figure layer Spatial frame of reference is projection plane coordinates system, then unit is rice.
Specific embodiment
The embodiment of the present invention utilizes ArcGIS Objects secondary exploitation technologies, there is provided a kind of semi-automatic synthetic vector Polygonal method, is implemented using following steps:
Step one, parameter setting.
Interacted using forms, select the face key element figure layer in current map document, the tolerance for allowing key element comprehensive is set Limit。
Specifically, it is allowed to which the comprehensive tolerance of key element, its unit is related to the spatial frame of reference of the VectorLayer for being operated: If georeferencing is geographic coordinate system, unit is degree;If georeferencing is projection plane rectangular coordinate system, unit is rice.
After the completion of parameter setting, automatically under working directory newly-built specified figure layer wave file, processing procedure afterwards To carry out in the wave file.
Step 2, user mutual selects polygon key element.
Using ArcGIS Objects secondary exploitation technologies, the interactive selection of key element is realized in the way of mouse frame choosing, with It is that key element that is intersecting or including is stored in data list that mouse frame selects the spatial relationship of figure, used as treating comprehensive object.
Selected data in S2 steps are carried out comprehensive two-by-two polygon after acquisition synthesis, detailed step by step 3 For:
S31, in first time is circulated, by selected key element according to the ascending sequence of ID values, takes first ID values minimum One key element is used as current operation object A;The space length of other key elements and current operation object A is calculated, is selected and its distance Nearest key element is used as comprehensive object B.
S32, calculates successively the minimum distance Dis1 of each node with B key elements of A key elements, if distance is less than tolerance (Dis1<Limit), then the near distance spot on the node and B key elements is used as the node for setting up filled polygon;B is calculated successively Each node of key element with A key elements apart from Dis2, if the distance is less than tolerance (Dis2<Limit), then the node will with A Used as the node for setting up filled polygon, above-mentioned satisfactory node is stored in list the near distance spot on element.
S33, by the node preserved in the satisfactory node listing of S32 steps multiple spot object IMultiPoint is constituted, and is led to Cross the convex closure polygon that ConverxHull () method obtains the multiple spot object.
S34, to the convex closure polygon described in S33 steps right angle is carried out, and detailed step is:
S341, it is preferable that process is circulated to the polygonal sideline of convex closure and has obtained initial line, if two end points in sideline A or B (belonging to polygon before same merging) is belonged to, and the sequence number of two point in polygon is adjacent, then the sideline conduct Play initial line;
S342, according to other sidelines of numbering of the node in convex closure polygon, if next sideline and initial sideline Angle it is larger with phase quadrature, then insert right angle electrical between the terminal in the sideline;Concrete grammar is, at the end for playing initial line Vertical line is done at point, lower a line is calculated to the intersection point point of the vertical line, the intersection point point is right angle electrical;
S343, the line using the right angle electrical of new insertion and the terminal for playing initial line as an initial line is played, other sidelines are carried out according to Secondary process, obtains the convex closure polygon of right angle.
S35, using the convex closure polygon of right angle in S34 steps as filled polygon, is carried out with original factor A, key element B Merge, obtain the polygon key element after synthesis.
Step 4, completes the synthesis of attribute information, attribute information then by merging before the attribute migration of first key element arrive In newly-built key element.
Step 5, preserves synthesis result, crossing after synthesis is deformed and its attribute is saved in factor kind, and deletes synthesis Before the key element chosen.
By using above-mentioned technical proposal disclosed by the invention, having obtained following beneficial effect:The embodiment of the present invention is carried For the polygonal method of semi-automatic synthetic vector, in the production process of geography information industry DLG data, be represent earth's surface The process of reducing the staff of the vector face key element of building provides a kind of semi-automatic comprehensive method, improves existing data and reduces the staff Mode, improves data production efficiency.
Each embodiment in this specification is described by the way of progressive, what each embodiment was stressed be with The difference of other embodiment, between each embodiment identical similar part mutually referring to.
Those skilled in the art should be understood that the sequential of the method and step that above-described embodiment is provided can be entered according to actual conditions Row accommodation, is concurrently carried out also dependent on actual conditions.
All or part of step in the method that above-described embodiment is related to can be instructed by program correlation hardware come Complete, described program can be stored in the storage medium that computer equipment can read, for performing the various embodiments described above side All or part of step described in method.The computer equipment, for example:Personal computer, server, the network equipment, intelligent sliding Dynamic terminal, intelligent home device, wearable intelligent equipment, vehicle intelligent equipment etc.;Described storage medium, for example:RAM、 ROM, magnetic disc, tape, CD, flash memory, USB flash disk, portable hard drive, storage card, memory stick, webserver storage, network cloud storage Deng.
Finally, in addition it is also necessary to explanation, herein, such as first and second or the like relational terms be used merely to by One entity or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or operation Between there is any this actual relation or order.And, term " including ", "comprising" or its any other variant meaning Covering including for nonexcludability, so that a series of process, method, commodity or equipment including key elements not only includes that A little key elements, but also including other key elements being not expressly set out, or also include for this process, method, commodity or The intrinsic key element of equipment.In the absence of more restrictions, the key element for being limited by sentence "including a ...", does not arrange Except also there is other identical element in including the process of the key element, method, commodity or equipment.
The above is only the preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art For member, under the premise without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications also should Depending on protection scope of the present invention.

Claims (9)

1. a kind of polygonal method of semi-automatic synthetic vector, it is characterised in that comprise the steps:
S1, it is intended that pending VectorLayer, arranging allows comprehensive tolerance;
S2, in the pending VectorLayer, by user mutual multiple polygon key elements is chosen;
S3, according to the tolerance for arranging, the multiple polygon key elements to selecting in S2 carry out comprehensive two-by-two, and circular treatment is to completing It is geometric to reduce the staff, obtain comprehensive polygon;
S4, by the attribute assignment of any one the polygon key element before synthesis the comprehensive polygon is given, and completes the synthesis many Reducing the staff for side shape attribute, obtains synthesis result;
S5, preserves the synthesis result, while deleting the comprehensive front selected polygon key element.
2. the polygonal method of semi-automatic synthetic vector according to claim 1, it is characterised in that S2 is specifically, logical Cross mouse frame choosing interactive mode select close on, meet reduce the staff rule multiple polygon key elements.
3. the polygonal method of semi-automatic synthetic vector according to claim 1, it is characterised in that S3 includes following step Suddenly:
S31, obtains two key elements in polygon key element selected in S2 as current operation object;
S32, calculates the polygonal node and another polygonal distance in current operation object, obtains in tolerance Interior node set;
S33, by the node set multiple spot object is converted into, and obtains the convex closure polygon of the multiple spot object;
S34, to the convex closure polygon right angle is carried out, and obtains right angle polygon, using the right angle polygon as work as Filled polygon between two polygons of front operation object;
S35, two polygons of current operation object are merged with filled polygon, obtain comprehensive polygon;
S36, chooses in the comprehensive polygon and remaining polygon key element as current operation object, repeats S32- S35, selected all of polygon key element is processed and completed into S2.
4. the polygonal method of semi-automatic synthetic vector according to claim 3, it is characterised in that S31 is specially:Press According to the ascending sequence of ID values of selected key element, a minimum key element of ID values is taken first as a current operation object A; The space length of other key elements and current operation object A is calculated, is selected with A closest key element as another current operation Object B.
5. the polygonal method of semi-automatic synthetic vector according to claim 4, it is characterised in that S32 is specially:According to Each node of secondary calculating A key elements and the minimum distance Dis1 of B key elements, if being less than tolerance apart from Dis1, by corresponding section The near distance spot on point and B key elements is stored in the node set in tolerance;Each node and A of B key elements are calculated successively The minimum distance Dis2 of key element, if being less than tolerance apart from Dis2, the near distance spot on corresponding node and A key elements is deposited In node set of the storage in tolerance.
6. the polygonal method of semi-automatic synthetic vector according to claim 5, it is characterised in that S33 is specially:Will The node set preserved in S32 constitutes multiple spot object, and by ConverxHull () method the convex closure of the multiple spot object is obtained Polygon.
7. the polygonal method of semi-automatic synthetic vector according to claim 6, it is characterised in that described right in S34 The convex closure polygon carries out right angle, comprises the steps:
S341, obtains initial sideline, and two end points in the initial sideline belong to the polygon before same merging treatment;
S342, judges the angle between next sideline and the initial sideline, if angle is far smaller than or more than 90 degree, Right angle electrical is inserted between the terminal in the next sideline, otherwise, without the need for processing;
S343, the line using the right angle electrical of insertion and initial sideline terminal repeats S342 as new initial sideline, extremely all of Sideline processes and completes, and obtains the convex closure polygon of right angle.
8. the polygonal method of semi-automatic synthetic vector according to claim 7, it is characterised in that described in S342 Right angle electrical is inserted between the terminal in the next sideline, specifically, the destination county in the initial sideline does vertical line, will The lower a line to the vertical line intersection point point as right angle electrical.
9. the polygonal method of semi-automatic synthetic vector according to claim 1, it is characterised in that in S1, the appearance The unit of difference is consistent with the spatial frame of reference of the pending VectorLayer, the ratio that the tolerance is reduced the staff according to data Chi is configured.
CN201611229053.6A 2016-12-27 2016-12-27 A kind of method of semi-automation synthetic vector polygon Active CN106649776B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611229053.6A CN106649776B (en) 2016-12-27 2016-12-27 A kind of method of semi-automation synthetic vector polygon

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611229053.6A CN106649776B (en) 2016-12-27 2016-12-27 A kind of method of semi-automation synthetic vector polygon

Publications (2)

Publication Number Publication Date
CN106649776A true CN106649776A (en) 2017-05-10
CN106649776B CN106649776B (en) 2019-11-22

Family

ID=58833017

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611229053.6A Active CN106649776B (en) 2016-12-27 2016-12-27 A kind of method of semi-automation synthetic vector polygon

Country Status (1)

Country Link
CN (1) CN106649776B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110232495A (en) * 2019-04-22 2019-09-13 上海飞未信息技术有限公司 A kind of multiple non-conterminous polygons are fused into the algorithm of a polygon
CN111159451A (en) * 2019-12-18 2020-05-15 广州地理研究所 Power line point cloud dynamic monomer method based on spatial database
CN113190639A (en) * 2021-05-13 2021-07-30 重庆市勘测院 Comprehensive drawing method for residential area
CN114461841A (en) * 2022-04-14 2022-05-10 自然资源部第三地理信息制图院 Automatic compiling method for land utilization data

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101599070A (en) * 2009-07-07 2009-12-09 武汉大学 Utilize the spatial database synthesis method in the information multi-scale expression in the soil
CN103838829A (en) * 2014-02-18 2014-06-04 中国林业科学研究院资源信息研究所 Raster vectorization system based on hierarchical boundary-topology search model
CN103870636A (en) * 2014-02-25 2014-06-18 中国人民解放军92859部队 Gridding processing method for mass discrete data based on geographical fragmentation
CN105550344A (en) * 2015-12-24 2016-05-04 中科宇图科技股份有限公司 Grid and weight relation-based vector point element thinning method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101599070A (en) * 2009-07-07 2009-12-09 武汉大学 Utilize the spatial database synthesis method in the information multi-scale expression in the soil
CN103838829A (en) * 2014-02-18 2014-06-04 中国林业科学研究院资源信息研究所 Raster vectorization system based on hierarchical boundary-topology search model
CN103870636A (en) * 2014-02-25 2014-06-18 中国人民解放军92859部队 Gridding processing method for mass discrete data based on geographical fragmentation
CN105550344A (en) * 2015-12-24 2016-05-04 中科宇图科技股份有限公司 Grid and weight relation-based vector point element thinning method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
刘洋 等: "序列比例尺地图缩编中建筑物综合算法", 《测绘科学》 *
刘洋 等: "顾及居民地分布特征的建筑物分组合并算法研究", 《测绘通报》 *
刘绍贵 等: "数字土地利用现状图斑缩编研究", 《中国农学通报》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110232495A (en) * 2019-04-22 2019-09-13 上海飞未信息技术有限公司 A kind of multiple non-conterminous polygons are fused into the algorithm of a polygon
CN110232495B (en) * 2019-04-22 2023-02-28 上海飞未信息技术有限公司 Method for fusing multiple nonadjacent polygons defined by 'two regions' into one polygon
CN111159451A (en) * 2019-12-18 2020-05-15 广州地理研究所 Power line point cloud dynamic monomer method based on spatial database
CN113190639A (en) * 2021-05-13 2021-07-30 重庆市勘测院 Comprehensive drawing method for residential area
CN113190639B (en) * 2021-05-13 2022-12-13 重庆市勘测院 Comprehensive drawing method for residential area
CN114461841A (en) * 2022-04-14 2022-05-10 自然资源部第三地理信息制图院 Automatic compiling method for land utilization data
CN114461841B (en) * 2022-04-14 2022-07-05 自然资源部第三地理信息制图院 Automatic contraction and editing method for land utilization data

Also Published As

Publication number Publication date
CN106649776B (en) 2019-11-22

Similar Documents

Publication Publication Date Title
CN104346769B (en) The compression of three-dimensional modeling object
CN1734503B (en) Stretch-driven mesh parameterization method using spectral analysis
Lin et al. Structure-preserving retargeting of irregular 3d architecture
CN106649776A (en) Method of semi-automating comprehensive vector polygon
Tierny et al. Interactive quadrangulation with Reeb atlases and connectivity textures
CN110321443B (en) Three-dimensional live-action model database construction method and device and data service system
CN102663801A (en) Method for improving three-dimensional model rendering performance
CN103744999B (en) Spatial vector data online interactive mapping method based on hierarchical-divided storage structure
CN111260784B (en) Urban three-dimensional space grid compression coding method and device and terminal equipment
CN113538706B (en) Digital sand table-based house scene display method, device, equipment and storage medium
CN101364310A (en) Three-dimensional model image generating method and apparatus
CN108763827B (en) Transmission tower finite element model establishing method and device
US20090184957A1 (en) Method and system for compressing and decoding mesh data with random accessibility in three-dimensional mesh model
CN104952086B (en) For managing the device and method of structured data
JP2019168976A (en) Three-dimensional model generation device
Bagnolo et al. Beyond HBIM: serious games and procedural modelling for heritage dissemination
CN107016732A (en) Positioned using the 3D objects of descriptor
CN109189871A (en) A kind of method and apparatus of Indoor environment path planning
CN115952252B (en) Semantic tile data processing method and device based on dynamic rendering and electronic equipment
CN115087983A (en) Method and system for hybrid modeling using geometric patches
KR101063827B1 (en) Semi-automated Conjugated Point Pair Extraction Method for Transformation of Geometric Maps between Continuous and Digital Topographic Maps
CN104766367B (en) Three-dimensional gridding topology structure chart construction method in computing three-dimensional model processing
WO2023209563A1 (en) Machine learning for generative geometric modelling
Pandey et al. Face extrusion quad meshes
Chang et al. Texture tiling on 3d models using automatic polycube-maps and wang tiles

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A semi-automatic method for synthesizing vector polygons

Effective date of registration: 20210716

Granted publication date: 20191122

Pledgee: Zhongguancun Beijing technology financing Company limited by guarantee

Pledgor: CHINA SCIENCE MAPUNIVERSE TCHNDOGY Co.,Ltd.

Registration number: Y2021990000628