In this paper, we introduce the notion of co-annihilator of a subsetin a triangle algebra. It is shown that the co-annihilator of asubset is an interval valued residuated lattice (IVRL)-filter. Also, aspecial set of a triangle algebra is defined and the relationshipbetween this set and co-annihilator of a subset in triangle algebrais considered. Finally, co-annihilators preserving congruencerel...

In the field of view-dependant continuous level of detail of triangle-meshes it is often necessary to extract the current LOD triangle by triangle. Thus, triangle strips are only of very limited use, or only usable with a high effort. In this work a method is proposed that allows a stepwise reduction of a great, fine stepped LOD hierarchy by merging nodes. The result of this process is a reduce...

The classical approach of solvability using group theory is well known and one original motivation is to solve polynomials by radicals. Radicals are square, cube, square root, cube root etc of the original coefficients for the polynomial. A polynomial is solvable by radicals if the permutation group is solvable. This is exact solvability via group theory. With modern computers, we might need to...

in this paper, we consider an arbitrary binary polynomial sequence {a_n} and then give a lower triangular matrix representation of this sequence. as main result, we obtain a factorization of the innite generalized pascal matrix in terms of this new matrix, using a riordan group approach. further some interesting results and applications are derived.

To enhance the triangle quality of a reconstructed triangle mesh, a novel triangle mesh standardization method based on particle swarm optimization (PSO) is proposed. First, each vertex of the mesh and its first order vertices are fitted to a cubic curve surface by using least square method. Additionally, based on the condition that the local fitted surface is the searching region of PSO and th...

To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...

the bender-gestalt test was given to thirty mentally-retarded psychiatric patients. the mean, standard deviation, and standard error were 56.73, 26.25, and 4.80 respectively. rotation was the most frequent major deviation which occurred in all the designs. design # 7 was the most difficult one to be reproduced in the sample. this design by itself, was subject to 47% of distortion, 79% of omissi...