CN104090945B

CN104090945B - Geographic space entity constructing method and system

Info

Publication number: CN104090945B
Application number: CN201410309906.1A
Authority: CN
Inventors: 虞昌彬; 郭仁忠; 李霖; 赵志刚; 贺彪
Original assignee: Wuhan University WHU
Current assignee: Wuhan University WHU
Priority date: 2014-06-30
Filing date: 2014-06-30
Publication date: 2015-03-25
Anticipated expiration: 2034-06-30
Also published as: CN104090945A

Abstract

The invention provides a geographic space entity constructing method and system, and belongs to the technical field of geographic space data organization and modeling. According to the technical scheme, the constructing method includes the steps of searching for construction units on the outer contour of a result primitive set, searching for the outer contour of the result primitive set and searching for the result primitive set. The kernel of the constructing method is the sorting process of construction primitive bundles, and the using process of the construction primitives is recorded in the mode of marking the construction primitives in the construction process. The constructing method and system are suitable for constructing two-dimensional polygons through one-dimensional constructed edge/chain topologies and suitable for constructing three-dimensional entities through two-dimensional constructed planar piece topologies, and the two construction process are logically unified. The geographic space entity constructing method and system can be used for automatic topology construction of three-dimensional cadastre property right bodies, implement is easy and convenient to carry out, and results are reliable.

Description

A kind of geospatial entity construction method and system

Technical field

The present invention relates to the technical field of geographical spatial data tissue and modeling, especially relate to a kind of geospatial entity based on uniform logical topology method for auto constructing and system.

Background technology

In GIS (Geographical Information Sciences) field, spatial entities type can be divided into geometry entity type and topological entity type (Van Oosterom, P., Stoter, J., Quak, W., Zlatanova, S. (2002) .The Balance between Geometry andTopology.Proceedings of the10 ^thinternational Sympoiusm on Spatial Data Handling, 16p; Mehta, D.P., Sahni, S. (2005) .Handbook of Structures and Applications [M] .A CRC Press Company; Schneider, M. (1997) .Spatial Data Types_A Survey.Spatial Data Types for Database Systems, Lecture Notes in Computer Science Volume, Springer Berlin Heidelberg, pp.11-83; Guo Renzhong. (2001). spatial analysis [M], Higher Education Publishing House .).In early days, the research for geometry entity type is some more; Along with going deep into of research, find that modeling and the storage mode of geometry entity type also exist many disadvantages, so turned to the research of topological entity type, the latter's more more complex than the former (to be embodied on data modeling, in storage, visual etc. various aspects), but owing to saving topology information preferably, entity correctness that is inner, topological relation between entity and entity can be ensured.For the Data Structure Design of polygon modeling, what propose in early days comprises noodles model (SpaghettiModel), polygon model (Polygon Model), some dictionary model (Point Dictionary Model), a chain/dictionary model (Chain/Point Dictionary Model) for modeling and the polygonal geometric data structure of storage.Concrete, in noodles model, record is carried out in the mode of coordinate string in each polygonal border, but need not be mutually corresponding between coordinate string and polygon; In polygon model, polygonal boundary point coordinate separate records in units of polygon is got off, during such data processing, each polygon is easy to be identified and extract, but the public limit of two adjacent polygons is still repeatedly recorded twice, this easily causes producing " lobelet " between two adjacent polygons; In a dictionary model, record be the coding of each point in each Polygonal Boundary, and record the coordinate value of each point in data dictionary mode, the conversion between coding and coordinate value can be realized by dictionary, thus avoid " lobelet ", but public boundary is put still have recorded twice; In a chain/dictionary model, each polygon records the chain forming it, and the point forming it recorded again by every bar chain, and each point records its coordinate value again, is divided into three steps like this to polygonal retrieval.Above four kinds of models are inherently geometric data structures, are all treated as independent community by each polygon, can not identify the neighbouring relations between polygon, be unfavorable for the analysis of geodata.Afterwards, propose " dual graph code independently " (DIME, Dual Independent MapEncoding) structure and " polygon converter " (POLYVRT, Polygon Convertor) structure, they respectively using the common edge between polygon and polygon and common edge set as basic storage cell, although want relative complex during modeling, but ensure that the correctness of topological relation between polygon and polygon, DIME and POLYVRT is typical Topological data structure (having concrete elaboration hereinafter).

Under above background, disclosure sets forth a kind of construction method of geospatial entity.More specifically, it is a kind of geospatial entity based on uniform logical topology method for auto constructing.Be below more careful present Research analysis of the present invention:

For planar polygons topology developing algorithm automatically, there is much research both at home and abroad.It mainly can be divided into two large classes, comprises the developing algorithm based on grid and the developing algorithm based on vector.

At home, automatically build polygonal method based on the topology of grid to comprise:

