This dissertation summarizes all kinds of topological relationships and spatial operations, and uses the conception realms to design the data structure of spatial region objects, and devises the red、blue planar graph algorithm, and makes use of red and blue sweep-line algorithm to implement the spatial topological analysis operations on layers of region objects. At the end, further works and improvements are presented.

The authorization and access request rules and constraints of spatial region access control were defined, and the method of spatial data access control was described in detail.

The development of formal models of spatial relations is an important topic in spatial reasoning, geographic information systems (GIS) and computer vision, and has gained much attention from researchers during the recent years. In particular significant progress has been made in the models of topological relations between spatial regions.

空间关系形式化模型的发展是空间推理、地理信息系统(geographic information systems,简称GIS)、计算机视觉等领域中的一个非常重要的主题,近年来受到相关领域研究者的极大关注,特别是在空间区域间拓扑关系模型的研究方面取得了很大进展.

The modeling of topological relations between spatial regions is an important topic in spatial reasoning, geographic information systems (GIS) and computer vision. The modeling of topological relations between fuzzy regions is getting more imperative and thus has attracted plenty of attentions from researchers.

In many geographical applications, spatial regions do not always have sharply defined boundaries but frequently their interiors and boundaries are fuzzy.

That RCC model, n-intersection model andclassification invariant model have the same classification capability of topologicalrelations between 2-dimensional spatial areas is proved;

That 4-intersection model isnecessary and sufficient for classifying topological relations between 2-dimensionalspatial areas is proved, then these 3 different methods are unified.

Based on the background of the spatial data warehouse system of administration for industry and commerce in Dalian City and the Dalian City spatial data clearinghouse, focusing on the characteristics of spatial data warehouse, serveral key technologies are studied, which include the spatial data warehouse framework, spatial ETL, spatial range aggregate query and the application exploring in different application fields.

Then, the architecture of the spatial data warehouse system is provided with following three points: extending the spatial functions of data warehouse based on ComGIS, which include Geocoding component, spatial calculate and analysis components, map display components;

The correlation of signals received from a spatial region heated above the ambient medium is measured.

The functions are shown to determine a natural basis for the expansion of CFHH functions in the considered spatial region.

It is shown that either the presence of a magnetic flux in a finite spatial region or jumps in the field strength are necessary to generate a global potential.

Statistics of particles (smoke aerosol in the atmosphere) reaching a prescribed spatial region are analyzed.

Collective Cherenkov effect and anomalous Doppler effect in a bounded spatial region

The main object of the study is the effect of the acoustic parameters of the sediment layer on the formation and structure of the spatial regions within which the diffraction focusing of the acoustic field takes place.

We determine the probabilities of Landau-Zener transitions in the spatial regions where under two-photon resonance conditions the quasienergies of the atoms approach one another by a small quantity.

The spatial regions in which these fluxes are particularly intensive at different stages of the discharge are determined.

Spatial regions and optimal orientations for surface acoustic waves in langasite, langanite, and langatate piezoelectric crystals are analyzed.

New optimal spatial regions and orientations that are promising for SAW-based devices are found.

Query-by-pointing (QBP) is a kind of graphic interface between the userand the geometry model of parts, which enables the user to query informationabout the element stored in the model by pointing at its position on the screen.Almost every CAD/CAM system has its QBP-like user interface, for it isextremely visual, simple and easy to learn. The fact, however, is that paperspublished abroad mention very briefly the application of QBP-like methods,but none of them describes their algorithms in detail. Before stating...

Query-by-pointing (QBP) is a kind of graphic interface between the userand the geometry model of parts, which enables the user to query informationabout the element stored in the model by pointing at its position on the screen.Almost every CAD/CAM system has its QBP-like user interface, for it isextremely visual, simple and easy to learn. The fact, however, is that paperspublished abroad mention very briefly the application of QBP-like methods,but none of them describes their algorithms in detail. Before stating the special features of this paper, it is necessary to reviewbriefly the previous work done in this research area. A paper by Donald C.Beran of General Motors Institute entitled "Numerical Control Programming ViaComputer Graphics" describes a BOUNDARY SELECT procedure for 2-1/2-Dprofile; it requires the user to point out each element of a contour one afteranother. If one of them is missed, a boundary-broken error will occur, and itis often the case when two or more elements are smoothly linked to each other.An approach which enables the user to identify a surface from CSG model ofparts is given in paper[3]. To find the surface pointed at by the user, a rayis cast from the input point in the viewing direction, and the first surface thatintersects with such a ray will be reported as having been selected. Thismethod also makes mistakes sometimes, because there may be more than one sur-face intersecting with the ray, and the surface expected may or may not bethe first one that intersects with the ray. Another drawback is that the linearsearch of data structure will take a long time. on the basis of domestic practicein computer graphics NC programming, similar methods of man-machine interac-tion are also proposed, though the data structures and algorithms are imper-fect. And now we can turn to the special features of this paper. In this paper, the QBP algorithms and their data structures, given in NPUMaster's theses [1] and [2], are synthesized and generalized. A new datastructure and its QBP interface are put forward, to support the representationand query of 3D parts. This paper's geometric hit-detecting algorithm of elements combines the advantages of ray-surface-intersection method [3], and the hit-detecting procedure of segment picking [4,5]. Besides the Min-Max Box of ele-ments, an extent, not dependent on coordinates, is introduced and described inthis paper. In comparison with the previous algorithms, the new algorithm hasthe following characteristics: 1) The data structure is that of boundary representation. Because fewmodifications need to be made during NC programming, the storage structureis organized linearly. 2) Pseudo edges, which contain topological information without any geo-metrical data, are allowed in the data structure; for the tool path cutting the in-tersection curve between two surfaces can be generated directly from these twosurfaces. 3) The search time is minimized. By making full use of the topologicalconnectivity offered by the model of boundary representation, the range ofsearch is limited to the surfaces connected to the current surface, instead ofall surfaces in the data structure. Once the local search fails, a boundary-brokenerror will be reported automatically. And all machined surfaces are marked as"having been machined", to prevent them from being checked again. Thus, theaverage query time is roughly linear in relation to the local complexity of parts.Furthermore, an automatic query method, which combines the QBP algorithmand match procedure of the local structure patterns of parts[6, 7], is proposedto reduce the manual interruption during NC programming to a minimum.

An incoherent optical system is proposed to implement fuzzy associative memory (FAM)neural network. By using spatial areaencoding technique and shadow-casting system, fuzzy matrix-vector max-min operation needed by FAM model is optically realized. The experimental results are also given.

Based on the partial information of the machine vision system and a preprocessing approach,the uneven light field correcting,noise filtering and image segmentation presented in the defects detecting are discussed in the paper. With the background light field detection and compensation,the noise influence is effectively restrained by meams of adaptive window selection processing spatial domain and parameters correcting etc. With the accurately segmentation of image,at the same time the defect shape factors are...

Based on the partial information of the machine vision system and a preprocessing approach,the uneven light field correcting,noise filtering and image segmentation presented in the defects detecting are discussed in the paper. With the background light field detection and compensation,the noise influence is effectively restrained by meams of adaptive window selection processing spatial domain and parameters correcting etc. With the accurately segmentation of image,at the same time the defect shape factors are applied to the target recognition. The processing method described in the paper has a common significance for the practical machine vision detection system.