The problem of efficiently accessing and maintaining adjacency information for triangulations over general surface domains is addressed. Rapid access to adjacent vertices, edges, and triangles is an important aspect of multiresolution techniques, from subdivision surfaces to mesh simplification. Novel data structures and algorithms for the construction, manipulation, and traversal of triangulat...

Compositionality is a critical and universal characteristic of human language. It is found at numerous levels, including the combination of morphemes into words and of words into phrases and sentences. These compositional patterns can generally be characterized by rules. For example, the past tense of most English verbs ("regulars") is formed by adding an -ed suffix. However, many complex lingu...

We investigate how to create an integrated and consistent model of terrain and network data, and define a geometric simplification method that uses an underlying triangulated irregular network (TIN) representation to maintain the topological relationships of the embedded network. The method is used to create a consistent multiresolution data structure. An edge collapse strategy is described tha...

This paper presents a novel image representation, which incorporates the principles of Laplacian Pyramid into the irregular graph pyramid. The drawback of the regular Laplacian Pyramid is their lack to keep the topological structure of the image, due to the contraction process in building the Gaussian Pyramid. Irregular graph pyramid is able to hierarchically represent the topological structure...

The Bounded Irregular Pyramid (BIP) is a hierarchical structure for image representation whose aim is to combine concepts from regular and irregular pyramids. The data structure is a combination of the simplest regular and irregular structures: the 2× 2/4 regular one and the simple graph representation. However, simple graphs only take into account adjacency relationships, being unable to corre...

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

King [3] introduced and examined the concepts of almost A-summable sequence, almost conservative matrix and almost regular matrix. In this paper, we introduce and examine the concepts of λ-almost A-summable sequence, λalmost conservative matrix and λ-almost regular matrix. Also we introduce statistically (V, λ)-summable sequence.

In 1911, Steinhaus presented the following theorem: if A is a regular matrix then there exists a sequence of 0’s and 1’s which is not A-summable. In 1943, R. C. Buck characterized convergent sequences as follows: a sequence x is convergent if and only if there exists a regular matrix A which sums every subsequence of x. In this paper, definitions for “subsequences of a double sequence” and “Pri...