(1) use for reference classical based on the Seed Points filling algorithm of grid and the Raster Detection method of vector intersection thus set up the Raster of map sheet polygon and segmental arc belonging relation etc. (Wang Jiechen. (2002). the Raster [J] that Polygon Topology relation builds. survey and draw journal, 31 (3): 249-254; Xu Qingrong. (1989). set up Polygon File [J] by grid completion method. Surveying & Cartography Scientific & Technological Univ., Wuhan's journal, 14 (4): 42-46.)

(2) the line segment aggregate topology on what the people such as Zalik proposed is based upon " unified plane divides (UPS; Uniform Plane Subdivision) " basis builds polygonal method automatically, and (" unified plane divides " is that two dimensional surface realizes along X-axis and careful division of Y-axis, be similar to raster based method) (Zalik, B. (1999) .A Topology Construction from Line Drawings using a UniformPlane Subdivision Technique.Computer-Aided Design, vol.31, no.5, pp.335-348; Krivograd, S., Zalik, B. (2000) .Constructing the Topology from a Set of Line Segments.Proceedings of SpringConference on Computer Graphics, pp.231-240.)

At home, automatically build polygonal method based on the topology of vector to comprise:

(1) Chen Chun, " turn left (right-hand rotation) algorithm " (Chen Chun that the people such as Du Qingyun propose, Zhang Shuwen, Xu Guifen. the Fundamentals of Mathematics [J] that in (1996) .GIS, polygon diagram topology information generates. mapping journal, 25 (4): 266-271; Du Qingyun. (1989). the automatic tissue [J] of polygon data in map data base. mapping journal, 18 (3): 204-212; Yan Jing, Zhou Lixin, Pan Yunhe. (1999). a Polygon Topology relation generating algorithm [J] based on figure. computer application, 19 (10): 21-23; Shmutter, B., Doytsher, Y. (1990) .Assembling Closed Polygons.Survey Review, vol.30, no.235, pp.209-220.),

(2) people such as Qi Hua propose " Qi algorithm " (Qi Hua, Liu Wenxi. (1996). set up the Qi algorithm [J] of arc on node-arc topological relation. mapping journal, 25 (3): 233-235; Qi Hua. (1997). automatically set up the optimize and improve [J] of Polygon Topology ralation method step. mapping journal, 26 (3): 254-260; Qi Hua, Li Deren. (2005). inlay [J] based on the radiation compartition of Qi (xi, yi) function and the binding side of TIN. Wuhan University Journal (information science version), 30 (3): 204-208; Qi Hua, Li Deren, Zhu Qing. (2003). determine the time complexity analysis [J] of two non-angled algorithms of ray spatial neighborhood relations. Wuhan University Journal (information science version), 28 (5): 611-614),

(3) " azimuth method " (Yan Haowen of the proposition such as Yan Haowen, Yang Weifang, Chen Quangong, Liang Tiangang. (2000). the Topological Polygon calculated based on azimuth builds fast algorithm [J] automatically. Journal of Image and Graphics, 5A (7): 563-567; Yan Haowen, Zhu Fangxiong. (2001). a kind of fast algorithm [J] that Topological Polygon builds automatically. Zhejiang is surveyed and drawn, (2): 2-5; Yan Haowen, Wang Mingxiao, Wang Zhonghui. (2012). computational geometry: spatial data handling algorithm [M], Science Press .),

(4) Liu Gang etc. propose " class azimuth method " (Liu Gang, Li Yongshu. (2011). build the class azimuth algorithm [J] of arc-arc topological relation on node. Surveying and mapping, 36 (6): 49-51.),

(5) " vector outer produce method " (high cloud fine jade of proposing of the people such as high cloud fine jade, Xu Jiangang, Tang Wenwu. (2002). the new algorithm [J] of arc-arc Topology generation on Same Vertices. computer application is studied, and 19 (4): 58-59.)

Method based on grid belongs to graph image field in fact, and be only research emphasis (in fact correlative study is also more) herein based on the method for vector, comprise method in this paper also based on vector, therefore left-hand rotation (right-hand rotation) algorithm, Qi algorithm, azimuth algorithm, class azimuth algorithm, vector outer produce method have larger reference, so they are primary studies for this paper institute extracting method.

It should be noted that abroad, automatically build polygonal method referred to as polygonization (Polygonization) for topology in two-dimensional space.Abroad, polygonization (Polygonization) begins one's study very early, can trace back in Auto-Carto meeting the earliest and just enter on.Up to now, be proposed corresponding polygonization (Polygonization) algorithm for various data structure, more specifically, comprise for:

(1) proposed by U.S. population investigation bureau 1967, using limit as " dual graph code independently (DIME; DualIndependent Map Encoding) " data structure (Hodgson of elementary cell, M.E. (1985) .Constructing Shaded Maps with theDIME Topological Structure:An Alternative to the Polygon Approach.Proceedings of Auto-Carto, vol.7, pp.275-282; Peuquet, D.J. (1984) .A Conceptual Framework and Comparison of Spatial DataModels.Cartographica:The International Journal of Geographic Information andGeovisualization, vol.21, no.4, pp.66-113)

(2) that propose, using chain (i.e. the set on limit) as elementary cell " polygon converter (POLYVRT; PolygonConvertor) " data structure (Peucker in 1976 after, T.K., Chrisman, N. (1975) .Cartographic Data Structures.TheAmerican Cartography, vol.2, no.1, pp.55-69; Hodgson, M.E., Barrett, A.L., Plews, R.W. (1989) .Cartographic Data Capture using CAD.Auto-Carto:Proceedings of the International Conferenceon Computer-Assisted Cartography.American Congress on Surveying and Mapping, vol.9, pp.357-366.)

(3) in addition after in propose, " geocoding of topological coherence and reference " (TIGER of instead of DIME in 1986, Topologically Integrated Geographic Encoding and Referencing) data structure (Boudriault, G. (1987) .Topology in the TIGER File.Proceedings of Auto-Carto, vol.8, pp.258-269; McDowell, T., Meixler, D., Rosenson, P., Davis, B. (1987) .Maintenance of Geographic Structure Files at the Bureau of theCensus.Proceedings of Auto-Carto, vol.8, pp.264-269.)

(4) similar equally, using linear entity as fundamental space unit TIGRIS data structure (Bennis, K., David, B., Morize-Quilio, I., Thevenin, J.M., Viemont, Y. (1991) .GeoGraph:A Topological Storage Model forExtensible GIS.ASPRS American Society for Photogrammetry and Auto-Carto Conference, vol.6, pp.349-367; Herring, J. (1987) .TIGRIS:Topologically Integrated Geographic Information Systems, Proceedings of Auto-Carto, vol.8, pp.282-291.)

Above data structure is proposed corresponding polygonization (Polygonization) algorithm.It should be noted that, these algorithms are in fact all that the difference of " turn left (right-hand rotation) algorithm " mentioned in above Chinese literature describes, relevant document refers to (Visvalingam, M., Wade, P., Kirby, G.H. (1986) .Extraction of Area Topology from Line Geometry.Proceedings of Auto Carto London, vol.1, pp.156-165; Meixler, D., Saalfeld, A. (1987) .Polygonization and Topological Editing at the Bureau of the Census.Proceedings of Auto-Carto8, pp.249-257.).

As mentioned above, therefore emphasis compares left-hand rotation (right-hand rotation) algorithm, Qi algorithm, azimuth algorithm, class azimuth algorithm, this five classes algorithm of vector outer produce method.The identical point of these five algorithms is all close 1 relevant dimension limit entity thus structure 2 dimension polygon entity, and core is the limit bundle sequence (limit bundle here can be understood as the radial limit set from shared node) based on shared node.In left-hand rotation (right-hand rotation) algorithm, to turn left, core concept is initial (termination) node from every bar limit, turns left along this limit always, until close left polygon, the foundation judged during left-hand rotation is minimum corner dimension; In Qi algorithm, core proposes a kind of new method for the foundation of arc on same node-arc topological relation, is replaced into Qi functional value by arctan; In method horn cupping, be propose new method for setting up arc-arc topological relation equally, it has used for reference the azimuthal Computation schema in mapping; In class azimuth method, arctan is replaced into K value thus the foundation of improvement arc-arc topological relation, K value is not equal to real azimuth, but can describe segmental arc trend equally, so the method claims class azimuth method; In vector outer produce method, for when setting up arc on same node-arc relation, first adopt vector apposition successively to sort any two segmental arcs, then build corresponding binary sort tree, final ranking results can be obtained by this tree of inorder traversal.

Visible, the concrete grammar adopted when the difference of these five algorithms is sequence (the sequencing yardstick data) deriving between limit and limit by the fixed position on every bar limit (ratio scale data) is distinguished to some extent.More specifically, in left-hand rotation (right-hands rotation) algorithm, employing be directly calculate corner dimension, need the operation of execution to comprise 3 judgements, 2 sub-additions and subtraction, 1 division, 1 abs, 1 arctan; In azimuth method, employing be computer azimuth angle size, need the operation performed to comprise 3 judgements, 2 sub-additions and subtraction, 1 division, 1 abs, 1 arctan equally; In Qi algorithm, employing be calculate Qi functional value, need the operation performed to comprise 3 judgements, 2 sub-additions and subtraction, 1 division, 0 abs, 0 arctan; In class methods horn cupping, the operation performed is needed to comprise 2 judgements, 2 sub-additions and subtraction, 1 division, 0 abs, 0 arctan; In vector outer produce method, the operation performed is needed to comprise foundation and the inorder traversal of binary tree.Visible, these 5 algorithms are all the improvement for sequencer procedure between single polygon inner edge and limit when finding single polygon, and the approach and strategy that these 5 algorithms adopt for search polygon set is all the same.

More than be the domestic and international present Research of polygonization (Polygonization).

There is polygonization (Polygonization) this concept, accordingly, just should there is polyhedron (Polyhedron) this concept, also namely should be present in topology in three dimensions and automatically build the method for 3D solid.Therefore, the research relative maturity of polygonization (Polygonization).But the research of polyhedron (Polyhedron) just lacks many relatively, no matter is studies in China or foreign study., not yet there is the research of proper polyhedron (Polyhedron) so far in GIS association area in the cognition current according to the author and pertinent literature index.However, the closely-related research based on lifting (extrude) and generate 3D solid exists many with it, comprising:

(1) the most typically Ledoux etc. proposes the method (Ledoux being generated " three-dimensional regular building body " by lifting (extrusion) mode by 2 d plane picture, H., Meijers, M. (2011) .Topologically Consistent3D City Models Obtained byExtrusion.International Journal of Geographical Information Science, vo.25, no.4, pp.557-574; Ledoux, H., Meijers, M. (2009) .Extruding Footprints to Create Topologically Consistent3D CityModels.Urban and Regional Data Management, UDMS Annual, pp.39-48.)

(2) Geotz and Zif etc. propose by lifting the method (Over of mode based on LOD1 (the 1st class level of detail) building body in plane map OpenStreetMap generation CityGML (for expressing the generic data model of three-dimensional city template), M., Schilling, A., Neubauer, S., Zipf, A. (2010) .Generating Web-based3D City Models from OpenStreetMap:TheCurrent Situation in Germany.Computers, Environment and Urban Systems, vol.34, no.6, pp.496-507, Goetz, M., Zipf, A. (2012) .Towards Defining a Framework for the AutomaticDerivation of3D CityGML Models from Volunteered Geographic Information.InternationalJournal of3-D Information Modelling (IJ3DIM), vol.1, no.2, pp.1-16, Goetz, M. (2013) .TowardsGenerating Highly Detailed3D CityGML Models from OpenStreetMap.International Journal ofGeographical Information Science, vol.27, no.5, pp.845-865.)

(2) Verbree and Germs etc. propose the method based on two dimensional surface view (2D Plan View) and elevation information (Height) generating three-dimensional models view (3D Model View), and three-dimensional world view (3D World View) is only at the upper texture informations such as image of pasting of threedimensional model view (3DModel View), enhance the sense of reality (Germs, R., van Maren, G., Verbree, E., Jansen, F.W. (1999) .A Multi-view VR Interface for3D GIS.Computers & Graphics, vol.23, no.4, pp.497-506, Verbree, E., Maren, G.V., Germs, R., Jansen, F., Kraak, M.J. (1999) .Interaction inVirtual World Views_Linking3D GIS with VR.International Journal of Geographical InformationScience, vol.13, no.4, pp.385-396.)

(3) Zhu Qinghe Hu Mingyuan etc. propose the expression model (Zhu of " House Property body cluster ", Q., Hu, M.Y. (2010) .Semantics-based3D Dynamic Hierarchical House Property Model.International Journal ofGeographical Information Science, vol.24, no.2, pp.165-188; Zhu Qing, Hu Mingyuan, Huang Lihui. (2009). the three-dimensional house property based on multi-level event dynamically represents [J]. Wuhan University Journal (information science version), 34 (3): 326-330.),

(4) Horna etc. by two-dimentional architectural plane structure chart (2D Architectural Plan) by lifting the method generating three-dimensional indoor scene, interior wall in indoor scene can only perpendicular to bottom surface (Horna, S., Damiand, G., Meneveaux, D., Bertrand, Y. (2007) .Building3D Indoor Scenes Topology from2D Architectural Plans.GRAPP (GM/R), pp.37-44; Horna, S., Meneveaux, D., Damiand, G., Bertrand, Y. (2009) .Consistency Constraints and3D Building Reconstruction.Computer-aided Design, vol.41, no.1, pp.13-27.)

Sum up, it is no matter the LOD1 building in CityGML, or House Property body, three-dimensional regular building, or the BUILDINGS MODELS in threedimensional model view (3D Model View), in fact treating from geometric angle is all same class 3D solid, and namely end face, lateral vertical parallel with bottom surface is in the box-like regular 3D solid of bottom surface.Can only generate such " box-like " 3D solid is the major limitation lifting (extrude) method.Strictly, this method based on lifting (extrude) method generation 3D solid can not can be regarded as proper polyhedron (Polyhedron) method.For the simplest example, how to realize topology for one by the three-dimensional ball of multiple discrete fettucelle matching and automatically build, lift algorithm just no longer applicable.

To this, Guo Renzhong etc. propose a kind of method based on Discrete Plane sheet set topology constructing three-dimensional land deeds property right body, the topology that the method is applicable to erose three-dimensional property right body builds (Zhang Lingling automatically, Shi Yunfei, Guo Renzhong, Li Lin. (2010). the definition of three-dimensional land deeds property right body and expression [J]. Earth Information Science journal, 12 (2): 207-213).For the method, Guo Renzhong gives elaborating of the method by a series of document, comprising:

(1) central principle (Guo Renzhong such as axial pencil sequence based on shared straightway is set forth, Ying Shen, Li Lin. (2012). the topology based on the three-dimensional land deeds property right body of dough sheet set builds [J] automatically. mapping journal, 41 (4): 620-626; Li Lin, Zhao Zhigang, Guo Renzhong, He Biao. (2012). and between space body object, three-dimensional topology builds research [J]. Wuhan University Journal (information science version), 37 (6): 719-723; Guo Renzhong, Ying Shen. (2010). three-dimensional land deeds morphological analysis and data representation [J]. China Land Science, 24 (12): 45-51; He Biao, Li Lin, Guo Renzhong, Shi Yunfei. (2011). the isomery building three-dimensional topology taking outer topology into account rebuilds [J]. Wuhan University Journal (information science version), 36 (5): 579-583; Yu, C.B., Ying, S., He, B., Zhao, Z.G. (2012) .An Automatic Sorting Approachof Surface Bundle based on the Shared Space Curve.20 ^thinternational Conference onGeoinformatics (GEOINFORMATICS2012), June, Hongkong, 6p; Ying, S., Guo, R.Z., Li, L. (2011) .Design and Development of a3D Cadastral System Prototype based on the LADM and3DTopology.2 ^ndinternational Workshop on 3D Cadastres, 16-18November2011, Delft, theNetherlands, pp.167-188; Guo, R.Z., Yu, C.B., He, B., Zhao, Z.G., Li, L., Ying, S. (2012) .LogicalDesign and Implementation of the Data Model for 3D Cadastre in China.3 ^rdinternationalWorkshop on 3D Cadastres:Developments and Practices, 25-26October2012, Shenzhen, China, pp.113-136.).

(2) simultaneously based on (comprising conference and exhibition center of Shenzhen building body with the method achieving the many three-dimensional ancestors in Shenzhen of Chinese Guangdong province, building, everything city, China Resources, Shenzhen, power supply administration of Shenzhen mansion, Hong Kong-Shenzhen western corridor etc.) the practical work (Guo that automatically builds of topology, R.Z., Li, L., Ying, S., Luo, P., He, B., Jiang, R.R. (2013) .Developing a 3D Cadastre for theAdministration of Urban Land Use:A Case Study of Shenzhen, China.Computers, Environmentand Urban Systems, vol.40, pp.46-55, Guo, R.Z., Li, L., He, B., Luo, P., Ying, S., Zhao, Z.G., Jiang, R.R. (2011) .3D Cadastre in China_a Case Study in Shenzhen City.2 ^ndinternational Workshop on3D Cadastres, 16-18November2011, Delft, the Netherlands, pp.291-310, Ying, S., Guo, R.Z., Li, L., He, B. (2012) .Application of3D GIS to3D Cadastre in Urban Environment.3 ^rdinternationalWorkshop on3D Cadastres:Developments and Practices, 25-26October, 2012, Shenzhen, China, pp.253-272.).

Therefore, this method based on the three-dimensional property right body of Discrete facet topology constructing, be applicable to irregular 3D solid (typical as three-dimensional ancestor, three-dimensional building body etc.).Automatically build for 3D solid extremely rare up to now topology, the method is a kind of applicable effective ways.But, the method existing defects, specifically, the method is just in three dimensions, how the spatial entities (i.e. body) of a high dimension is formed by automatic structure of primitive (i.e. planar chip) topology of the low one dimension be close to, how the spatial entities (i.e. face) of a dimension high in two-dimensional space is not built such situation automatically by primitive (i.e. limit or the chain) topology of the low dimension be close to and also include consideration in, more do not give detailed comparative analysis by structure face in structure body in three dimensions and two-dimensional space.Also be the narrow application range based on the three-dimensional property right body method of Discrete facet topology constructing set forth above.

Sum up, for the research relative maturity of the topological method for auto constructing (i.e. polygonization) of planar polygons in two-dimensional space, research for the automatic method (i.e. polyhedron) built of proper 3D solid topology extremely lacks, there is the research that polyhedron method and polygonization method give to contrast by (searching for according to the experience of the author and pertinent literature) more hardly, comprise and compare polyhedronization and polygonization in principle, there is which identical point, which difference, whether both core concept is similar.Objectively, in know-why, wanting complicated due to polyhedron (Polyhedron) than polygonization (Polygonization) just causes the research of proper polyhedron (Polyhedron) so rare with difficulty is many, where so just should explicitly point out both similarities and differences, relative to the difficult point of the latter and complexity imbody where front and back; Whether whether both core concept is consistent, if unanimously, can logically unify abstract in conclusion.Lack in these all existing pertinent literatures and research.

Summary of the invention

The present invention is directed to prior art defect, give further further investigation inheriting on the basis of research based on the method for the three-dimensional property right body of Discrete facet topology constructing, thus propose the spatial entities construction method based on uniform logical.

The invention provides a kind of geospatial entity construction method, the spatial entities result that will build, is called result primitive; For constructing the initial given primitive of result primitive, be called structure primitive; If the dimension of structure primitive is n, then jointly connected by all relative configurations primitives, than the primitive of a structure primitive only low dimension, be called the public primitive of low-dimensional; Centered by the public primitive of low-dimensional, the radial structure that the possessive construction primitive being connected on this center is formed, is called structure primitive bundle; Perform following steps,

Step 1, any one the structure primitive on the outline of Search Results primitive set, comprises following sub-step,

Step 1.1, calculates the minimum external envelope of structure primitive set, obtains the extreme value of minimum external envelope;

Step 1.2, calculates the possessive construction primitive being connected on above extreme value, therefrom chooses and be positioned at outermost structure primitive;

Step 1.3, give direction for being positioned at outermost structure primitive above, described direction is 1 or 2;

Step 2, the outline of Search Results primitive set, comprises following sub-step,

Step 2.1, creates empty present construction primitive set, be then initialized as comprise the set of step 1 acquired results primitive outline on any one structure primitive;

Step 2.2, for each present construction primitive in the set of present construction primitive, marks according to its direction, and the mark mode of employing is, if structure primitive is endowed direction 1, then and side mark " using " of marker configurations primitive; If structure primitive is endowed direction 2, then opposite side mark " using " of marker configurations primitive;

Step 2.3, from each present construction primitive in the set of present construction primitive, performs following process respectively,

By finding extreme value angle, navigate to the most contiguous structure primitive the structure primitive of present construction primitive is intrafascicular;

Simultaneously, for each the most contiguous structure primitive navigated to, give direction according to the compatibility between it and present construction primitive, the imparting mode of employing is, if the public primitive of low-dimensional role in present construction primitive and the most contiguous structure primitive is contrary, then both are compatible; If the public primitive of low-dimensional role in present construction primitive with the most contiguous structure primitive is identical, then both are incompatible;

Step 2.4, empty the set of present construction primitive, the most contiguous all structure primitive that step 2.3 search obtains is stored, and as new present construction primitive set, return step 2.2 iterative search, until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are the outline of result primitive set;

Step 3, the set of Search Results primitive, comprises following sub-step,

Step 3.1, creates an empty present construction primitive set, is then initialized as and comprises a start configuration primitive.

Step 3.2, for each present construction primitive in the set of present construction primitive, marks according to its direction, and the mark mode of employing is, if structure primitive is endowed direction 2, then and side mark " using " of marker configurations primitive; If structure primitive is endowed direction 1, then opposite side mark " using " of marker configurations primitive;

Step 3.3, for present construction primitive each in the set of present construction primitive, performs following process respectively,

By finding extreme value angle, navigate to the most contiguous structure primitive the structure primitive of present construction primitive is intrafascicular, locate mode is herein contrary with the locate mode in step 2.3;

Step 3.4, empty the set of present construction primitive, the all the most contiguous structure primitive that step 3.3 search obtains is stored, and as new present construction primitive set, return step 3.2 iterative search, until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are a result primitive;

Step 3.5, returns step 3.1, re-creates and initialize the set of present construction primitive to carry out above process, until the both sides of all structure primitives are respectively only used once, now all result primitives are all searched for complete.

And, if structure primitive is divided into following three classes,

0-usedP, represents that the side of structure primitive and opposite side are not all previously used;

1-usedP, represents and namely constructs the side of primitive or opposite side is previously used;

2-usedP, represents and namely constructs the side of primitive and opposite side is previously used all;

When entering step 3.1, the start configuration primitive adopted for initializing empty present construction primitive set is designated as beginP, and beginP is that the direction of 0-usedP or 1-usedP, beginP is arranged as follows at every turn,

If beginP is 0-usedP, then its direction is 1 or 2;

If beginP is 1-usedP, and beginP is positioned on the outline of result primitive set, then select the direction that beginP once used; If beginP is 1-usedP, and beginP is not positioned on the outline of result primitive set, then select the direction that beginP had not used.

And described result primitive is 2 dimensions, relative configurations unit is 1 dimension; Or described result primitive is 3 dimensions, relative configurations unit is 2 dimensions.

And when structural unit is the limit of 1 dimension, if the direction on limit comprises left-hand and dextrad, left-hand is labeled as direction 1, and dextrad is labeled as direction 2; When structural unit is the chain of 1 dimension, if the direction of chain comprises left-hand and dextrad, left-hand is labeled as direction 1, and dextrad is labeled as direction 2, and the direction of chain determines as follows by the direction on the limit comprised in the chain, step-length between the node of chain and the node on limit,

The start node calculating chain, to the step-length of the start node on limit, is designated as sz1; The start node calculating chain, to the step-length of the terminal node on limit, is designated as sz2; Relatively sz1 and sz2, if sz1 is greater than sz2, then chain is contrary with edge direction; If sz1 is less than sz2, then chain is identical with edge direction.

And, when structural unit is the limit/chain of 1 dimension,

In step 2.3, from each present construction primitive in the set of present construction primitive, by finding extreme value angle, navigate to the most contiguous structure primitive, implementation is as follows,

If i direction that () works as front/chain is 1, and selection is the start node of working as front/chain, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when maximum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(ii) if when the direction of front/chain is 1, and selection is when front/end stopping of chain node, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when minimum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(iii) if when the direction of front/chain is 2, and selection is the start node of working as front/chain, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when minimum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(iv) if when the direction of front/chain is 2, and selection is when front/end stopping of chain node, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when maximum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

In step 3.3, from each present construction primitive in the set of present construction primitive, by finding extreme value angle, navigate to the most contiguous structure primitive, implementation is as follows,

If i direction that () works as front/chain is 1, and selection is the start node of working as front/chain, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when minimum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(ii) if when the direction of front/chain is 1, and selection is when front/end stopping of chain node, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when maximum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(iii) if when the direction of front/chain is 2, and selection is the start node of working as front/chain, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when maximum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain;

(iv) if when the direction of front/chain is 2, and selection is when front/end stopping of chain node, then intrafascicular at phase edge fit/chain, centered by this node, from working as front/chain, along looking counterclockwise, find with when minimum that limit/chain of front/chain angle, this limit/chain is most adjacent edge/chain.

And when structural unit is the planar chip of 2 dimensions, if the direction of planar chip comprises forward and backward, be backwardly labeled as direction 1, forward direction is labeled as direction 2.

And, when structural unit is the planar chip of 2 dimensions,

If i the direction of () current plane sheet is 1, then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with minimum that planar chip of top angle, this planar chip is most adjacent plane sheet;

(ii) if the direction of current plane sheet is 2, then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with maximum that planar chip of top angle, this planar chip is most adjacent plane sheet;

If i the direction of () current plane sheet is 1, then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with maximum that planar chip of top angle, this planar chip is most adjacent plane sheet;

(ii) if the direction of current plane sheet is 2, then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with minimum that planar chip of top angle, this planar chip is most adjacent plane sheet.

The present invention is also corresponding provides a kind of geospatial entity constructing system, and the spatial entities result that will build, is called result primitive; For constructing the initial given primitive of result primitive, be called structure primitive; If the dimension of structure primitive is n, then jointly connected by all relative configurations primitives, than the primitive of a structure primitive only low dimension, be called the public primitive of low-dimensional; Centered by the public primitive of low-dimensional, the radial structure that the possessive construction primitive being connected on this center is formed, is called structure primitive bundle; Comprise with lower module,

Outline structure primitive search module, any one the structure primitive on the outline of Search Results primitive set, comprises following submodule,

Minimum external envelope extreme value obtains submodule, for calculating the minimum external envelope of structure primitive set, obtains the extreme value of minimum external envelope; Outermost structure unit selection submodule, for calculating the possessive construction primitive being connected on above extreme value, therefrom choosing and being positioned at outermost structure primitive;

Submodule is given in outermost structure primitive direction, and for giving direction for being positioned at outermost structure primitive above, described direction is 1 or 2;

Result primitive set outline search module, for the outline of Search Results primitive set, comprises following submodule,

First present construction primitive set creates submodule, for creating empty present construction primitive set, be then initialized as comprise the set of module 1 acquired results primitive outline on any one structure primitive;

First mark submodule, for for each present construction primitive in the set of present construction primitive, mark according to its direction, the mark mode of employing is, if structure primitive is endowed direction 1, then side mark " using " of marker configurations primitive; If structure primitive is endowed direction 2, then opposite side mark " using " of marker configurations primitive;

First the most contiguous structure primitive locator module, for from each present construction primitive in the set of present construction primitive, performs following process respectively,

First present construction primitive set upgrades submodule, for emptying the set of present construction primitive, the most contiguous all structure primitive that first the most contiguous structure primitive locator block search obtains is stored, and as new present construction primitive set, order first mark submodule marks again, iterative search, until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are the outline of result primitive set;

Result primitive Set-search module, for the set of Search Results primitive, comprises following submodule,

Second present construction primitive set creates submodule, for creating an empty present construction primitive set, being then initialized as and comprising a start configuration primitive;

Second mark submodule, for for each present construction primitive in the set of present construction primitive, mark according to its direction, the mark mode of employing is, if structure primitive is endowed direction 2, then side mark " using " of marker configurations primitive; If structure primitive is endowed direction 1, then opposite side mark " using " of marker configurations primitive;

Second the most contiguous structure primitive locator module, for for present construction primitive each in the set of present construction primitive, performs following process respectively,

By finding extreme value angle, navigate to the most contiguous structure primitive the structure primitive of present construction primitive is intrafascicular, locate mode is herein contrary with the locate mode in the first the most contiguous structure primitive locator module;

Second present construction primitive set upgrades submodule, for emptying the set of present construction primitive, the all the most contiguous structure primitive that second the most contiguous structure primitive locator block search obtains is stored, and as new present construction primitive set, order second mark submodule marks again, iterative search, until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are a result primitive;

The search of result primitive judges submodule, above process is carried out for ordering the second present construction primitive set establishment submodule to re-create and initialize the set of present construction primitive, until the both sides of all structure primitives are respectively only used once, now all result primitives are all searched for complete.

The outline that the inventive method comprises the set of Search Results primitive constructs primitive, the outline of Search Results primitive set, Search Results primitive set three large steps.Core of the present invention is the sequencer procedure of " structure primitive bundle ", and its use procedure of mode record by marking for structure primitive in building process.The present invention is not only applicable to tie up polygon by 1 dimension structure limit/chain topology constructing 2, and is applicable to tie up entity by 2 dimension formation level sheet topology constructing 3, and both logically unifications.The topology that technical scheme of the present invention can be used for three-dimensional land deeds property right body builds automatically, realizes easy, reliable results.

Accompanying drawing explanation

Accompanying drawing 1 is the process schematic of the outline adopting Search Results polygon set in 2D ACSEBUL;

Accompanying drawing 2 is the process schematic adopting Search Results polygon set in 2D ACSEBUL;

Accompanying drawing 3 is adopt the process schematic determining the direction of chain in 2D ACSEBUL, wherein Fig. 3 a is the direction (dir) of the chain schematic diagram contrary with the direction (dir) on limit, and Fig. 3 b is the direction (dir) of the chain schematic diagram identical with the direction (dir) on limit;

Accompanying drawing 4 is the process schematic of the outline adopting Search Results body set in 3D ACSEBUL;

Accompanying drawing 5 is the process schematic adopting Search Results body set in 3D ACSEBUL.

Detailed description of the invention

Technical solution of the present invention is described in detail below in conjunction with drawings and Examples.

The concept of ACSEBUL

The invention provides a kind of spatial entities building method based on uniform logical, the method is abbreviated as ACSEBUL (AnApproach to the Construction of Spatial Entities Based on Unified Logic).The method is for initially given structure spatial entities set, how specifically use by recording each structure spatial entities, thus the final method generating result space entity sets, the method is applicable to structure face in two-dimensional space, also be applicable to structure body in three dimensions, and structure face and structure body are logically unified.When the method is applied to 2 dimension situation, when namely automatically building 2 dimension polygon by 1 dimension limit/chain topology, be called for short 2D ACSEBUL; When the method is applied to 3 dimension situation, when namely automatically building 3 dimension body by 2 dimensional plane sheet topologys, be called for short 3D ACSEBUL.ACSEBUL is that the topology of spatial entities automatically builds and provides a kind of new method.

In ACSEBUL, finally want the spatial entities result constructed, be called result primitive.2 dimension polygons in 2D ACSEBUL, 3 dimension bodies in 3D ACSEBUL, be all called as result primitive.

In ACSEBUL, be called structure primitive for the initial given primitive constructing result primitive.1 dimension limit/chain in 2D ACSEBUL, 2 dimensional plane sheets in 3D ACSEBUL, are all called as structure primitive.

In ACSEBUL, if the dimension of structure primitive is n, then jointly connected by all relative configurations primitives, than the primitive of a structure primitive only low dimension (i.e. (n-1) tie up), be called the public primitive of low-dimensional.The public primitive of low-dimensional does not participate in structure result primitive directly, but the core content that it sorts as " structure primitive bundle " participates in structure result primitive indirectly.0 dimension common node in 2D ACSEBUL, 1 dimension common edge in 3D ACSEBUL, is all called as the public primitive of low-dimensional.

In ACSEBUL, centered by the public primitive of low-dimensional, the radial structure that the possessive construction primitive being connected on this center is formed, is called structure primitive bundle.Be connected on the 1 dimension limit bundle (or 1 dimension chain bundle) of 0 dimension common node in 2D ACSEBUL, be connected on 2 dimensional plane sheet bundles of 1 dimension common edge in 3DACSEBUL, be all called as structure primitive bundle.Corresponding, as mentioned above, 0 dimension common node in 2D ACSEBUL, 1 dimension common edge in 3D ACSEBUL, be all called as the public primitive of low-dimensional.The principle of ACSEBUL is set forth

In ACSEBUL, core is the sequence of " structure primitive bundle ".In the process that " structure primitive bundle " sorts, key finds the most contiguous structure primitive from structure primitive side.Why do like this, be because: each result primitive is made up of relative configurations primitive, for certain result primitive in the process of the relative configurations primitive from the unknown of known configuration primitive set off in search, in the face of centered by the public primitive of low-dimensional, the possessive construction primitive being connected on this center is formed, present in radial " structure primitive bundle ", unknown relative configurations primitive and the communication bridge of known structure primitive are angles between the two, always find extreme value angle (i.e. min/max angle), extreme value angle ensure that what find is be close to structure primitive most, namely ensure that " correlation " of Search Results.(more intuitively, in 2D ACSEBUL, this angle is take node as plane included angle between convenience center, limit and limit (or chain and chain); In 3D ACSEBUL, this angle is two angles centered by common edge, between planar chip and planar chip; They are logically unified).

Simultaneously, there is whether compatible problem between known configuration primitive with the most contiguous structure primitive: if the public primitive of low-dimensional above in both roles contrary, then both are compatible (more intuitively, in 2D ACSEBUL, if 0 dimension common node is the starting point (terminal) of known 1 dimension limit/chain, be the terminal (starting point) being close to 1 dimension limit/chain most, then these two 1 dimension limit/chains are compatible simultaneously; In 3D ACSEBUL, if be downwards (upwards) around direction at 1 Wei Gonggongbianchu in known 2 dimensional plane sheets, be simultaneously upwards (downwards) around direction at 1 Wei Gonggongbianchu in the most contiguous 2 dimensional plane sheets, then these two 2 dimensional plane sheets are compatible; They are logically unified); If the public primitive of low-dimensional is identical at both middle roles above, then both incompatible (concrete condition slightly).

In ACSEBUL, each structure primitive has both direction (dir), respectively the both sides of representative structure primitive.Can mutually distinguish during both direction assignment, embodiment assignment is 1 and 2.Why there is both direction, because at the end of final generation, each structure primitive meeting and only can by use 2 times, namely the result primitive that each structure primitive is positioned at both sides generated complete (more intuitively, in 2D ACSEBUL, every bar limit/chain in its left polygon of topology constructing and the polygonal process in the right side respectively by use 1 time; In 3D ACSEBUL, each planar chip its forward direction body of topology constructing and rear in the process of body respectively by use 1 time; They are logically unified).

In the generative process of result primitive, when constructing primitive and being endowed direction, all " can mark " to the side of structure primitive.Why needing " marking ", be because each structure primitive meeting and only can by use 2 times when generating complete, and tense marker can record the service condition of structure primitive, avoids reusing structure primitive, repeat generation result primitive." marking of standard " method is: if structure primitive is endowed direction 1, then the side of marker configurations primitive " uses "; If structure primitive is endowed direction 2, then the opposite side of marker configurations primitive " uses " (more intuitively, in 2D ACSEBUL, if be endowed direction 1 (2), then the left side (right side) of marker configurations limit/chain " uses "; In 3D ACSEBUL, if be endowed direction 1 (2), then the back side (front) of marker configurations planar chip " uses "; They are logically unified).

Complete ACSEBUL main flow is divided into three large steps, comprises any one the structure primitive on the outline of (1) Search Results primitive set; (2) outline of Search Results primitive set; (3) Search Results primitive set.During concrete enforcement, computer software technology can be adopted to realize automatic operational process.

More specifically,

For any one the structure primitive on the outline of large step (1) Search Results primitive set, comprise following little step:

(1.1) calculate the minimum external envelope of structure primitive set, obtain the extreme value of minimum external envelope;

(1.2) calculate the possessive construction primitive being connected on above extreme value, therefrom choose and be positioned at outermost structure primitive;

(1.3) direction is given for being positioned at outermost structure primitive above.

For the outline of large step (2) Search Results primitive set, comprise following little step:

(2.1) now the large step (1) of main flow terminates.Create the set of present construction primitive, its content is empty, needs to initialize, and its initial value is returning results (namely constructing any one structure primitive and the direction thereof on the outline of result primitive set) of large step (1).

(2.2) for each present construction primitive in the set of present construction primitive, mark according to its direction, the labeling method of employing is aforementioned " method of marking of standard ";

(2.3) from each present construction primitive in the set of present construction primitive, following process is performed respectively,

By " structure primitive bundle " sequence, navigate to the most contiguous structure primitive.Concrete, each result primitive is made up of relative configurations primitive, for certain result primitive in the process of the relative configurations primitive from the unknown of known configuration primitive set off in search, in the face of form centered by the public primitive of low-dimensional, by the possessive construction primitive being connected on this center, present in radial " construct primitive bundle ", unknown relative configurations primitive and the communication bridge of known structure primitive are angles between the two, always find extreme value angle (min/max angle), extreme value angle ensure that what find is be close to structure primitive most.

Meanwhile, for each the most contiguous structure primitive navigated to above, direction is given according to the compatibility between it and present construction primitive.Concrete, if the public primitive of low-dimensional is contrary at both middle roles above, then both are compatible; If the public primitive of low-dimensional is identical at both middle roles above, then both are incompatible.

(2.4) set of present construction primitive is emptied, the all the most contiguous structure primitive that step (2.3) search obtains is stored, and as new present construction primitive set, return step (2.2), iterative search like this is (namely to each the present construction primitive in the set of present construction primitive, its the most contiguous structure primitive of further search), until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are a result primitive.

For the set of large step (3) Search Results primitive, comprise following little step:

(3.1) the large step (2) of main flow terminates.Now, on the outline of result primitive set, each structure primitive has and only has side to be marked as " using ";

Create the set of a present construction primitive, its content is empty, needs to initialize, and namely adopts a structure primitive for initializing empty present construction primitive set.

(3.2) for each present construction primitive in the set of present construction primitive, mark according to its direction, the labeling method adopted is contrary with labeling method in (2.1), and even construct primitive and be endowed direction 2, then the side of marker configurations primitive " uses "; If structure primitive is endowed direction 1, then the opposite side of marker configurations primitive " uses ";

(3.3) for present construction primitive each in the set of present construction primitive, following process is performed respectively,

By " structure primitive bundle " sequence, navigate to the most contiguous structure primitive, locate mode is herein contrary with the locate mode in step (2.3), namely in " structure primitive bundle ", unknown relative configurations primitive and the communication bridge of known structure primitive are angles between the two, always find extreme value angle (maximum/minimum angle).In other words, if step (2.3) looks for maximum angle, minimum angle is looked for herein; If step (2.3) looks for minimum angle, look for maximum angle herein;

Meanwhile, for each the most contiguous structure primitive navigated to above, give direction according to the compatibility between it and corresponding present construction primitive, the imparting direction method in imparting direction Methods and steps (2.3) is herein identical;

(3.4) set of present construction primitive is emptied, the all the most contiguous structure primitive (and giving direction) that step (3.3) search obtains is stored up, and as new present construction primitive set, return step (3.2) so iterative search, until the most contiguous structure primitive set obtained is for empty, now, all the most contiguous structure primitives stored are a result primitive.

(3.5) return step (3.1), adopt above method, ceaselessly create, initialize, upgrade, record the set of present construction primitive, until the both sides of all structure primitives are respectively only used once.Now, all result primitives are all searched for complete.

It should be noted that when entering step (3.2) at every turn, each present construction primitive in the set of present construction primitive can upgrade.However, in any case upgrade, structure primitive always can be divided into following three classes:

(1) 0-usedP (side and the opposite side that namely construct primitive are not all previously used);

(2) 1-usedP (side or the opposite side that namely construct primitive are previously used);

(3) 2-usedP (side and the opposite side that namely construct primitive are previously used all);

When entering step (3.1), always need one to construct primitive for initializing empty present construction primitive set, this is called start configuration primitive (beginP) for initialized structure primitive at every turn.BeginP can be 0-usedP, also can be 1-usedP, but can not be 2-usedP.The direction of beginP is arranged as follows:

(1) if beginP is 0-usedP, then its direction can be 1, also can be 2;

(2) if beginP is 1-usedP, and beginP is positioned on the outline of result primitive set, then select the direction that beginP once used;

(3) if beginP is 1-usedP, and beginP is not positioned on the outline of result primitive set, then select the direction that beginP had not used.

Be more than three large steps of Search Results primitive set, and structure primitive is according to the classification of its concrete service condition.In fact, constructing primitive or can also employ position to classify according to its physical location." physical location " herein, refers to the objective reality position of structure primitive entity; " employing position " herein, describes structure primitive and how to be used in whole construction process, comprise as input value or as output valve; Not yet be previously used or be previously used 1 time or be previously used 2 times.

For possessive construction primitive, classify according to its physical location, always can be divided into 2 large classes:

(1) external structure primitive (eP): be positioned at the structure primitive on outline;

(2) internal structure primitive (iP): remove the residue structure primitive after all external structure primitives;

For possessive construction primitive, employ position to classify according to it, always can be divided into 6 large classes:

(1) input structure primitive st1: the structure primitive entered from outline.It is previously used when searching for outline, and once used direction was used as the direction of st1;

(2) input structure primitive st2: enter from inside and be previously used structure primitive once.Original direction is used as the direction of st2;

(3) input structure primitive st3: enter from inside and never used structure primitive.Any one direction (namely 1 or 2) can as the direction of st3;

(4) output construction primitive ob: appear at the structure primitive on outline.It has been previously used once when calculating outline, and the direction calculated must be once used direction;

(5) output construction primitive tw: appear at inside and be previously used structure primitive once.The direction calculated must be original direction;

(6) output construction primitive normal: appear at inside and not yet used structure primitive.Record the direction calculated.

For above structure primitive of classifying according to physical location and employer-employee relationship, always meet:

st1+ob＝eP (1)

st2+tw＝iP (2)

st3+normal＝iP (3)

Formula (3) has set forth internal structure primitive (iP) the 1st time by the process used;

Formula (2) has set forth internal structure primitive (iP) the 2nd time by the process used;

Formula (1) has set forth external structure primitive (eP) the 2nd time by the process used;

And external structure primitive (eP) is presented as whole large step (2) by the process used the 1st time;

It should be noted that three of above ACSEBUL large steps are abstract, conclusion, its general principle that links closely is launched.ACSEBUL can be embodied as 2D ACSEBUL and 3D ACSEBUL.Wherein, 2D ACSEBUL is used for automatically building 2 dimension polygons by 1 dimension limit/chain topology, and it comprises three large steps equally, and the large step in 2D ACSEBUL follows the principle of large step in ACSEBUL, but launches particularly, meticulously simultaneously; 3D ACSEBUL is used for automatically building 3 dimension entities by 2 dimensional plane sheet topologys, and it comprises three large steps equally, and the large step in 3D ACSEBUL follows the principle of large step in ACSEBUL equally, but is also launch particularly, meticulously simultaneously.

Note, unified and clear for describing, during the abstract ACSEBUL of above description ,-P is the abbreviation (being shown to be " primitive ") of-Primitive.When below describing concrete 2D ACSEBUL ,-E is the abbreviation (being shown to be on " limit ") of-Edge, and-C is the abbreviation (being shown to be " chain ") of-Chain.Same, when describing concrete 3D ACSEBUL as follows ,-F is the abbreviation (being shown to be " planar chip ") of-Facet.

ACSEBUL specializes

As mentioned above, ACSEBUL can be applied to 2 dimension situations (namely automatically building 2 dimension polygons by 1 dimension limit/chain topology), i.e. 2D ACSEBUL; ACSEBUL can also be applied to 3 dimension situations (namely automatically building 3 dimension entities by 2 dimensional plane sheet topologys), i.e. 3D ACSEBUL., first specifically set forth 2D ACSEBUL during implementing reference, here, specifically set forth 3D ACSEBUL more afterwards.Wherein, when setting forth 2D ACSEBUL, due to " automatically building 2 dimension polygons by 1 dimension limit topology " and " building 2 ties up polygon automatically to tie up chain topology by 1 ", in principle, major part is identical, just there is part variation in realization rate, clear in order to discuss, first complete elaboration the former, only discuss the difference place of itself and the former afterwards for the latter.

--2D ACSEBUL (being applied to limit)

Structure primitive in 2D ACSEBUL (being applied to limit) is 1 dimension limit, and result primitive is 2 dimension polygons.Implement, for the purpose of reference, to provide corresponding and be described as follows for ease of those skilled in the art.

First, the concrete definition of all primitives in 2D ACSEBUL (being applied to limit) is given:

(1) node (2D Point)

Node (2D Point) is that the class 0 embedding two-dimensional space ties up primitive, and it have recorded X, Y-coordinate information.

(2) limit (2D Edge)

Limit (2D Edge) is that the class 1 be embedded in two-dimensional space ties up primitive, and it is the directed line line segment closed by start node and terminal node.The physical direction on limit points to terminal node by start node.The start node on limit and terminal node can not be same points.

Limit also claims segmental arc usually.Limit homeomorphism is in 1 dimension stream shape.

(3) ring (2D Ring)

Ring (2D Ring) is that the class 1 be embedded in two-dimensional space ties up primitive, and it is closed by least 3 bandings and forms.

Ring is the polymerization on limit.Meanwhile, ring is closed, and the Article 1 limit and the last item limit that namely form ring have common node.

(4) polygon (Polygon)

Polygon (Polygon) is that the class 2 be embedded in two-dimensional space ties up primitive, and it is closed by least 3 bandings and forms.Polygonal border is ring.There is not other primitive in polygonal internal, polygon also claims minimum polygon.

Here specify, polygon does not have inner ring, only has unique outer shroud, and in unique outer shroud, the trend on limit is counterclockwise.

Article one, the physical direction on limit only has one, and this physical direction can be expressed by the vector of the start node sensing terminal node on limit, has objective evaluation.Unlike this, the direction on a limit is subjective definition, thinks there is both direction here, i.e. left-hand (being labeled as " 1 ") and dextrad (being labeled as " 2 ").Wherein, for certain limit, start node when this limit points to the trend of terminal node formation with when the trend on limit is consistent in the unique outer shroud of certain polygon comprising this limit, limit now (is noted: need not " this limit ", and use on " limit now ") being called right edge, this polygon is called left polygon; When the start node on this limit point to limit in the terminal node trend formed and the unique outer shroud of polygon comprising this limit move towards inconsistent time, limit now (is noted: need not " this limit ", and use on " limit now ") being called limit, left side, this polygon is called right polygon.Why thinking that the direction on limit has two, is that be also the limit, left side of polygon B, polygon A and polygon B is adjacent by this limit simultaneously because limit is the right edge of polygon A.

In 2D ACSEBUL (being applied to limit), structure primitive is structure limit, and result primitive is result polygon.

In 2D ACSEBUL (being applied to limit), all calculating is unified to be positioned in two-dimensional space (i.e. X, Y-coordinate system).

In 2D ACSEBUL (being applied to limit), comprise following three large steps:

One. a limit on the outline of Search Results polygon set.In this large step, comprise following little step:

(1.1) create a result limit, its content is empty.

(1.2) calculate to the minimum enclosed rectangle frame of deckle set.Calculate the maximum y value of this minimum enclosed rectangle frame, be called for short maximum y value.(1.3) create the set of a phase edge fit, content is empty.

(1.4) for each summit on the every bar limit in deckle set, compare the Y value on this summit and maximum y value: if equal, then this limit is added in the set of above phase edge fit.

(1.5) for the set of above phase edge fit, if there is the limit that all summits Y value all equals maximum y value, this limit is designated as parallel edges, and proceeds to step (1.6); If there is no, then step (1.7) is proceeded to.

(1.6) according to the position of the physical direction determination start node of above parallel edges, and then the following direction calculating this limit, and proceed to step (1.9):

If i the X value of () start node is greater than the X value of terminal node, then this limit is labeled as result limit, and the direction on result limit is 1;

(ii) if the X value of start node is less than the X value of terminal node, then this limit is labeled as result limit, and the direction on result limit is 2;

(1.7) for the every bar phase edge fit in the set of phase edge fit, calculate the corner dimension that itself and two-dimensional vector (-1,0) are formed, this angle is designated as " original angle ".

(1.8) for the every bar limit in the set of phase edge fit, select that limit that " original angle " is minimum, this limit is result limit.

Meanwhile, its direction is judged according to the node location on result limit:

If i summit that () possesses maximum y value is above the start node on result limit, then the direction on this limit is 1;

(ii) if the summit possessing maximum y value is above the terminal node on result limit, then the direction on this limit is 2;

(1.9) search terminates, and above result limit is a limit on outline, returns results limit.

It should be noted that all limits being connected on maximum y value summit are not necessarily got in the set of phase edge fit, also can get all limits being connected on X-axis or other extreme vertex of Y-axis (maximum or minimum of a value), and corresponding change subsequent step.Here " being positioned at outermost structure primitive " in " result limit " i.e. ACSEBUL is also the final Search Results of large step one.

Two. the outline of Search Results polygon set.In this large step, comprise following little step:

(2.1) according to large step one acquired results, get a limit on outline, be designated as any limit on outline.

(2.2) create outline polygon and work as front set, content is respectively empty; For when front set, need to initialize.

(2.3) for when the every bar limit in the set of front, read the direction on now limit, this limit and the direction on now limit are added in outline polygon, is marked in the side that now direction is corresponding, this limit simultaneously.Specific as follows:

If i the direction on () now limit was 1 (namely showing search right side outline polygon), then the left side on this limit is labeled as " using ";

(ii) if now the direction on limit was 2 (namely showing search left side outline polygon), then the right side on this limit is labeled as " using ";

(2.4) for when front set, create corresponding propelling limit and gather, it initializes content is empty.

(2.5) for each node (altogether 2 nodes) when the every bar limit in the set of front, two number certificates are calculated as follows:

(a) most adjacent edge

That connect with this node, same for constructing the polygonal limit of outline, be called most adjacent edge.The all limits connected with this node form one and gather, and are called phase edge fit bundle.It is intrafascicular that most adjacent edge is always present in phase edge fit.

The result of calculation of most adjacent edge, with when front relevant, with when direction in front relevant, with the current mid-side node selected irrelevant (although needing in computational process by current mid-side node).Specific as follows:

If i () works as direction in front was 1 (namely showing search right side outline polygon), and selection is when start node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when maximum that limit of front angle, this limit is most adjacent edge;

(ii) if when direction in front was 1 (namely showing search right side outline polygon), and selection is when terminal node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when minimum that limit of front angle, this limit is most adjacent edge;

(iii) if when direction in front was 2 (namely showing search left side outline polygon), and selection is when start node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when minimum that limit of front angle, this limit is most adjacent edge;

(iv) if when direction in front was 2 (namely showing search left side outline polygon), and selection is when terminal node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when maximum that limit of front angle, this limit is most adjacent edge;

The direction of (b) most adjacent edge

If most adjacent edge with when front compatible, then give the direction the same with working as front to most adjacent edge; If most adjacent edge with when front incompatible, then give the direction different with working as front to most adjacent edge.Specific as follows:

If (i) when direction in front be 1, and when front is compatible with most adjacent edge, then the direction of most adjacent edge is 1;

(ii) if when direction in front is 1, and when front is incompatible with most adjacent edge, then the direction of most adjacent edge is 2;

(iii) if when direction in front is 2, and when front is compatible with most adjacent edge, then the direction of most adjacent edge is 2;

(iv) if when direction in front is 2, and when front is incompatible with most adjacent edge, then the direction of most adjacent edge is 1;

(2.6) for above antithetical phrase (i.e. most adjacent edge, and direction), if antithetical phrase does not exist in above outline polygon, then add and advance limit set; If exist, be then left intact, and no longer enter (2.7).

(2.7) emptying when front set, working as front set using advancing limit set as new; Afterwards, the set of propelling limit is emptied.So, for next iteration has done preparation.

(2.8) step (2.3)-(2.7) are repeated, until the propelling limit set calculated is for empty.Now, above outline Polygon Search is complete.

It should be noted that in step (2.2), gathering initialized content when front is any limit on outline.

As previously mentioned, in (b) of step (2.5), the compatibility on limit determined by the role in known limit, most adjacent edge of the node as the public primitive of low-dimensional.Of equal value, the compatibility on limit and the uniformity (namely whether end to end) of limit physical direction.

Three. Search Results polygon set.In this large step, comprise following little step:

(3.1) input performs large step 2 search gained outline.

(3.2) now, for the limit of each on outline, have and only have side to be " using ";

(3.3) create result polygon and work as front set, content is respectively empty; For when front set, need to initialize.

(3.4) for when the every bar limit in the set of front, read the direction on now limit, and the direction on this limit and now limit added in above result polygon, marked in the side that now direction is corresponding, this limit simultaneously:

If i the direction on () now limit was 1 (namely showing search left side polygon), then the right side on this limit is labeled as " using ";

(ii) if now the direction on limit was 2 (namely showing search right side polygon), then the left side on this limit is labeled as " using ";

As can be seen here, during Search Results polygon set, when " label side " and search outline, " label side " method is contrary.

(3.5) for when front set, create corresponding propelling limit and gather, it initializes content is empty;

(3.6) for each node (altogether 2 nodes) when bar limit every in the set of front, two number certificates are calculated as follows:

(a) most adjacent edge

That connect with this node, same for forming the polygonal limit of this result, be called most adjacent edge.The all limits connected with this node form one and gather, and are called phase edge fit bundle.It is intrafascicular that most adjacent edge is always present in phase edge fit.

If i () works as direction in front was 1 (namely showing search left side polygon), and selection is when start node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when minimum that limit of front angle, now this limit is most adjacent edge;

(ii) if when direction in front was 1 (namely showing search left side polygon), and selection is when terminal node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when maximum that limit of front angle, now this limit is most adjacent edge;

(iii) if when direction in front was 2 (namely showing search right side polygon), and selection is when start node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when maximum that limit of front angle, now this limit is most adjacent edge;

(iv) if when direction in front was 2 (namely showing search right side polygon), and selection is when terminal node in front, then: intrafascicular at phase edge fit, centered by this node, from working as front, along looking counterclockwise, find with when minimum that limit of front angle, now this limit is most adjacent edge.

When " calculate most adjacent edge " and search outline as can be seen here, during Search Results polygon set " calculate most adjacent edge " method is contrary.

The direction of (b) most adjacent edge

When the direction of adjacent edge " calculate most " and search outline as can be seen here, during Search Results polygon set the direction of adjacent edge " calculate most " method is identical.

(3.7) for each antithetical phrase obtained above (i.e. most adjacent edge, and direction), if it does not exist in above result polygon, then the set of above propelling limit is added; If exist, be then left intact, and no longer enter (3.8).

(3.8) emptying when front set, working as front set using advancing limit set as new; Afterwards, the set of propelling limit is emptied.So, for next iteration has done preparation.

(3.9) step (3.4)-(3.8) are repeated, until the propelling limit set calculated is for empty.Now, above result Polygon Search is complete.(3.10) step (3.3)-(3.9) are repeated, until used 2 times to the every bar limit in deckle set.Now, all result polygons are all searched for complete.

It should be noted that when entering step (3.4), initially given structure limit set all can upgrade at every turn.However, in any case upgrade, initially given structure limit can be divided into following three classes all the time:

(1) 0-usedE (namely left side " use " and right side " do not use ");

(2) 1-usedE (namely left side " using " but right side " do not use ", or left side " does not use " but right side " uses ");

(3) 2-usedE (namely left side " using " and right side " use ");

Meanwhile, when entering step (3.3), always select to gather for initializing empty front of working as to a limit, 1 in deckle set, this limit is called start configuration limit (beginE) at every turn.BeginE can be 0-usedE, also can be 1-usedE, but can not be 2-usedE.

Meanwhile, the direction of beginE is specified as follows:

(1) if beginE is 0-usedE, then its direction can be 1 also can be 2 (first can search for left side polygon, also can search for right side polygon);

(2) if beginE is 1-usedE, and beginE is positioned on the outline of result polygon set, then before choosing, used direction (had used direction 1, then choice direction 1 again even; If used direction 2, then choice direction 2 again);

(3) if beginE is 1-usedE, and beginE is not positioned on the outline of result polygon set, then choose still unworn direction and (even used direction 1, then selected directions 2; If used direction 2, then selected directions 1);

Same, for possessive construction limit, classify according to its physical location, always can be divided into 2 large classes: (1) external structure limit (eE); (2) internal structure limit (iE).For possessive construction limit, employ position to classify according to it, always can be divided into 6 large classes: (1) input structure limit st1; (2) input structure limit st2; (3) input structure limit st3; (4) output construction limit ob; (5) output construction limit tw; (6) output construction limit normal.Meet formula as follows:

st1+ob＝eE (4)

st2+tw＝iE (5)

st3+normal＝iE (6)

Accompanying drawing 1 and accompanying drawing 2 give the graphical elaboration of above three large steps by a simple examples.In this example, initially given 24 structure limits, the physical direction on every bar limit is as shown in black small arrow, and final Search Results is 9 (3 × 3) individual result polygon.(it should be noted that as setting forth directly perceived, more than input structure limit st1 adopts accompanying drawing 1 and accompanying drawing 2 intermediate cam shape to express; Input structure limit st2 adopts circular expression in accompanying drawing 1 and accompanying drawing 2; Input structure limit st3 adopts quadrangle in accompanying drawing 1 and accompanying drawing 2 to express.)

More specifically,

Figure 1 illustrates a limit on the outline of Search Results polygon set, then search the process of outline from this limit.From the limit set that (a) part is initially given, search outline is as (b) part.Wherein, one on the outline searched is while a and its direction is 2 (being labeled as enter).Afterwards from this limit, calculate most adjacent edge (along dotted arrow, finding limit b and limit c) according to the node location on limit and the physical direction on limit, and give direction (giving direction 1 and 2 respectively) according to the compatibility between limit; Afterwards, again find most adjacent edge (along solid arrow, finding limit d and limit e), and give direction (giving direction 1 and 2 respectively); Afterwards, again find most adjacent edge (along dotted arrow, finding limit f and limit g), and give direction (giving direction 1 and 1 respectively); Iteration like this, altogether through 6 times, continues to search out limit h, i, limit j, k, until find limit l and give direction 1 (being labeled as end), so far searches for outline and terminates. whole step above suddenly can called after step0.

Figure 2 illustrates the process of Search Results polygon set.There is shown 1 searching route.Concrete,

First, enter in step1, all not accessed mistake in all limits, an optional limit, input limit is st1 (direction was used in selection, with reference to step0); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 normal (recording direction); Second time traverses 1 normal (recording direction); Terminate traversal, search minimum polygon p1, reject 2 limits (every bar limit is all employed 2 times).

Afterwards, enter in step2, from remaining sides, select any limit, input position, limit st1 (direction was used in selection, with reference to step0); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 normal (recording direction); Second time traverses 1 normal (recording direction); Terminate traversal, search minimum polygon p2, reject 2 limits (every bar limit is all employed 2 times).

Afterwards, enter in step3, from remaining sides, select any limit, input position, limit st2 (selecting not yet to use direction, with reference to step2); First time traverses 1 normal (recording direction) and 1 ob (identical with crossing direction, with reference to step0); Second time traverses 1 tw (contrary with crossing direction, with reference to step1); Terminate traversal, search minimum polygon p3, reject 3 limits (every bar limit is all employed 2 times).

Afterwards, enter in step4, from remaining sides, select any limit, input limit is st1 (choice for use crosses direction, with reference to step0); First time traverses 1 normal (recording direction) and 1 tw (contrary with crossing direction, with reference to step1); Second time traverses 1 normal (recording direction); Terminate traversal, search minimum polygon p4, reject 2 limits (every bar limit is all employed 2 times).

Afterwards, enter in step5, select any limit from remaining sides kind, input limit is st3 (choice direction 1 or 2 all can, select 1 here); First time traverses 1 normal (recording direction) and 1 tw (contrary with crossing direction, with reference to step4); Second time traverses 1 tw (contrary with crossing direction, with reference to step3); Terminate traversal, search minimum polygon p5, reject 2 limits (every bar limit is all employed 2 times).

Afterwards, enter in step6, select any limit from remaining sides kind, input limit is st2 (selecting not yet to use direction, with reference to step5); First time traverses 1 normal (recording direction) and 1 normal (recording direction); Second time traverses 1 ob (identical with crossing direction, with reference to step0); Terminate traversal, search minimum polygon p6, reject 2 limits (every bar limit is all employed 2 times).

Afterwards, enter in step7, select any limit from remaining sides kind, input limit is st2 (selecting not yet to use direction, with reference to step5); First time traverses 1 normal (recording direction) and 1 tw (contrary with crossing direction, with reference to step2); Second time traverses 1 ob (identical with crossing direction, with reference to step0); Terminate traversal, search minimum polygon p7, reject 3 limits (every bar limit is all employed 2 times).

Afterwards, enter in step8, select any limit from remaining sides kind, input limit is st1 (direction was used in selection, with reference to step0); First time traverses 1 tw (contrary with crossing direction, with reference to step6) and 1 ob (identical with crossing direction, with reference to step0); Second time traverses 1 tw (contrary with crossing direction, with reference to step7); Terminate traversal, search minimum polygon p8, reject 4 limits (every bar limit is all employed 2 times).

Afterwards, enter in step9, from remaining sides, select any limit, input limit is st2 (selecting not yet to use direction, with reference to step6); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 tw (contrary with crossing direction, with reference to step4); Second time traverses 1 ob (identical with crossing direction, with reference to step0); Terminate traversal, enter in step10, search minimum polygon p9, reject 4 limits (every bar limit is all employed 2 times).

So far, all limits are all disallowable, and 9 minimum polygons are all searched for complete, and namely each minimum polygon not only correctly contains limit, equally correctly contain the direction (as shown on the right side of accompanying drawing 2) on limit.

Same, meet formula (4)-(6) (as shown on the downside of accompanying drawing 2).

More specifically, number 4 and number 8 sum of output construction limit ob of input structure limit st1 are the number 12 on external structure limit (eE), namely describe external structure limit (eE) the 2nd time by the process (1-used->2-used) used; Number 4 and number 8 sum of output construction limit tw of input structure limit st2 are the number 12 on internal structure limit (iE), namely describe internal structure limit (iE) the 2nd time by the process (1-used->2-used) used; Number 1 and number 11 sum of output construction limit normal of input structure limit st3 are the number 12 on internal structure limit (iE), namely describe internal structure limit (iE) the 1st time by the process (0-used->1-used) used; And external structure limit (eE) the 1st time is by the present step0 of procedure body that uses.

--2D ACSEBUL (being applied to chain)

Equally, the definition of primitive in 2D ACSEBUL (being applied to chain) is first provided:

(1) chain (Chain)

Chain (Chain) is that the class 1 embedded in two-dimensional space ties up primitive, and it is made up of at least 1 limit.Article 1, chain comprises 2 end points, is called the start of chain node of this chain, chain termination node.

When chain is only made up of 1 limit, the physical direction i.e. physical direction of this chain on this limit.But generally, 1 chain is made up of many limits, and now chain does not have physical direction.Therefore, unitedly call chain not have physical direction, this is more strict agreement, does not affect result.

Chain can be endless chain, and the limit namely forming chain is connected to each other formation loop.Endless chain comprises at least 3 limits.Chain homeomorphism is in 1 dimension stream shape.

(2) chain node (Chain End)

Chain node (Chain End) is that the class 1 embedded in two-dimensional space ties up primitive, and it have recorded X, Y-coordinate.

Chain node is the border of chain, is the border on limit like node.When chain is only made up of 1 limit, the start node on this limit and terminal node are just start of chain node and the chain termination node of this chain respectively.

(3) side information of polygon (Polygon)

Polygon (Polygon) can be thought to be closed by least 3 bandings and forms, and also can think to be closed by least 1 chain to form.Therefore, limit can be thought in polygonal border, also can think chain.

As mentioned above, a chain does not have objective physical direction.However, subjectivity thinks that the direction of chain still exists, and a chain exists both direction, i.e. left-hand (being labeled as " 1 ") and dextrad (being labeled as " 2 ").Wherein, when the start of chain node of chain points to the trend of chain termination node formation with when the trend of this chain is consistent in certain the polygonal unique outer shroud comprising this chain, chain now (is noted: need not " this chain ", and use " chain now ") being called right side chain, this polygon is called left polygon; When the start of chain node of this chain point to trend that chain termination node formed with comprise this chain certain polygonal unique outer shroud medium chain move towards inconsistent time, chain now (is noted: need not " this chain ", and use " chain now ") being called left side chain, this polygon is called right polygon.Why thinking that the direction of chain has two, is that be also the left side chain of polygon B, polygon A and polygon B is adjacent by this chain simultaneously because chain is the right side chain of polygon A.

In 2D ACSEBUL (being applied to chain), structure primitive is structure chain, and result primitive is result polygon.

In 2D ACSEBUL (being applied to chain), all calculating is unified to be positioned in two dimensional surface (i.e. X, Y-coordinate system).

In 2D ACSEBUL (being applied to chain), comprise three large steps: one. a chain on the outline of Search Results polygon set; Two. the outline of Search Results polygon set; Three. Search Results polygon set

For 2D ACSEBUL (being applied to chain), substantially identical with 2D ACSEBUL (being applied to limit), comprise three large steps (so the little step the present invention that is specifically decomposed into of three large steps it will not go into details).Difference is, determines the direction (dir) of chain than determining that the direction on limit is complicated.Here specify, the direction of chain determined by the direction (comprising limit in the chain) on limit, the step-length (Step Size) between chain node and mid-side node, as shown in Figure 3.Particularly,

(1) calculate the start node of chain to the step-length of the start node on limit, be designated as sz1;

(2) calculate the start node of chain to the step-length of the terminal node on limit, be designated as sz2;

(3) sz1 and sz2 is compared.If sz1 is greater than sz2, directions are then contrary, and (as depicted in figure 3 a, the step-length between the start node of chain and the start node on limit is 11, and the step-length between the start node of chain and the terminal node on limit is 10, the former is greater than the latter, then both directions are contrary); If sz1 is less than sz2, directions are then identical, and (as shown in fig. 3b, the step-length between the start node of chain and the start node on limit is 3, and the step-length between the start node of chain and the terminal node on limit is 4, the former is less than the latter, then both directions are identical).

Same, for possessive construction chain, classify according to its physical location, always can be divided into 2 large classes: (1) external structure chain (eC); (2) internal structure chain (iC).For possessive construction chain, employ position to classify according to it, always can be divided into 6 large classes: (1) input structure chain st1; (2) input structure chain st2; (3) input structure chain st3; (4) output construction chain ob; (5) output construction chain tw; (6) output construction chain normal.Same, for the structure chain of these classification, meet formula (7)-(9).

st1+ob＝eC (7)

st2+tw＝iC (8)

st3+normal＝iC (9)

--3D ACSEBUL

As mentioned above, ACSEBUL can be applied to 3 dimension situations (namely automatically building 3 dimension bodies by 2 dimensional plane sheet topologys), i.e. 3D ACSEBUL.

Equally, the definition of all primitives in 3D ACSEBUL is first given:

(1) node (3D Point)

Node is that the class 0 embedded in three dimensions ties up primitive, and it have recorded X, Y, Z coordinate.

(2) limit (3D Edge)

Limit (3D Edge) is that the class 1 embedded in three dimensions ties up primitive, and it is the directed line line segment closed by start node and terminal node.The physical direction on limit is pointed to the terminal node on limit by the start node on limit.The start node on limit and terminal node can not be same points.

(3) ring (3D Ring)

Ring (3D Ring) is that the class 1 embedded in three dimensions ties up primitive, and it is closed by least 3 bandings and forms.

Ring is the polymerization on limit.Ring is closed, and the Article 1 limit and the last item limit that namely form ring have common node.

Although do not have all limits of explicit constraint formation ring necessary in the same plane, that directly quotes this ring only has planar chip object, and all limits of planar chip are in the same plane, so all limits that acquiescence forms ring are in the same plane.

(4) planar chip (Facet)

Planar chip (Facet) obtains a class 2 in embedding three dimensions to tie up primitive, and it is by unique outer shroud, zero region jointly closed to multiple inner ring.The border of planar chip is ring.A planar chip comprises at least 3 limits.

Planar chip is relative simple polygon, and planar chip can be convex, can be recessed.

Planar chip has normal vector, and it is objective, can adopt 3 n dimensional vector n objective expressions.

Any plane sheet all has both sides, and it is subjective definition.Because each planar chip has a place hyperplane, three dimensions is divided into two parts by this hyperplane sheet, generally the side at planar chip normal vector place is called front, and the side differing from planar chip normal vector place is called the back side.

(5) body (Body)

Body (Body) is that the class 3 embedded in three dimensions ties up primitive, and it is closed due at least 4 planar chips and forms.The border of body is planar chip.There is not other primitive in body, body also claims most corpusculum.

The normal vector of a planar chip only has one, and it is objective, and 3 n dimensional vector ns can be adopted to express.Unlike this, the direction of a planar chip is subjective definition, and thinks there are two, i.e. backward (being labeled as " 1 ") and forward direction (being labeled as " 2 ").Wherein, for certain planar chip, when the normal vector of this planar chip points to certain individuality outside, planar chip now (is noted: need not " this planar chip ", and use " planar chip now ") being called forward plane sheet (namely employing the front of planar chip), this body is called backward body; When the normal vector of this planar chip points to the inside of certain individuality, planar chip now (is noted: need not " this planar chip ", and use " planar chip now ") being called backward planar chip (namely employing the back side of planar chip), this body is called forward direction body.

Why thinking that the direction of planar chip has two, is that be also the backward planar chip of body B, body A and body B is adjacent by this planar chip simultaneously because planar chip is the forward plane sheet of body A.

In 3D ACSEBUL, structure primitive is formation level sheet, and result primitive is effective aspect.

In 3D ACSEBUL, all calculating is unified to be positioned in three dimensions (i.e. X, Y, Z coordinate system).

In 3D ACSEBUL, comprise three large steps:

One. a planar chip on the outline of Search Results body set.In this large step, comprise following little step:

(1.1) create a result planar chip, content is empty;

(1.2) the minimum external connection box of given planar chip set is calculated.Calculate the greatest z value of this minimum external connection box, be called for short greatest z value.

(1.3) create the planar chip set that connects, content is empty.

(1.4) for each summit of each planar chip in given planar chip set, compare Z value and the greatest z value on this summit: if equal, then this planar chip is added above connecting in planar chip set.

(1.5) for the planar chip set that connects above, if there is the planar chip that all summits Z value equals greatest z value, this planar chip is designated as parallel plane sheet, and proceeds to step (1.6); If there is no, then step (1.7) is proceeded to.

(1.6) compare the normal vector of parallel plane sheet and the corner dimension of trivector (0,0,1) thus determine its direction, proceeding to step (1.9):

If i () both angles are 0, then this planar chip is labeled as result planar chip, and the direction of result planar chip is 1;

(ii) if both angles are 180, then this planar chip is labeled as result planar chip, and the direction of result planar chip is 2;

(1.7) for each planar chip connected in planar chip set, calculate the angle of its normal vector and trivector (0,0,1), this angle is designated as " original angle ".More original angle and 90 degree also process as follows:

If i () original angle is in (0,90), then do not process;

(ii) if original angle is in (90,180), then deduct original angle by 180, result queue is " process angle ";

(1.8) for each planar chip connected in planar chip set, select that planar chip that its " process angle " is minimum, this planar chip is labeled as result planar chip.

Meanwhile, according to the direction of " original angle " result of calculation planar chip of result planar chip:

If i () original angle is in (0,90), then the direction of result planar chip is 1;

(ii) if original angle is in (90,180), then the direction of result planar chip is 2;

(1.9) search terminates, and above result planar chip is the planar chip on outline, and returns results planar chip.

It should be noted that, all planar chips on the summit being connected on greatest z value are not necessarily got in the planar chip set that connects, also all planar chips being connected on X-axis or Y-axis or other extreme vertex of Z axis (maximum or minimum of a value) can be got, and corresponding change subsequent step.Here " being positioned at outermost result structure primitive " in " result planar chip " i.e. ACSEBUL is also the final Search Results of large step one.

Two. the outline of Search Results body set.In this large step, comprise following little step:

(2.1) according to large step one acquired results, get a planar chip on outline, be designated as planar chip on outline.

(2.2) create outline body and the set of current plane sheet, content is respectively empty; For the set of current plane sheet, need to initialize.

(2.3) for each planar chip in the set of current plane sheet, read the direction of now planar chip, this planar chip and direction now added in outline body, marked in this planar chip side that now direction is corresponding simultaneously:

If i the direction of () now planar chip was 1 (namely showing search forward direction outline body), then this planar chip rear indicia is " using ";

(ii) if now the direction of planar chip was 2 (namely showing to search for backward outline body), then this planar chip front is labeled as " using ";

(2.4) for the set of current plane sheet, create the set of corresponding propelling planar chip, it initializes content is empty.

(2.5) for every bar limit of each planar chip in the set of current plane sheet, two number certificates are calculated as follows:

(a) most adjacent plane sheet

That connect with this limit, the same planar chip for forming outline body, is called most adjacent plane sheet.The all planar chips connected with this limit form one and gather, and are called the planar chip bundle that connects.It is intrafascicular that most adjacent plane sheet is always present in the planar chip that connects.

The result of calculation of most adjacent plane sheet, relevant with current plane sheet, relevant with the direction of current plane sheet.Specific as follows:

If i the direction of () current plane sheet was 1 (namely showing search forward direction outline body), then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with minimum that planar chip of top angle, now this planar chip is most adjacent plane sheet;

(ii) if the direction of current plane sheet was 2 (namely showing to search for backward outline body), then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with maximum that planar chip of top angle, now this planar chip is most adjacent plane sheet;

The direction of (b) most adjacent plane sheet

If most adjacent plane sheet is compatible with current plane sheet, then give the direction the same with current plane sheet to most adjacent plane sheet; If most adjacent plane sheet is incompatible with current plane sheet, then give the direction different from current plane sheet to most adjacent plane sheet.Specific as follows:

If i () current plane sheet direction is 1, and current plane sheet is compatible with most adjacent plane sheet, then most adjacent plane sheet direction is 1;

(ii) if current plane sheet direction is 1, and current plane sheet is not allowed with most adjacent plane sheet, then most adjacent plane sheet direction is 2;

(iii) if current plane sheet direction is 2, and current plane sheet is compatible with most adjacent plane sheet, then most adjacent plane sheet direction is 2;

(iv) if current plane sheet direction is 2, and current plane sheet is not allowed with most adjacent plane sheet, then most adjacent plane sheet direction is 1;

(2.6) for each antithetical phrase obtained above (i.e. most adjacent plane sheet, and direction), if this antithetical phrase does not exist in above outline body, then the set of above propelling planar chip is added; If exist, be then left intact, and stop entering (2.7).

(2.7) set of current plane sheet is emptied, using the set of propelling planar chip as new current plane sheet set; Afterwards, the set of propelling planar chip is emptied.So, for next iteration has done preparation.

(2.8) step (2.3)-(2.7) are repeated, until the propelling planar chip set calculated is for empty.Now, above outline body search is complete.

It should be noted that in step (2.2), the initialization value of current plane sheet set is planar chip on outline.

As previously mentioned, in (b) of step (2.5), the compatibility of planar chip by known planar chip, most adjacent plane sheet the limit as the public primitive of low-dimensional move towards determined.Of equal value, the compatibility of planar chip and the uniformity (namely whether being positioned at the same side of planar chip) of planar chip normal vector.

Three. the set of Search Results body.In this large step, comprise following little step:

(3.1) large step 2 gained outline body is inputted.

(3.2) now, for each planar chip in outline body, have and only have side to be " using ".

(3.3) create effective aspect and the set of current plane sheet, content is respectively empty; For the set of current plane sheet, need to initialize.

(3.4) for each planar chip in the set of current plane sheet, read the direction of now planar chip, and this planar chip and planar chip direction are now added in above effective aspect, this planar chip lateral marks that now direction is corresponding is designated as " using " simultaneously.Specific as follows:

If i the direction of () now planar chip was 1 (namely showing to search for backward effective aspect), then the front of this planar chip is labeled as " using ";

(ii) if now the direction of planar chip was 2 (namely showing search forward direction effective aspect), then the rear indicia of this planar chip is " using ";

As can be seen here, during the set of Search Results body, when " label side " and search outline body, " label side " method is contrary.

(3.5) for the set of current plane sheet, create and advance planar chip set, it initializes content is empty.

(3.6) for every bar limit of each planar chip in the set of current plane sheet, two number certificates are calculated as follows:

(a) most adjacent plane sheet

That connect with this limit, the same planar chip for forming effective aspect, is called most adjacent plane sheet.The all planar chips connected with this limit form one and gather, and are called the planar chip bundle that connects.It is intrafascicular that most adjacent plane sheet is always present in the planar chip that connects.

If i the direction of () current plane sheet was 1 (namely showing to search for backward effective aspect), then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with maximum that planar chip of top angle, now this planar chip is most adjacent plane sheet;

(ii) if the direction of current plane sheet was 2 (namely showing search forward direction effective aspect), then intrafascicular at the planar chip that connects, look along the front of current plane sheet, find with current plane sheet along with minimum that planar chip of top angle, now this planar chip is most adjacent plane sheet;

When " calculate most adjacent plane sheet " and search outline body as can be seen here, during the set of Search Results body " calculate most adjacent plane sheet " method is contrary.

The direction of (b) most adjacent plane sheet

(iv) if current plane sheet direction is 2, and current common people's sheet is not allowed with most adjacent plane sheet, then most adjacent plane sheet direction is 1;

When the direction of adjacent plane sheet " calculate most " and search outline body as can be seen here, during the set of Search Results body the direction of adjacent plane sheet " calculate most " method is identical.

(3.7) for each antithetical phrase obtained above (i.e. most adjacent plane sheet, and direction), if antithetical phrase does not exist in above effective aspect, then the set of above propelling planar chip is added; If exist, be then left intact, and stop entering (3.8).

(3.8) set of current plane sheet is emptied, using the set of propelling planar chip as new current plane sheet set; Afterwards, the set of propelling planar chip is emptied.So, for next iteration has done preparation.

(3.9) step (3.4)-(3.8) are repeated, until the propelling planar chip set calculated is for empty.Now, above effective aspect search is complete.

(3.10) step (3.3)-(3.9) are repeated, until each planar chip in given planar chip set has used 2 times.Now, all effective aspect search are complete.

It should be noted that when entering step (3.4), initially given formation level sheet set all can upgrade at every turn.However, in any case upgrade, initially given formation level sheet always can be divided into following three classes:

(1) 0-usedF (namely forward direction " does not use " and backward " use ");

(2) 1-usedF (namely forward direction " uses " but backward " use ", or forward direction " does not use " but backward " using ");

(3) 2-usedF (namely forward direction " uses " and backward " using ");

Meanwhile, when entering step (3.3), always select 1 planar chip in given planar chip set for initializing empty current plane sheet set, this planar chip is called start configuration planar chip (beginF) at every turn.BeginF can be 0-usedF, also can be 1-usedF, but can not be 2-usedF.

Meanwhile, the direction of beginF is specified as follows:

(1) if beginF is 0-usedF, then its direction can be 1 also can be 2 (namely can search for backward body, also can search for forward direction body);

(2) if beginF is 1-usedF, and beginF is positioned on the outline of effective aspect set, then direction 1 (had been used, then selected directions 1 again even in used direction before choosing; If used direction 2, then selected directions 2 again);

(3) if beginF is 1-usedF, and beginF is not positioned on the outline of effective aspect set, then choose still unworn direction and (even used direction 1, then selected directions 2; If used direction 2, then selected directions 1);

Same, for possessive construction planar chip, classify according to its physical location, always can be divided into 2 large classes: (1) external structure planar chip (eF); (2) internal structure planar chip (iF).For possessive construction planar chip, employ position to classify according to it, always can be divided into 6 large classes: (1) input formation level sheet st1; (2) formation level sheet st2 is inputted; (3) formation level sheet st3 is inputted; (4) output construction planar chip ob; (5) output construction planar chip tw; (6) output construction planar chip normal.Meet following formula:

st1+ob＝eF (10)

st2+tw＝iF (11)

st3+normal＝iF (12)

Accompanying drawing 4 and accompanying drawing 5 give the graphical elaboration of above three large steps by a simple examples.In this example, initially given is planar chip set, the normal vector (normal vector is perpendicular to affiliated planar chip) as shown in black small arrow of each planar chip, and final Search Results is most corpusculum set.This example should be stereogram, is limited to plane and illustrates, only show the planar chip in vertical direction here, look and simplify in order to a limit in the visual angle from figure of the planar chip in vertical direction, what this limit in fact represented is 2 dimensional plane sheets.In horizontal direction, the called situation of planar chip is the same with the called situation of planar chip in above vertical direction, therefore at this slightly.(same, directly perceived for setting forth, above input formation level sheet st1 adopts accompanying drawing 4 and accompanying drawing 5 intermediate cam shape to express; Input formation level sheet st2 adopts circular expression in accompanying drawing 4 and accompanying drawing 5; Input formation level sheet st3 adopts quadrangle in accompanying drawing 4 and accompanying drawing 5 to express.)

More specifically,

Figure 4 illustrates a planar chip on the outline of Search Results body set, then search the process of outline from this planar chip.From the planar chip set that (a) part is initially given, search outline is as (b) part.More specifically, a planar chip on the outline searched is planar chip a and its direction is 1 (being labeled as enter).Afterwards, from this planar chip, find most adjacent plane sheet (along dotted arrow according to the formation limit of this planar chip and the normal vector of this planar chip, find planar chip c and planar chip b), and give direction (giving direction 1 and 2 respectively) according to the compatibility between planar chip; Afterwards, again find most adjacent plane sheet (along solid arrow, finding planar chip d and planar chip e), and give direction (giving direction 2 and 1 respectively); Afterwards, find most adjacent plane sheet (along dotted arrow, finding planar chip f and planar chip g) at this, and give direction (giving direction 1 and 1 respectively); So altogether through 6 iteration, continue to search out planar chip h, i, limit j, k, until find planar chip l and give direction 2 (being labeled as end), so far search for outline and terminate. whole step can be ordered above step0 by name.

Figure 5 illustrates the process of Search Results body set.There is shown a searching route.Concrete,

First, enter in step1, all faces are all not accessed, an optional input face, and input face is st1 (direction was used in selection, with reference to step0); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 normal (recording direction); Second time traverses 1 normal (recording direction); Terminate traversal, search most corpusculum b1, reject 2 faces (each face is employed 2 times).

Afterwards, enter in step2, from residue face, select any one planar chip, input face is st1 (direction was used in selection, with reference to step0); First time traverse 1 tw (with used direction contrary before, reference step1) and 1 normal (recording direction); Second time traverses 1 normal (recording direction); Terminate traversal, search most corpusculum b2, reject 2 faces (each face is employed 2 times).

Afterwards, enter in step3, from residue face, select any one planar chip, input face is st2 (selecting not yet to use direction, with reference to step1); First time traverse 1 ob (with used direction identical before, with reference to step0) and 1 normal (recording direction); Second time traverses 1 normal (recording direction); Terminate traversal, search most corpusculum b3, reject 2 faces (each face is employed 2 times).

Afterwards, enter in step4, from residue face, select any one planar chip, input face is st1 (direction was used in selection, with reference to step0); First time traverse 1 tw (with used direction contrary before, with reference to step3) and 1 ob (with used direction contrary before, reference step0); Second time traverses 1 normal (recording direction); Terminate traversal, search for most corpusculum b4, reject 3 faces (each face is employed 2 times).

Afterwards, enter in step5, from residue face, select any one planar chip, input face is st2 (selecting not yet to use direction, with reference to step2); First time traverse 1 normal (recording direction) and 1 ob (with used direction identical before, reference step0); Second time traverses 1 ob (identical with crossing direction, with reference to step0); Terminate traversal, search most corpusculum b5, reject 3 faces (each face is employed 2 times).

Afterwards, enter in step6, from residue face, select any one planar chip, input face is st3 (choice direction 1 or 2 all can, select 1 here); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 normal (recording direction); Second time traverses 1 tw (with inevitable contrary with crossing direction, with reference to step5); Terminate traversal, search most corpusculum b6, reject 2 faces (each face is employed 2 times).

Afterwards, enter in step7, from residue face, select any one planar chip, input face is st2 (selecting not yet to use direction, with reference to step6); First time traverses 1 normal (recording direction) and 1 tw (with inevitable contrary with crossing direction, with reference to step2); Second time traverses 1 tw (identical with crossing direction, with reference to step3); Terminate traversal, search most corpusculum b7, reject 3 faces (each face is employed 2 times).

Afterwards, enter in step8, from residue face, select any one planar chip, input face is st2 (selecting not yet to use direction, with reference to step7); First time traverses 1 normal (recording direction) and 1 tw (with inevitable contrary with crossing direction, with reference to step4); Second time traverses 1 ob (identical with crossing direction, with reference to step0); Terminate traversal, search most corpusculum b8, reject 3 faces (each face is employed 2 times).

Afterwards, enter in step9, from residue face, select any one planar chip, input face is st1 (direction was used in selection, with reference to step0); First time traverses 1 ob (identical with crossing direction, with reference to step0) and 1 tw (with inevitable contrary with crossing direction, with reference to step6); Second time traverses 1 tw (with inevitable contrary with crossing direction, with reference to step8); Terminate traversal, enter in step10, search most corpusculum b9, reject 4 faces (each face is employed 2 times).

So far, all 24 faces are all disallowable, and 9 most corpusculums are all searched for complete, and namely each most corpusculum not only correctly contains corresponding planar chip, correctly contains the direction (as shown on the right side of accompanying drawing 5) of planar chip simultaneously.

Same, meet formula (10)-(12) (as shown on the downside of accompanying drawing 5).More specifically, number 4 and number 8 sum of output construction planar chip ob of input formation level sheet st1 are the number 12 of external structure planar chip (eF), namely describe external structure planar chip (eF) the 2nd time by the process used; Number 4 and number 8 sum of output construction planar chip tw of input formation level sheet st2 are the number 12 of internal structure planar chip (iF), namely describe internal structure planar chip (iF) the 2nd time by the process used; Number 1 and number 11 sum of output construction planar chip normal of input formation level sheet st3 are the number 12 of internal structure planar chip (iF), namely describe internal structure planar chip (iF) the 1st time by the process used; External structure planar chip (eF) the 1st time is by the present step0 of procedure body that uses.

Case data is verified

For ease of understanding for the purpose of effect of the present invention, real case data are adopted to give the verification of correctness of ACSEBUL method.Wherein, two dimension real case data acquisition be the two-dimentional ancestor of Chinese Guangdong Enterprises of Futian District of provinceing and Longgang District ground data (namely for verifying 2D ACSEBUL), three-dimensional real case data acquisition be the three-dimensional building volume data (namely for verifying 3D ACSEBUL) of Han Sheng garden district, Chinese Guangdong province Enterprises of Futian District.Final structure situation all adopts Euler's formula to verify.Concrete,

For the two-dimentional ancestor ground data of Enterprises of Futian District, there is connected component (CC) totally 665, structure limit (E) totally 14,442, totally 12,325, summit (eV), the result polygon (P) adopting the final construction complete of 2D ACSEBUL (being applied to limit) totally 2,782, such structure situation meets the Euler's formula (i.e. eV – E+P=CC) being applied to two-dimensional space; For above 2-D data, if the data structure replacement that employing take chain as elementary cell take limit as the data structure of elementary cell, then there is connected component (CC) totally 665 equally, structure chain (C) totally 6,403, chain summit (cE) totally 4,286, the result polygon (P) adopting the final construction complete of 2D ACSEBUL (being applied to chain) is equally also 2,782, such structure situation meets the Euler's formula (i.e. cE-C+P=CC) being applied to two-dimensional space equally.Below the correctness of 2D ACSEBUL is either way demonstrated.

For the two-dimentional ancestor ground data of Longgang District of Shenzhen City, there is connected component (CC) totally 9,113, structure limit (E) totally 52,395, summit (eV) totally 50,950, adopt totally 10,558, the result polygon (P) of the final construction complete of 2D ACSEBUL (being applied to limit), such structure situation meets the Euler's formula (i.e. eV – E+P=CC) being applied to two-dimensional space; For above 2-D data, if the data structure replacement that employing take chain as elementary cell take limit as the data structure of elementary cell, then there is connected component altogether (CC) totally 9 equally, 113, structure chain (C) totally 12,669, chain summit (cE) totally 11,224, the result polygon (P) adopting the final construction complete of 2DACSEBUL (being applied to chain) is equally also 10,558, such structure situation equally also meets the Euler's formula of two-dimensional space (i.e. cE – C+P=CC).Below the correctness of 2D ACSEBUL is either way demonstrated.

For the three-dimensional building volume data of Han Sheng garden district, Enterprises of Futian District, there is connected component (CC) totally 1, formation level sheet (F) totally 2592, totally 2797, summit (V), totally 5118, limit (E), inner ring (L) totally 18, deficiency (G) totally 16, adopts the effective aspect (B) totally 268 of the final construction complete of 3D ACSEBUL.Such structure situation meets and is applied to three-dimensional Euler's formula (namely [V – E+F – B] – L=CC-G).This demonstrates the correctness of 3D ACSEBUL.

No matter sum up, be structure face in two-dimensional space, or structure body in three dimensions, and the principle of structure face and structure body method is logically unified, its abstract with conclude after called after ACSEBUL in this patent.ACSEBUL core content gives direction and the sequence of primitive bundle of in use marking, construct for structure primitive.When specific, abstract ACSEBUL can be embodied as the 2D ACSEBUL in two-dimensional space, core content comprises every bar limit/chain 2 directions, found by " structure limit bundle sequence " most adjacent edge/chain, the most contiguous relevant limit/chain at the end of forming minimum polygon, search every bar limit/chain to be used and can only be inferior by use 2; Abstract ACSEBUL can also be embodied as the 3DACSEBUL in three dimensions, core content comprises each planar chip 2 directions, found most adjacent plane sheet by " sequence of formation level sheet bundle ", the most contiguous relevant planar chip form most corpusculum, search at the end of each planar chip to be used and can only be inferior by use 2.The topology being spatial entities based on the thought of uniform logical above automatically builds and provides a kind of new method.

The specific implementation of each module of system can see said method, and it will not go into details in the present invention.

Specific embodiment described herein is only to the explanation for example of the present invention's spirit.Those skilled in the art can make various amendment or supplement or adopt similar mode to substitute to described specific embodiment, but can't depart from spirit of the present invention or surmount the scope that appended claims defines.

Claims

1. a geospatial entity construction method, is characterized in that: the spatial entities result that will build, is called result primitive; For constructing the initial given primitive of result primitive, be called structure primitive; If the dimension of structure primitive is n, then jointly connected by all relative configurations primitives, than the primitive of a structure primitive only low dimension, be called the public primitive of low-dimensional; Centered by the public primitive of low-dimensional, the radial structure that the possessive construction primitive being connected on this center is formed, is called structure primitive bundle; Perform following steps,

Step 3, the set of Search Results primitive, comprises following sub-step,

Step 3.1, creates an empty present construction primitive set, is then initialized as and comprises a start configuration primitive;

2. geospatial entity construction method according to claim 1, is characterized in that: establish structure primitive to be divided into following three classes,

If beginP is 0-usedP, then its direction is 1 or 2;

If beginP is 1-usedP, and beginP is positioned on the outline of result primitive set, then select the direction that beginP once used;

If beginP is 1-usedP, and beginP is not positioned on the outline of result primitive set, then select the direction that beginP had not used.

3. geospatial entity construction method according to claim 1 or 2, is characterized in that: described result primitive is 2 dimensions, and relative configurations primitive is 1 dimension; Or described result primitive is 3 dimensions, relative configurations primitive is 2 dimensions.

4. geospatial entity construction method according to claim 3, is characterized in that: when structure primitive is the limit of 1 dimension, if the direction on limit comprises left-hand and dextrad, left-hand is labeled as direction 1, and dextrad is labeled as direction 2; Structure primitive is when being the chain of 1 dimension, if the direction of chain comprises left-hand and dextrad, left-hand is labeled as direction 1, and dextrad is labeled as direction 2, and the direction of chain determines as follows by the direction on the limit comprised in the chain, step-length between the node of chain and the node on limit,

5. geospatial entity construction method according to claim 4, is characterized in that: when structure primitive is the limit/chain of 1 dimension,

6. geospatial entity construction method according to claim 3, is characterized in that: when structure primitive is the planar chip of 2 dimensions, if the direction of planar chip comprises forward and backward, is backwardly labeled as direction 1, and forward direction is labeled as direction 2.

7. geospatial entity construction method according to claim 6, is characterized in that: when structure primitive is the planar chip of 2 dimensions,

8. a geospatial entity constructing system, is characterized in that: the spatial entities result that will build, is called result primitive; For constructing the initial given primitive of result primitive, be called structure primitive; If the dimension of structure primitive is n, then jointly connected by all relative configurations primitives, than the primitive of a structure primitive only low dimension, be called the public primitive of low-dimensional; Centered by the public primitive of low-dimensional, the radial structure that the possessive construction primitive being connected on this center is formed, is called structure primitive bundle; Comprise with lower module,