CN105139435A - Boundary unicursal method for processing polygon multiplex inclusion relation - Google Patents
Boundary unicursal method for processing polygon multiplex inclusion relation Download PDFInfo
- Publication number
- CN105139435A CN105139435A CN201510465283.1A CN201510465283A CN105139435A CN 105139435 A CN105139435 A CN 105139435A CN 201510465283 A CN201510465283 A CN 201510465283A CN 105139435 A CN105139435 A CN 105139435A
- Authority
- CN
- China
- Prior art keywords
- polygon
- polygonal
- connecting line
- inclusion
- relation
- 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
Abstract
The invention provides a boundary unicursal method for processing the polygon multiplex inclusion relation. A boundary unicursal method based on a shortest connecting wire is introduced; the goal of reasonable boundary connection and organization on the premise of maintaining the topological relation consistency of a complex polygon is effectively achieved; the complexity and the redundancy of data are avoided; and the map hierarchical display correctness is effectively ensured.
Description
Technical field
The present invention relates in map vector the border method for organizing of the complex polygon that there is relation of inclusion, particularly to the unicursal border method for organizing that the polygon with objective attribute target attribute merges.
Background technology
In map vector, there is the complex polygon of multiple relation of inclusion, mainly contain three kinds of tissues and real mode.The first is sorted according to different levels at each key element of complex polygon, and then processed according to sequence by computer program.Whether second method complex polygon is divided into multiple original triangle, grid or simple polygon, then detect each original factor visible, finally visible key element described.The third method have employed 3D model and translucent technology to describe the independent sector of complex polygon.
All there are some defects in three kinds of above methods.First method have ignored the globality of target, and there is redundancy when storage node information.Second method only when all key element of complex polygon can by when strict sequence just effectively, no longer applicable when the key element of different layers is mutually nested.The third method is by the complex structure of target, and because the transparent colour superimposition caused, image is described very fuzzy.
Summary of the invention
Object of the present invention is in order to solve the polygon of multiple relation of inclusion when carrying out Organization of Data, a unified object has to be split as multiple object and the problem of the data redundancy caused, and it also avoid point laminated cover problem in computing machine reality simultaneously.
Technical scheme of the present invention is: a kind of border unicursal method processing the multiple relation of inclusion of polygon, comprises the following steps:
Step 1., by plane geometry coordinate, judges the topological relation between the inner polygon of all target areas, and according to polygonal specific objective attribute, the polygonal relation of inclusion of initialization; All multiple relation of inclusion are decomposed into the inside and outside two-layer relation of inclusion of many levels;
Step 2. extracts the polygon of the two-layer relation of inclusion of innermost layer, as the base unit of loop limit tissue;
Step 3. finds each the shortest polygonal connecting line;
Step 4. organizes the new border of polygonal unicursal of two-layer relation of inclusion;
Step 5. judges that the outer polygon of two-layer relation of inclusion is the outermost polygon in whole workspace, if not then returning step 2 circular treatment, if it is terminates.
Preferably, in described step 3, the shortest connecting line found between polygon need be followed: the definition of the shortest connecting line and searching principle.
Preferably, the shortest described connecting line is defined as: between certain polygonal all form point and other polygon all models points, and that the shortest connecting line of distance is then this shortest polygonal connecting line.
Preferably, the searching principle of the shortest described connecting line is: need ensure that all polygons all can be connected as a single entity by the shortest connecting line; When internal layer polygonal segment couples together with the shortest connecting line mutually, and when not being connected with other polygons, these polygons are set to a combination polygon, again find and the shortest connecting line between other polygons be not yet connected, until all polygons of two-layer relation of inclusion of the institute innermost layers of 2 selections in steps all couple together.
Preferably, organize the new border of polygonal unicursal of two-layer relation of inclusion in described step 4, undertaken by following sub-step:
Step 4.1: select outer any one form point polygonal to be the starting point on the new border of unicursal;
Step 4.2: according to the polygonal boundary direction of skin after step 1 initialization adjustment, connect outer polygonal form point successively, until an outer polygonal connecting line the shortest is at the polygonal end points of skin;
Step 4.3: from the end points of this shortest connecting line along the shortest connecting line, be connected to the polygonal end points of internal layer;
Step 4.4: according to the polygonal boundary direction of internal layer after step 1 initialization adjustment, connect the polygonal form point of internal layer successively, until the end points of the shortest connecting line of the next one; If this shortest connecting line connects two internal layer polygons, be then connected in another internal layer polygon by the shortest connecting line, and continue to connect the polygonal form point of internal memory according to boundary direction, until the end points of step 4.3, thus connection is back to outer polygon; If two polygons of what this shortest connecting line was connected to is ectonexine, are back to outer polygon;
Step 4.5: if the shortest connecting line on outer polygon only has one, then according to the polygonal border organizer of skin to, be connected to the starting point of step 4.1; If the shortest connecting line on outer polygon is greater than one, then repeat step 4.2 to 4.4, until connect back the starting point of step 4.1.
Preferably, in described step 4.3 and step 4.4, a certain end points place exist many shortest connecting line when, need the way of a selection connecting line the shortest to be: according to polygonal boundary direction, with the shortest connecting line entering connecting line and formed minimum angles, it is the shortest connecting line that will find.
Preferably, described polygonal specific objective attribute is relation of inclusion; The polygon in target setting region with this particular community is target polygon, and the polygon of other attributes is non-targeted polygon, and processes according to following topological relation;
Between target polygon and target polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Separation case does not process;
Between non-targeted polygon and non-targeted polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Situation about being separated does not process;
Between target polygon with non-targeted polygon: if crossing, then intersecting area is judged to be target polygon or non-targeted polygon, then carries out non-targeted polygon or the polygonal cutting process of target; If inner tangent, then polygonal for outside border is organized again, by inscribe polygon cutting process; Separation, the external world and relation of inclusion do not process;
By the process of above topological relation, then only there is relation of inclusion and separation relation between the polygon in target area;
Finally, by target polygon and non-targeted polygonal border organizer to being adjusted to contrary direction, one is that one is counterclockwise clockwise.This is initialization polygon relation of inclusion, and carries out the mission critical of Polygonal Boundary tissue, and all multiple relation of inclusion are decomposed into the inside and outside two-layer relation of inclusion of many levels.
The invention has the beneficial effects as follows: a kind of border unicursal method processing the multiple relation of inclusion of polygon, introduce the border unicursal method based on the shortest connecting line, under efficiently solving the conforming prerequisite of complex polygon maintenance topological relation, carry out the problem of rational contour connection and tissue, avoid complicacy and the redundancy of data, effectively ensure the correctness of map delamination display.
Accompanying drawing explanation
Fig. 1 is schematic flow sheet of the present invention;
Fig. 2 is the border unicursal connected mode schematic diagram of relation of inclusion one to one;
Fig. 3 is in two-layer relation of inclusion, and a form point exists the schematic diagram of two connecting lines the shortest;
Fig. 4 is in three layers of relation of inclusion, and a form point exists the schematic diagram of inside and outside two connecting lines the shortest.
Embodiment
Understand for the ease of those of ordinary skill in the art and implement the present invention, below in conjunction with the drawings and the specific embodiments, the present invention is described in further detail.
As shown in Figure 1, be schematic flow sheet of the present invention, by five steps, by the polygon of a certain region internal object object, by plane geometry coordinate and specific objective attribute, judge the polygonal multiple relation of inclusion of target.And find the shortest connecting line according to the definition of the shortest connecting line and principle, iteration carries out the border tissue of two-layer relation of inclusion from the inside to surface, until the whole unicursal of the polygonal efficiency frontier of all targets connects and tissue, thus the polygon solving multiple relation of inclusion is when carrying out Organization of Data, a unified object has to be split as multiple object and the problem of the data redundancy caused, and it also avoid point laminated cover problem in computing machine reality simultaneously.
The specific implementation of five steps following detailed description.
Step 1, by plane geometry coordinate, judge the topological relation between the inner polygon of all target areas, and according to polygonal specific objective attribute, the polygonal relation of inclusion of initialization; All multiple relation of inclusion are decomposed into the inside and outside two-layer relation of inclusion of many levels;
In step 1, be target polygon by the polygon definition with specific objective attribute, the polygon definition with other attributes is non-targeted polygon, and by two class polygonal border organizers to being adjusted to contrary direction, namely a class polygon is all adjusted to clockwise, is another kind ofly all adjusted to counterclockwise.After processing other topological relations, all multiple relation of inclusion are decomposed into two-layer relation of inclusion inside and outside many levels and organize.
Topological relation between plane polygon comprises: be separated, outer abutment, intersects, inner tangent, 5 kinds of topological relations such as to comprise.By the geometric coordinate of polygon form point, the judgement of topological relation can be carried out by multiple mathematical method; This is prior art.
The main research object of this method is relation of inclusion, and especially for the polygon of each the specific objective attribute in target area, and the polygon that setting has this specific objective attribute is target polygon, and the polygon of other attributes is non-targeted polygon.Carry out according to following topological relation treatment step:
Between target polygon and target polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Situation about being separated does not process;
Between non-targeted polygon and non-targeted polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Situation about being separated does not process;
Between target polygon with non-targeted polygon: if crossing, then intersecting area is judged to be target polygon or non-targeted polygon, then carries out non-targeted polygon or the polygonal cutting process of target; If inner tangent, then polygonal for outside border is organized again, by inscribe polygon cutting process.Separation, the external world and relation of inclusion do not process.
By the process of above topological relation, then only there is relation of inclusion and separation relation between the polygon in target area.
Finally, by target polygon and non-targeted polygonal border organizer to being adjusted to contrary direction, one is that one is counterclockwise clockwise.This is initialization polygon relation of inclusion, and carries out the mission critical of Polygonal Boundary tissue.
Road unit after comprehensive preserves following database table respectively:
Specifically, all polygonal borders adopt following two database tables to preserve.
Form one: polygon form Polygon
Form two: polygonal form point form Point
| Field name | Field type | Key | Field contents |
| Point_ID | int | PK | The ID of form point, major key |
| Polygon_ID | int | FK | Polygonal ID, external key |
| Coordinate_X | float | Precision (X-coordinate) | |
| Coordinate_Y | float | Dimension (Y-coordinate) |
The form point of same coordinate may be recorded repeatedly, but the ID of form point (Point_ID) is different.Such form point is the end points of the shortest connecting line, is used multiple times.
Relation of inclusion between polygon adopts following database table to preserve.
Form three: polygon relation of inclusion table I nclusion
Step 2, extracts the two-layer polygon of innermost layer relation of inclusion, as the base unit of loop limit tissue;
Are border organizational process that a circulation is carried out from step 2 to step 5, according to the level of relation of inclusion, process from the inside to surface, can perform, from maximum hierachy number according to the level Inclusion_Level of the relation of inclusion of form three.And, these relation of inclusion can not man-to-man simple process, but by polygonal for skin IDPolygon_Outer_ID and the identical all internal layer polygons of outer polygon all by data base querying, all internal layer polygons comprised with it by outer polygon are as the data basis of subsequent step tissue.
Step 3, finds each the shortest polygonal connecting line.
The shortest connecting line found in described step 3 between polygon need be followed: the definition of the shortest connecting line and searching principle.
The shortest described connecting line is defined as: between certain polygonal all form point and other polygon all models points, and that the shortest connecting line of distance is then this shortest polygonal connecting line.
The searching principle of the shortest described connecting line is: need ensure that all polygons all can be connected as a single entity by the shortest connecting line; When internal layer polygonal segment couples together with the shortest connecting line mutually, and when not being connected with other polygons, these polygons are set to a combination polygon, again find and the shortest connecting line between other polygons be not yet connected, until all polygons of two-layer relation of inclusion of the institute innermost layers of 2 selections in steps all couple together.
Finding the shortest polygonal object is exactly that all polygons of the two-layer relation of inclusion in step 2 are all linked as one.Here define between certain polygonal all form point and all form points of other polygons, that the shortest connecting line of distance is then this shortest polygonal connecting line.If but several polygons of interior layer segment couple together with the shortest connecting line mutually, and when not being connected with other polygons, just need to regard these polygons as an entirety, again find the shortest connecting line between other polygons, until all polygons of two-layer relation of inclusion can both be coupled together by the shortest connecting line.
The most basic finding method of the shortest connecting line is exactly the calculating being carried out distance between any two by this polygonal form point and all form point of other polygons, and what distance was the shortest is the shortest connecting line.In order to improve counting yield, can be undertaken by methods such as spatial indexs.Space index method is prior art.
Finally following database table is adopted to carry out record the shortest connecting line:
Form four: the shortest connecting line form Shortest_Link
Step 4, organizes the new border of polygonal unicursal of two-layer relation of inclusion;
Step 4 comprises following sub-step and carries out:
Step 4.1:: select outer any one form point polygonal to be the starting point on the new border of unicursal.
According to form one, a newly-built polygonal ID, sets that new polygonal boundary number is 1, polygon attribute and outer polygon attribute is consistent, polygonal eigenwert is set as 1.Thereafter polygonal for skin eigenwert is set to 0.
According to form two, a newly-built form point record, by the new polygonal ID of correspondence, the X of this starting point, in Y-coordinate write record.
Step 4.2:: according to the polygonal boundary direction of skin after step 1 initialization adjustment, connect outer polygonal form point successively, until an outer polygonal connecting line the shortest is the polygonal end points of skin (being namely an outer polygonal form point).
According to form two, a newly-built form point record, by the new polygonal ID of correspondence, the shortest connecting line is at the X of the polygonal end points of skin, and Y-coordinate writes in record.In form one, 1 is added to new polygonal form point quantity.
Step 4.3: from the end points of this shortest connecting line along the shortest connecting line, be connected to the polygonal end points of internal layer (being namely the polygonal form point of internal layer).
The annexation of ectonexine can according to form four: the shortest connecting line form Shortest_Link inquires about and obtains, and uses once connection, and corresponding connection status Slink_Flag will be set as 1.
According to form two, a newly-built form point record, by the new polygonal ID of correspondence, the shortest connecting line is at the X of the polygonal end points of internal layer, and Y-coordinate writes in record; In form one, 1 is added to new polygonal form point quantity; The polygon eigenwert of the record of internal layer polygon in form one organized is changed to 0; The state I nclusion_Flag of the relation of inclusion corresponding to form three changes 0 into.
Step 4.4: according to the polygonal boundary direction of internal layer after step 1 initialization adjustment, connect the polygonal form point of internal layer successively, until the end points of the shortest connecting line of the next one.If this shortest connecting line connects two internal layer polygons, be then connected in another internal layer polygon by the shortest connecting line, and continue to connect the polygonal form point of internal memory according to boundary direction, until the form point of step 4.3, thus connection is back to outer polygon; If it is two polygons of ectonexine that this shortest connecting line is connected to, i.e. the form point of Connection Step 4.3, is back to outer polygon.
The annexation of ectonexine can according to form four: the shortest connecting line form Shortest_Link inquires about and obtains, and once use, corresponding connection status Slink_Flag will be set as 1.
According to form two, according to the polygonal form point quantity of connected internal layer, newly-increased corresponding form point record, and by the X of corresponding form point, in Y-coordinate write record; Form point quantity in form one also increases accordingly; The polygon eigenwert of the record of internal layer polygon in form one organized is changed to 0; The state I nclusion_Flag of the relation of inclusion corresponding to form three changes 0 into.
Step 4.5:: if the shortest connecting line on outer polygon only has one, then according to the polygonal border organizer of skin to, be connected to step 4.1: starting point; If the shortest connecting line on outer polygon is greater than one, then repeat step 4.2 to 4.4, until connect back the starting point of step 4.1.
According to form two, according to connected internal layer and the polygonal form point quantity of skin, newly-increased corresponding form point record, and by the X of corresponding form point, in Y-coordinate write record.Form point quantity in form one also increases accordingly; Require emphasis, last coordinate points is not starting point, but last adjacent with it form point.If outer the shortest polygonal connecting line is greater than one, relate in the step 4 that circulation performs the polygon eigenwert of the record of internal layer polygon in form one change to 0; The state I nclusion_Flag of the relation of inclusion corresponding to form three changes 0 into.
In described step 4.3 and step 4.4, a certain end points place exist many shortest connecting line when, needing the way of a selection connecting line the shortest to be: according to polygonal boundary direction, with the shortest connecting line entering connecting line and formed minimum angles, is the shortest connecting line that will find.
Above step can the border unicursal connected mode of most typical relation of inclusion one to one that identifies of reference diagram 2.Outer polygonal border is the b1 of tissue counterclockwise, and the polygonal border of internal layer is the b2 of tissue clockwise; S point and z point are two form points on outer polygon b1; C point and d point are two form points on internal layer polygon b2.The shortest connecting line is a point on outer polygon b1, internal layer polygon b2 is b point.So the new border setting of unicursal tissue is organized, thereafter successively through a, b, c from s point, d, b, a, with z point, finally arrive s point stop (in data base organization last point is not s point, but first form point of s point in b1 clockwise direction).By that analogy, both the multiple polygon of organization internal and outer polygon the situation of the shortest multiple connecting line can be there is.
In addition, in above-mentioned steps 4.3 and step 4.4, a certain form point place may exist many shortest connecting line when, need the way of a selection connecting line the shortest: according to polygonal boundary direction, with the shortest connecting line entering connecting line and formed minimum angles, it is namely the shortest connecting line that will find.
With reference to two kinds of situations that figure 3 or Fig. 4 identifies, namely same form point is present in same two-layer relation of inclusion, or same form point is present in three layers of large relation of inclusion, according to the method for an above-mentioned selection connecting line the shortest, then can be organized into the organizer shown in correct arrow in Fig. 3 and Fig. 4 to.
Step 5, judging that the outer polygon of two-layer relation of inclusion is the outermost polygon in whole workspace, if not returning step 2 circular treatment, if it is terminating.
According to the Inclusion_Level of form three, according to numerical value from big to small, all situations that comprises are processed, all relation of inclusion being greater than 1 are instructed all to be disposed, finally processing Inclusion_Level is 1, and namely after outermost relation of inclusion, then this algorithm terminates.Finally can obtain a complete unicursal border.
So far, the polygonal eigenwert of target only having a up-to-date additional border unicursal tissue in form one is 1, and all the other are all set to 0.The state of the relation of inclusion of form three is all set to 0.The connection status of the shortest connecting line of form four is all set to 1.
The above, only that specific embodiment of the invention case is described, and be not used to limit of the present invention can practical range, such as all equivalences that those skilled in the art complete under the spirit do not departed from indicated by the present invention and principle change or modify, and must be covered by the scope of the claims in the present invention.
Claims (7)
1. process a border unicursal method for the multiple relation of inclusion of polygon, it is characterized in that, comprise the following steps:
Step 1., by plane geometry coordinate, judges the topological relation between the inner polygon of all target areas, and according to polygonal specific objective attribute, the polygonal relation of inclusion of initialization; All multiple relation of inclusion are decomposed into the inside and outside two-layer relation of inclusion of many levels;
Step 2. extracts the polygon of the two-layer relation of inclusion of innermost layer, as the base unit of loop limit tissue;
Step 3. finds each the shortest polygonal connecting line;
Step 4. organizes the new border of polygonal unicursal of two-layer relation of inclusion;
Step 5. judges that the outer polygon of two-layer relation of inclusion is the outermost polygon in whole workspace, if not then returning step 2 circular treatment, if it is terminates.
2. a kind of border unicursal method processing the multiple relation of inclusion of polygon according to claim 1, it is characterized in that, the shortest connecting line found in described step 3 between polygon need be followed: the definition of the shortest connecting line and searching principle.
3. the border unicursal method of multiple relation of inclusion according to claim 3, it is characterized in that, the shortest described connecting line is defined as: between certain polygonal all form point and other polygon all models points, and that the shortest connecting line of distance is then this shortest polygonal connecting line.
4. a kind of border unicursal method processing the multiple relation of inclusion of polygon according to claim 3 is characterized in that, the searching principle of the shortest described connecting line is: need ensure that all polygons all can be connected as a single entity by the shortest connecting line; When internal layer polygonal segment couples together with the shortest connecting line mutually, and when not being connected with other polygons, these polygons are set to a combination polygon, again find and the shortest connecting line between other polygons be not yet connected, until all polygons of two-layer relation of inclusion of the institute innermost layers of 2 selections in steps all couple together.
5. a kind of border unicursal method processing the multiple relation of inclusion of polygon according to claim 1, is characterized in that, organize the new border of polygonal unicursal of two-layer relation of inclusion, undertaken by following sub-step in described step 4:
Step 4.1: select outer any one form point polygonal to be the starting point on the new border of unicursal;
Step 4.2: according to the polygonal boundary direction of skin after step 1 initialization adjustment, connect outer polygonal form point successively, until an outer polygonal connecting line the shortest is at the polygonal end points of skin;
Step 4.3: from the end points of this shortest connecting line along the shortest connecting line, be connected to the polygonal end points of internal layer;
Step 4.4: according to the polygonal boundary direction of internal layer after step 1 initialization adjustment, connect the polygonal form point of internal layer successively, until the end points of the shortest connecting line of the next one; If this shortest connecting line connects two internal layer polygons, be then connected in another internal layer polygon by the shortest connecting line, and continue to connect the polygonal form point of internal memory according to boundary direction, until the end points of step 4.3, thus connection is back to outer polygon; If two polygons of what this shortest connecting line was connected to is ectonexine, are back to outer polygon;
Step 4.5: if the shortest connecting line on outer polygon only has one, then according to the polygonal border organizer of skin to, be connected to the starting point of step 4.1; If the shortest connecting line on outer polygon is greater than one, then repeat step 4.2 to 4.4, until connect back the starting point of step 4.1.
6. a kind of border unicursal method processing the multiple relation of inclusion of polygon according to claim 5, it is characterized in that, in described step 4.3 and step 4.4, a certain end points place exist many shortest connecting line when, the way of a selection connecting line the shortest is needed to be: according to polygonal boundary direction, with the shortest connecting line entering connecting line and formed minimum angles, it is the shortest connecting line that will find.
7. a kind of border unicursal method processing the multiple relation of inclusion of polygon according to claim 1, is characterized in that: described polygonal specific objective attribute is relation of inclusion; The polygon in target setting region with this particular community is target polygon, and the polygon of other attributes is non-targeted polygon, and processes according to following topological relation;
Between target polygon and target polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Separation case does not process;
Between non-targeted polygon and non-targeted polygon: if outer abutment, intersect, inner tangent, comprise, all merge; Situation about being separated does not process;
Between target polygon with non-targeted polygon: if crossing, then intersecting area is judged to be target polygon or non-targeted polygon, then carries out non-targeted polygon or the polygonal cutting process of target; If inner tangent, then polygonal for outside border is organized again, by inscribe polygon cutting process; Separation, the external world and relation of inclusion do not process;
By the process of above topological relation, then only there is relation of inclusion and separation relation between the polygon in target area;
Finally, by target polygon and non-targeted polygonal border organizer to being adjusted to contrary direction, one is clockwise, another is counterclockwise, this is initialization polygon relation of inclusion, and carry out Polygonal Boundary tissue, all multiple relation of inclusion are decomposed into two-layer relation of inclusion inside and outside many levels.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510465283.1A CN105139435B (en) | 2015-07-31 | 2015-07-31 | A kind of border unicursal method for handling the multiple inclusion relation of polygon |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510465283.1A CN105139435B (en) | 2015-07-31 | 2015-07-31 | A kind of border unicursal method for handling the multiple inclusion relation of polygon |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105139435A true CN105139435A (en) | 2015-12-09 |
| CN105139435B CN105139435B (en) | 2017-12-08 |
Family
ID=54724767
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510465283.1A Expired - Fee Related CN105139435B (en) | 2015-07-31 | 2015-07-31 | A kind of border unicursal method for handling the multiple inclusion relation of polygon |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105139435B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563449A (en) * | 2017-09-12 | 2018-01-09 | 西北工业大学 | Online more stroke axles based on region public boundary survey sketch clustering method |
| CN110019984A (en) * | 2017-12-27 | 2019-07-16 | 北京小度信息科技有限公司 | Spatial index method for building up, device, electronic equipment and readable storage medium storing program for executing |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101251929A (en) * | 2008-02-29 | 2008-08-27 | 浙江大学 | Method for building area topological relation based on Delaunay triangular mesh technology |
| CN102360387A (en) * | 2011-10-19 | 2012-02-22 | 浙江大学 | Method for outputting geometric data of facet element of vector data transfer format of topology 1 |
| US20140247285A1 (en) * | 2011-07-04 | 2014-09-04 | Sony Computer Entertainment Inc. | Image display system, information processing device, server, and image processing method |
-
2015
- 2015-07-31 CN CN201510465283.1A patent/CN105139435B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101251929A (en) * | 2008-02-29 | 2008-08-27 | 浙江大学 | Method for building area topological relation based on Delaunay triangular mesh technology |
| US20140247285A1 (en) * | 2011-07-04 | 2014-09-04 | Sony Computer Entertainment Inc. | Image display system, information processing device, server, and image processing method |
| CN102360387A (en) * | 2011-10-19 | 2012-02-22 | 浙江大学 | Method for outputting geometric data of facet element of vector data transfer format of topology 1 |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563449A (en) * | 2017-09-12 | 2018-01-09 | 西北工业大学 | Online more stroke axles based on region public boundary survey sketch clustering method |
| CN107563449B (en) * | 2017-09-12 | 2020-04-03 | 西北工业大学 | Online multi-stroke sketch measuring and clustering method based on regional common boundary |
| CN110019984A (en) * | 2017-12-27 | 2019-07-16 | 北京小度信息科技有限公司 | Spatial index method for building up, device, electronic equipment and readable storage medium storing program for executing |
| CN110019984B (en) * | 2017-12-27 | 2021-10-29 | 北京星选科技有限公司 | Spatial index establishing method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105139435B (en) | 2017-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109145366B (en) | Web 3D-based lightweight visualization method for building information model | |
| Zhou et al. | Edge bundling in information visualization | |
| CN106683167B (en) | Automatic modeling method for high-precision model of complex building | |
| CN104361632B (en) | A kind of triangle gridding filling-up hole method based on Hermite RBFs | |
| CN102306396B (en) | Three-dimensional entity model surface finite element mesh automatic generation method | |
| US9030475B2 (en) | Method of computer-aided design of a modeled object having several faces | |
| JP6513914B2 (en) | Path design connecting the first point and the second point in a 3D scene | |
| US7557803B2 (en) | Method, computer program product and data structure for representing two- or three-dimensional object modeling | |
| CN109360260A (en) | A kind of cut-away restructing algorithm of triangle gridding threedimensional model | |
| US20080291199A1 (en) | Computer-aided design apparatus | |
| Zhao et al. | Mathematical morphology-based generalization of complex 3D building models incorporating semantic relationships | |
| CN108073682A (en) | Based on parameter view functional query database | |
| CN105809735A (en) | Topology maintenance method based on three-dimensional geometric body combination | |
| Yuan et al. | Feature preserving multiresolution subdivision and simplification of point clouds: A conformal geometric algebra approach | |
| CN106780748A (en) | A kind of quaternary tree index point cloud sort method based on grid association | |
| CN104809760A (en) | Depth-first strategy based method for automatically constructing geo-spatial three-dimensional outline | |
| CN109544687A (en) | A kind of orientation Story and door based map extended method | |
| CN105139435A (en) | Boundary unicursal method for processing polygon multiplex inclusion relation | |
| EP1547020B1 (en) | Irregular mesh and embedded geometric description in a computer graphics system | |
| CN109509259A (en) | A kind of reconstruction of medical images contour surface grid-search method method | |
| US7439987B2 (en) | Vector graphic normalizer | |
| CN102254093B (en) | Connected domain statistical correlation algorithm based on Thiessen polygon | |
| CN103020402B (en) | Modeling method and modeling device | |
| Xia et al. | A fast and automatic hole-filling method based on feature line recovery | |
| CN107644139B (en) | Attribute mapping method from CAD model to CAE model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171208 Termination date: 20200731 |