CN106898033A - One kind generation polygonal method of isopleth - Google Patents
One kind generation polygonal method of isopleth Download PDFInfo
- Publication number
- CN106898033A CN106898033A CN201710096655.7A CN201710096655A CN106898033A CN 106898033 A CN106898033 A CN 106898033A CN 201710096655 A CN201710096655 A CN 201710096655A CN 106898033 A CN106898033 A CN 106898033A
- Authority
- CN
- China
- Prior art keywords
- polygon
- isopleth
- intersection point
- chained list
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V9/00—Prospecting or detecting by methods not provided for in groups G01V1/00 - G01V8/00
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- General Life Sciences & Earth Sciences (AREA)
- Geophysics (AREA)
- Image Generation (AREA)
Abstract
The present invention proposes a kind of generation polygonal method of isopleth, including：Choose isogram G；From isogram G, the intersection point of all open isopleth and boundary line is asked for, be stored in intersection point chained list C, and be ranked up to the distance of border starting point according to intersection point；It is starting with each intersection point and the line segment of intersection point thereafter according to ranking results, tracking includes the polygon including the line segment, generation polygon chained list P；The element that element in polygon chained list P is concentrated with closed contour successively is compared, inclusion relation is searched, inclusion relation tree T is built；Multiple hole type polygons or conventional polygon are generated using relational tree T；Output polygon, and different attribute polygon is made a distinction according to polygonal region property value.The present invention has the characteristics of simple to operate, generation effect is good.
Description
Technical field
The present invention relates to oil exploration technology field, more particularly to a kind of generation polygonal method of isopleth.
Background technology
Isopleth is the line for connecting all kinds of equivalent points (such as elevation, temperature, rainfall, pollution or atmospheric pressure).Line
Distribution display surface value variation pattern.The variable quantity of value is smaller, and the spacing of line is bigger.Value rises or falls faster,
The spacing of line is just smaller.
The map of map subject quantity, feature is represented with the line of one group of equal value.Abbreviation isogram.Such as annual
Temperature figure, annual precipitation figure.It is the important pattern of thematic maps, at first for describing landform.Performance physical features is common are to rise
The contour map and bathymetric chart of volt and geomorphological structure；Performance temperature, water temperature, the isollaothermic chart of ground temperature change；Performance air drop
The isohyet figure of water change；Performance earth magnetism, isogonic chart, isomagnetic chart, the Isoseismic map of earthquake change.Separately
Outward, also isobar, isotach, isohel, isoneph, isohume, isopycnic, etc. transparency line, etc. salinity
Content line, isochrone etc. are schemed.
Say that isogram has the following properties that from the angle of computer graphics：
1) isopleth is typically a smooth full curve；
2) for certain height value Zc for giving, corresponding isopleth quantity more than one；
3) because domain of definition is bounded, isopleth is probably closure, it is also possible to do not closed；
4) isopleth is not typically interlaced.
Wherein, the isopleth do not closed turns into open isopleth.For specified boundary region, open isopleth and boundary line
It is intersecting.
The establishment of isoline map, typically marks the number of corresponding point position (survey station) of map subject on geographical base map
The equal point of numerical value, is then unified into smooth curve by value, sketches out the spatial structure characteristic of map subject.Isoline map is usual
It is aided with layer colours, to improve the visual effect of map.As usual contour map with red performance physical features high point such as mountain peak hills,
Blue or green represents physical features low spot such as rivers and lakes, middle Contours Fill transition color protrusion relief and therebetween gradually
Change relation, shows the regional change of landform vividerly.
In addition, according to need of work, isogram will also carry out some area statistics, such as calculate certain adjacent isopleth
Region area, all relevant range distributions in statistics designated value scope [Zc1, Zc2].
Realize that the technology of above two demand mainly has at present：
1. background grid.To isopleth scatterplot gridding, each rectangular mesh unit is filled according to node average value
Corresponding color, generates colored grid surface.The color transition between isopleth can be realized.Region between by counting isopleth
Number of grid, calculate the region area.
The defect of the method is：1) grid not exclusively coincide with original isopleth.Due to GRIDDING WITH WEIGHTED AVERAGE spy in itself
There is certain error in point, original point, cause statistics inaccurate with the interpolation point of grid same position.
2) boundary forms sawtooth, influences graphical effect.
2. polygon method between isopleth.Polygon is generated between adjacent two or more pieces isopleth, to polygon color filling,
Calculate area of a polygon.
Method 2 is not enough：
1) the adjacent equivalent line endpoints of artificial connection are needed, the compositing area polygon together with border is cumbersome.
2) closed contour, or multiple closed contours are included in the polygonal region constituted for adjacent open isopleth
Situation nested against one another, will associate polygon and compare during each Fill Color with other, first fill outer ring, refill inner ring；Meter
Also closed contour area is subtracted by perimeter area when calculating area.Polygon does not have independence, calculates and editor is multiple
It is miscellaneous.
The content of the invention
The purpose of the present invention is intended at least solve one of described technological deficiency.
Therefore, it is an object of the invention to propose a kind of generation polygonal method of isopleth.
To achieve these goals, embodiments of the invention provide a kind of generation polygonal method of isopleth, including such as
Lower step：
Step S1, chooses isogram G, wherein, the isogram G includes：Boundary curve collection, closed contour collection,
Open level sets；
Step S2, from the isogram G, asks for the intersection point of all open isopleth and boundary line, is stored in intersection point chain
Table C, and be ranked up to the distance of border starting point according to intersection point；
Step S3, is starting with each intersection point and its latter line segment of intersection point according to ranking results, and following the trail of includes being somebody's turn to do
Line segment is in interior polygon, generation polygon chained list P；
Step S4, the element that the element in the polygon chained list P is concentrated with closed contour successively is compared, and is looked into
Inclusion relation is looked for, inclusion relation tree T is built；
Step S5, multiple hole type polygons or conventional polygon are generated using the relational tree T；
Step S6, exports the polygon, and different attribute polygon is made a distinction according to polygonal region property value.
Further, in the step S2, intersection point is stored in the intersection point chained list C, wherein, described each intersection point is described
Be stored with following information in intersection point chained list C：Current isopleth sequence number is marked to each intersection point, intersection point is along boundary line to border starting point
Distance, the intersection point for isopleth head or afterbody.
Further, in the step S3, according to ranking results, it is border that the line segment of two neighboring intersection point is asked for successively
Single polygon, and the above-mentioned multiple polygons being calculated are stored in polygon chained list P.
Further, in the step S4, by the element in the polygon chained list P successively with step S1 in closure etc.
Value line concentrates element ratio compared with the following inclusion relation of lookup：If a polygonal internal in the polygon chained list includes institute
One or more closed contours of closed contour concentration are stated, then builds inclusion relation tree T.
Further, the relational tree T is multiway tree, and its root node is corresponding polygon, and other nodes represent one respectively
Root closed contour, outside root node, each node isopleth is included in its father node polygonal internal.
Further, in the step S5, the multiple hole type polygons of utilization relational tree T generations or conventional polygon
Shape, including：
Polygon pk1 is generated by root node and its child node first, its child node is then traveled through, if any node is included
Child node, then the node and its all child node generation hole type polygon pki, if the node does not include child node, directly
The polygon on the node is returned, the like, generate all polygons in the tree.
Further, it is described that area is carried out to different attribute polygon according to polygonal region property value in the step S6
Point, comprise the following steps：Polygon to different attribute is filled using different colors, to show difference.
The polygonal method of generation isopleth according to embodiments of the present invention, by border and open isopleth, closure is equivalent
Line generates a series of mutually completely self-contained solid or with hole polygons jointly, and each polygon represents adjacent equivalence
Sole zone between line, in the absence of situation of the polygonal internal comprising other closed lines.Due to each polygon for generating
With independence, in display filling and reference area, without considering other polygons, current polygon need to only be grasped
Make.
The additional aspect of the present invention and advantage will be set forth in part in the description, and will partly become from the following description
Obtain substantially, or recognized by practice of the invention.
Brief description of the drawings
Of the invention above-mentioned and/or additional aspect and advantage will become from description of the accompanying drawings below to embodiment is combined
Substantially and be readily appreciated that, wherein：
Fig. 1 is the flow chart of the generation polygonal method of isopleth according to the embodiment of the present invention；
Fig. 2 a and Fig. 2 b are certain the distribution of contours figure according to the embodiment of the present invention；
Fig. 3 is the schematic diagram that the queue of curve is connected into complete polygon shape according to the embodiment of the present invention；
Fig. 4 is the schematic diagram generated according to the polygon relational tree of embodiment of the present invention structure and hole polygon；
Fig. 5 is the schematic diagram of the relational tree according to the embodiment of the present invention；
Fig. 6 is the schematic diagram of the polygonal form of hole type according to the embodiment of the present invention and filling effect；
Fig. 7 is the schematic diagram of the isopleth polygon result generated according to the embodiment of the present invention.
Specific embodiment
Embodiments of the invention are described below in detail, the example of embodiment is shown in the drawings, wherein identical from start to finish
Or similar label represents same or similar element or the element with same or like function.Retouched below with reference to accompanying drawing
The embodiment stated is exemplary, it is intended to for explaining the present invention, and be not considered as limiting the invention.
As shown in figure 1, the polygonal method of generation isopleth of the embodiment of the present invention, comprises the following steps：
Step S1, chooses isogram G.
Wherein, isogram G includes：Boundary curve B { b1, b2 ..., bm }, closed contour collection O { o1, o2 ..., or },
Opening level sets L l1, l2 ..., ln }.Wherein, m is the number of boundary point, and r is the bar number of closed contour, and n is open etc.
Value number of lines.
Step S2, from isogram G, asks for the intersection point of all open isopleth and boundary line, is stored in intersection point chained list C,
And be ranked up to the distance of border starting point according to intersection point.
Specifically, the intersection point of every open isopleth and border is asked for, intersection point chained list C { c1, c2 ..., c2n } is stored in.Its
In, each intersection point is stored with following information in intersection point chained list C：Current isopleth sequence number is marked in each intersection point ck
Ck.k, along boundary line to border starting point apart from ck.s, the intersection point is the head or afterbody ck.bTail of isopleth to intersection point.
Then, chained list C is ranked up apart from ck.s is ascending according to intersection point to border starting point.
Step S3, is starting with the line segment of each intersection point and its latter intersection point according to ranking results, and tracking includes the line
Section is in interior polygon, generation polygon chained list P.
Specifically, according to ranking results, the line segment that two neighboring intersection point is asked for successively is the single polygon on border, and will
The above-mentioned multiple polygons being calculated are stored in polygon chained list P.With (c1, c2) line segment for starting point, serial number c1.k is followed the trail of,
Polygon between the isopleth of c2.k.
Asked for successively with c2-c3 according to the order in intersection point chained list) ..., (c2n-1, c2n), (c2n, c1) line segment is side
The single polygon on boundary, is stored in polygon chained list P { p1, p2 ..., pw }, and w is open isopleth polygon number.To each
The line segment (ck, ck+1) followed the trail of, labeled as having searched, ck.bTraced=true.
Step S4, the element that the element in polygon chained list P is concentrated with closed contour successively is compared, and searches bag
Containing relation, inclusion relation tree T is built.
Specifically, by the element in polygon chained list P successively with step S1 in closed contour collection O in element ratio compared with,
Search following inclusion relation：One or many that if a polygonal internal in polygon chained list is concentrated comprising closed contour
Individual closed contour, then build inclusion relation tree T.
Element in polygon chained list P is successively with element ratio in closed contour collection O compared with lookup inclusion relation.If polygon
Shape pk inside includes closed contour OK { ok1, ok2 ..., okr }, then build inclusion relation tree T.
In one embodiment of the invention, T is multiway tree, and its root node is pk, and other nodes are represented one in OK respectively
Root closed contour.In addition to root node, each node isopleth is included in its father node polygonal internal.
Step S5, multiple hole type polygons or conventional polygon are generated using relational tree T.
Specifically, polygon pk1 is generated by root node pk and its child node { ok1, ok2 .., okj } first, is then traveled through
Its child node { ok1, ok2 .., okj }, if any node oki includes child node, oki and its all child nodes generation hole
Hole type polygon pki, if oki does not include child node, directly returns to the polygon on oki.The like, generate institute in the tree
There is polygon.
Step S6, exports polygon, and different attribute polygon is made a distinction according to polygonal region property value.
Specifically, different attribute polygon is made a distinction according to polygonal region property value, is comprised the following steps：To not
It is filled using different colors with the polygon of attribute, to show difference.
The polygonal method of generation isopleth of the embodiment of the present invention is described in detail below with reference to Fig. 2 to Fig. 7.
(1) polygon of open isopleth and border composition is followed the trail of
Fig. 2 a show the distribution map of isopleth, and open isopleth has a series of intersection point C1, C2 ..., C16 with border..
With reference to Fig. 2 b, by taking C2-C3 as an example, following steps are performed：
1. emptying curve section queue D, sets C2 as current starting point；
2. the curved section on border between C2-C3 is taken out, current curves queue D is stored in；
3., by the isopleth information included in C3, the isopleth between C3 and C4 is followed the trail of, and be stored in curve queue D；
4. the sub- curve in border between C4-C5 is obtained, curve queue D is stored in；
5. by the isopleth serial number information included in C5, the isopleth between C5 and C6 is followed the trail of, be stored in curve queue D；
6. the sub- curve in border between C6-C7 is obtained, queue D is stored in；
7. by the isopleth serial number information included in C7, the isopleth between C7 and C2 is followed the trail of, be stored in curve queue D；
8. because C2 is initial starting point, so this time follow the trail of completing.The queue that curve is chased after is connected into a complete polygon
Shape, as shown in Figure 3.
(2) polygon relational tree builds and the generation of hole polygon
With reference to Fig. 4, by taking the polygon of previous step generation as an example, P0 is to open the polygon that isopleth is formed with border,
P1, p2, p3, p4, p5 are original closed polygon.
1. we judge which is included in inside P0 in { p1, p2, p3, p4, p5 }.Method is to go closure polygon one by one
Whether shape pi upper a point x0, y0, judge the shop inside p0, if being polygon p0 inside polygon in, pi, conversely, being then
Outside polygon.By comparing, it is to be included in the polygon inside p0 that can obtain { p1, p2, p3, p4 }.
2. compare two-by-two { p1, p2, p3, p4 }, build inclusion relation tree, as shown in Figure 5.
3. polygon is successively generated.
As shown in fig. 6, root node p0 includes child node p1, then p0 and p1 generation hole type polygons p0_1, p1 include son
Node p2, p3, then p1 and p2, p3 generation hole type polygon p1_2_3, the like, newly-generated polygon is stored in output
Chained list P_NEW.P3, p4 do not include child node, then be directly stored in P_NEW.
One polygon p1 and the polygon p2 generation hole type polygon specific methods included inside it are：
1) closest approach between lookup p1 and p2, pt1 (x11, y11), pt2 (x22, y22), on p1, pt2 is on p2 for pt1；
2) follow the trail of p1 starting points to pt1 a little, be stored in curve point chained list L；
If 3) p1 curves own for clockwise, p2 is obtained on the curve as starting point with pt2 along counterclockwise
Point, is stored in L；
4) pt1 to p1 afterbodys are stored in a little L；
5) new curve is generated by L.
Fig. 7 shows hole type polygon p1_p2_p3 forms and filling effect.
The polygonal method of generation isopleth according to embodiments of the present invention, by border and open isopleth, closure is equivalent
Line generates a series of mutually completely self-contained solid or with hole polygons jointly, and each polygon represents adjacent equivalence
Sole zone between line, in the absence of situation of the polygonal internal comprising other closed lines.Due to each polygon for generating
With independence, in display filling and reference area, without considering other polygons, current polygon need to only be grasped
Make.
The present invention follows the trail of polygon using open isopleth and boundary intersection, is successively generated by polygon inclusion relation tree many
Side shape technology, has the advantages that：
1. simple to operate, user-selected number is according to without excessive interaction.
2. generation effect is good, and each polygon represents the sole zone between adjacent isopleth, in the absence of in polygon
Situation of the portion comprising other closed lines.
3. in display filling and reference area, without considering other polygons, current polygon need to only be operated.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means to combine specific features, structure, material or spy that the embodiment or example are described
Point is contained at least one embodiment of the invention or example.In this manual, to the schematic representation of above-mentioned term not
Necessarily refer to identical embodiment or example.And, the specific features of description, structure, material or feature can be any
One or more embodiments or example in combine in an appropriate manner.
Although embodiments of the invention have been shown and described above, it is to be understood that above-described embodiment is example
Property, it is impossible to limitation of the present invention is interpreted as, one of ordinary skill in the art is not departing from principle of the invention and objective
In the case of above-described embodiment can be changed within the scope of the invention, change, replace and modification.The scope of the present invention
By appended claims and its equivalent limit.
Claims (7)
1. it is a kind of to generate the polygonal method of isopleth, it is characterised in that to comprise the following steps：
Step S1, chooses isogram G, wherein, the isogram G includes：Boundary curve collection, closed contour collection, opening
Level sets；
Step S2, from the isogram G, asks for the intersection point of all open isopleth and boundary line, is stored in intersection point chained list C,
And be ranked up to the distance of border starting point according to intersection point；
Step S3, is starting with each intersection point and its latter line segment of intersection point according to ranking results, and tracking includes the line segment
In interior polygon, generation polygon chained list P；
Step S4, the element that the element in the polygon chained list P is concentrated with closed contour successively is compared, and searches bag
Containing relation, inclusion relation tree T is built；
Step S5, multiple hole type polygons or conventional polygon are generated using the relational tree T；
Step S6, exports the polygon, and different attribute polygon is made a distinction according to polygonal region property value.
2. it is as claimed in claim 1 to generate the polygonal method of isopleth, it is characterised in that in the step S2, will to hand over
Point is stored in the intersection point chained list C, wherein, described each intersection point is stored with following information in the intersection point chained list C：To each friendship
The point current isopleth sequence number of mark, intersection point along boundary line to border starting point distance, the intersection point is the head or afterbody of isopleth.
3. it is as claimed in claim 1 to generate the polygonal method of isopleth, it is characterised in that in the step S3, according to
Ranking results, it is the single polygon on border that the line segment of two neighboring intersection point is asked for successively, and by the above-mentioned multiple being calculated
Polygon is stored in polygon chained list P.
4. it is as claimed in claim 1 to generate the polygonal method of isopleth, it is characterised in that in the step S4, by institute
State the element in polygon chained list P and concentrate element ratio compared with the following inclusion relation of lookup with the closed contour in step S1 successively：
If one or more closures that a polygonal internal in the polygon chained list is concentrated comprising the closed contour etc.
Value line, then build inclusion relation tree T.
It is 5. as claimed in claim 4 to generate the polygonal method of isopleth, it is characterised in that the relational tree T is multiway tree,
Its root node is corresponding polygon, and other nodes represent a closed contour respectively, and outside root node, each node is equivalent
Line is included in its father node polygonal internal.
6. it is as claimed in claim 5 to generate the polygonal method of isopleth, it is characterised in that described in the step S5
Multiple hole type polygons or conventional polygon are generated using relational tree T, including：
Polygon pk1 is generated by root node and its child node first, its child node is then traveled through, if any node is saved comprising son
Point, then the node and its all child node generation hole type polygon pki, if the node does not include child node, directly return
Polygon on the node, the like, generate all polygons in the tree.
7. it is as claimed in claim 1 to generate the polygonal method of isopleth, it is characterised in that described in the step S6
Different attribute polygon is made a distinction according to polygonal region property value, is comprised the following steps：To the polygon of different attribute
It is filled using different colors, to show difference.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710096655.7A CN106898033B (en) | 2017-02-22 | 2017-02-22 | Method for generating contour line polygon |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710096655.7A CN106898033B (en) | 2017-02-22 | 2017-02-22 | Method for generating contour line polygon |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106898033A true CN106898033A (en) | 2017-06-27 |
| CN106898033B CN106898033B (en) | 2023-03-28 |
Family
ID=59185126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710096655.7A Active CN106898033B (en) | 2017-02-22 | 2017-02-22 | Method for generating contour line polygon |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106898033B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608010A (en) * | 2017-10-12 | 2018-01-19 | 江苏航天大为科技股份有限公司 | A kind of urban water affairs rainfall isoplethes drawing method and drawing system |
| CN111768464A (en) * | 2019-04-01 | 2020-10-13 | 珠海金山办公软件有限公司 | Graph adjusting method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010126176A1 (en) * | 2009-04-28 | 2010-11-04 | Choi Joonsoo | Method for partitioning region represented by contours into smaller polygonal zones and calculating digital elevation model data and geographic surface configuration data, and recording medium in which program for implementing method is recorded |
| CN102982566A (en) * | 2012-06-19 | 2013-03-20 | 克拉玛依红有软件有限责任公司 | Fault-containing contour map automatic generation method based on minimum curvature method interpolation |
-
2017
- 2017-02-22 CN CN201710096655.7A patent/CN106898033B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010126176A1 (en) * | 2009-04-28 | 2010-11-04 | Choi Joonsoo | Method for partitioning region represented by contours into smaller polygonal zones and calculating digital elevation model data and geographic surface configuration data, and recording medium in which program for implementing method is recorded |
| CN102982566A (en) * | 2012-06-19 | 2013-03-20 | 克拉玛依红有软件有限责任公司 | Fault-containing contour map automatic generation method based on minimum curvature method interpolation |
Non-Patent Citations (4)
| Title |
|---|
| 冶运涛等: "虚拟环境中基于多叉树的降雨时空分布等值线填充算法研究", 《水力发电学报》 * |
| 徐胜利: "一种堆栈式快速等值线图填充算法", 《计算机工程与应用》 * |
| 郭新奇等: "基于VC++的等值线追踪与填充算法", 《兵工自动化》 * |
| 韩丽娜等: "基于边界点追踪的等值线图区域填充算法", 《计算机工程与科学》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608010A (en) * | 2017-10-12 | 2018-01-19 | 江苏航天大为科技股份有限公司 | A kind of urban water affairs rainfall isoplethes drawing method and drawing system |
| CN111768464A (en) * | 2019-04-01 | 2020-10-13 | 珠海金山办公软件有限公司 | Graph adjusting method and device |
| CN111768464B (en) * | 2019-04-01 | 2023-09-19 | 珠海金山办公软件有限公司 | Graph adjustment method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106898033B (en) | 2023-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Le Brocq et al. | An improved Antarctic dataset for high resolution numerical ice sheet models (ALBMAP v1) | |
| CN100526807C (en) | Navigation apparatus and method for displaying map using the same | |
| CN104794709B (en) | A kind of dividing method of three-dimensional core image hole and venturi | |
| CN106202744A (en) | Wind power collection system of offshore wind power plant avoidance method for optimizing route and system | |
| CN106875481B (en) | A kind of production method of three-dimensional visualization remote sensing image Surface classification model | |
| CN102982566B (en) | A kind of isogram automatic generation method containing tomography based on minimum-curvature method interpolation | |
| CN109523630A (en) | A kind of contour lines creation method and device based on tensile splines interpolation | |
| CN107564087A (en) | A kind of Three-D linear symbol rendering intent based on screen | |
| CN106898033A (en) | One kind generation polygonal method of isopleth | |
| CN101593454A (en) | A kind of intelligent output method for land parcel maps | |
| Buchin et al. | Geo word clouds | |
| CN105354335B (en) | For the time-varying tree graph layout method of time-varying hierarchical data and application | |
| CN115757604B (en) | GDP space-time evolution analysis method based on noctilucent image data | |
| CN107291918A (en) | A kind of visual mining methods of point of interest POI with bit pattern | |
| CN108256218A (en) | A kind of subterranean communication tunnel fine modeling method based on actual measurement stringcourse data | |
| CN104699791B (en) | A kind of path restoring method for being used to damage floating wheel paths | |
| CN106157371A (en) | The efficient gridding method of dispersion point cloud based on self adaptation adjacent circumferential expansion strategy | |
| CN112687007B (en) | Stereoscopic grid chart generation method based on LOD technology | |
| CN110335329A (en) | A method of power circuit cross-section diagram is obtained based on DEM | |
| CN105608127A (en) | Farmland tenure publicity map automatically generating method | |
| CN115035225B (en) | Battlefield threat assessment warning method based on OSG | |
| CN109712237B (en) | Mixed color setting method based on elevation data and meteorological data | |
| CN114705204A (en) | High-precision map generation method based on road basic design data | |
| CN107067446A (en) | A kind of contour proximity relations judges and direction automatic adjusting method | |
| Zhang et al. | A collaborative simplification method for multiple coastlines based on the hierarchical triangulation network partition |
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 |