In this paper by ananlyzing the properties of edge-vertex cut end we show that in a 4-connected graph G with minimum degree at least five or girth at least four,there are at least two removable edges in a spanning tree of G;

This algorithm deals with the property of a Bayer color filter's color signals, and uses a compensating method to reproduce three-color data of a image.

The paper deals with how to process the gravimetric data of the Hulin Basin in wave-number field by using the technology of matched filtrating wave and the method of extending lines or points of border areas to separate the regional gravity field efficiently and to gain the experiences of defining the values of related parameters.

The singularity of geometric corners and edges can be overcome due to the scheme of the discretization of the integral equation with Galerkin's approach.

Through the coordinates conversion of robot’s pad center between sensor’s check point, performing these steps include searching edge point of vane and leaf quenching region, computing back type curve, searching vane track type curve, computing vane coordinate and so on; the main controller realized planning of robot trajectory based on spatial data lattice of searching result.

An m×n 0,1 matrix is minimally nonpacking if it is the edge-vertex incidence matrix of a minimally nonpacking clutter.

Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈?n:Ex≤1,x≥0}, P(C)={x∈?n:Cx≤1,x≥0}, αE(G)=max{1Tx subject to x∈P(E)}, and αC(G)= max{1Tx subject to x∈P(C)}.

Methods for constructing face-edge-vertex models of objects directly from image data are presented.

Yet another count of edges of H is by counting them at their incident edge-vertex.

All the remaining edges of G are oriented so that they point away from their incident edge-vertex.

Suggested by the deformation and shift data of Xigeda Group, Middle Pleistocene, an obvious zoning in stress pattern is appeared in Xichang area, Sichuan Province. That is to say, demarcating approximately at Lizhou, the northern part (around Lugu-Mianning) is mainly of intense folding deformation, with a probable principal compression stress of WNW direction; but in an area south of Lizhou (near Xichang and Qionghai) tensile normal faults are vastly developed, featuring an extension area. This paper aims at...

Suggested by the deformation and shift data of Xigeda Group, Middle Pleistocene, an obvious zoning in stress pattern is appeared in Xichang area, Sichuan Province. That is to say, demarcating approximately at Lizhou, the northern part (around Lugu-Mianning) is mainly of intense folding deformation, with a probable principal compression stress of WNW direction; but in an area south of Lizhou (near Xichang and Qionghai) tensile normal faults are vastly developed, featuring an extension area. This paper aims at how to deduce regional stress field from those locally tectonic deformation relics, and how to better explain such a peculiar phenomenon of both compression and extention existing in a small area.In this paper, from a viewpoint that the dynamic property difference in geologic medium is the main factor effecting local stress status, an evolution model of "edge to edge-vertex to edge" contact relation between rigid blocks has been presented, which can be used to better explain the above phenomenon. Finally, using plane finite element method the stress field in Xichang area has been simulated, obtaining calculated results coincident with the available data.The evolution model of "edge to edge-vertex to edge" contact relation between rigid blocks has certain enlightenment significance in origin explanation of a series paternoster narrow basins and depressive valleys in Southwest China.

In digital image mosaicking, search of seam points is the key procedure. It is usually to be done based on certain criteria to select the seam points row by row. In one-dimensional seam point search algorithm, the horizontal artificial edges are more significant than the vertical. In this article, a two-dimensional seam point searching algorithm is suggested where the grey level differences in the vertical direction are concerned as well as in the horizontal direction. Algorithm for mosaics of multispectral...

In digital image mosaicking, search of seam points is the key procedure. It is usually to be done based on certain criteria to select the seam points row by row. In one-dimensional seam point search algorithm, the horizontal artificial edges are more significant than the vertical. In this article, a two-dimensional seam point searching algorithm is suggested where the grey level differences in the vertical direction are concerned as well as in the horizontal direction. Algorithm for mosaics of multispectral images is also introduced. Experiments show that with the method proposed, the artificial edges in the mosaics can be smoothed effectively.

In the traditional divide algorithm for intersection of two parameter surfaces, it is impossible to simply calculate the intersection of polygons approxi mated from divided surfaces because of the, thickness of the polygons. An improving algorithm is presented which has eliminated some unreasonable phenomena, such as intersection segments lost, by considering the relationship among faces, edges and vertices of polygons in global view, and by computing the intersection of any two polygons under environment of...

In the traditional divide algorithm for intersection of two parameter surfaces, it is impossible to simply calculate the intersection of polygons approxi mated from divided surfaces because of the, thickness of the polygons. An improving algorithm is presented which has eliminated some unreasonable phenomena, such as intersection segments lost, by considering the relationship among faces, edges and vertices of polygons in global view, and by computing the intersection of any two polygons under environment of all polygons. It has been proved by experiments that the algorithm is robust.