Results 1  10
of
105,075
Perfect Domination of Rectangular Grids
, 2000
"... Let m and n be positiveintegers. The algorithmic search for perfect dominating sets of the rectangular grid G m#n satisfying an initial condition S 0 defined as an admissible subset of a side G m#1 of Gm#n suchthatS "G m#1 = S 0 is considered. A binary decision algorithm that generates all ..."
Abstract
 Add to MetaCart
Let m and n be positiveintegers. The algorithmic search for perfect dominating sets of the rectangular grid G m#n satisfying an initial condition S 0 defined as an admissible subset of a side G m#1 of Gm#n suchthatS "G m#1 = S 0 is considered. A binary decision algorithm that generates
GridDistortion on NonRectangular Grids
, 1995
"... Griddistortion is an image warping technique which is driven by the mapping between equivalent families of curves, arranged in a grid structure. Until recently only curves sets arranged in a regular rectangular grid were considered. In the present work we construct a smooth (C 1 ) griddistortion ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Griddistortion is an image warping technique which is driven by the mapping between equivalent families of curves, arranged in a grid structure. Until recently only curves sets arranged in a regular rectangular grid were considered. In the present work we construct a smooth (C 1 ) grid
ON LINES AND THEIR INTERSECTION POINTS IN A RECTANGULAR GRID OF POINTS
, 2009
"... In an m × n rectangular grid of points (here m = 4, n = 6) lines through at least 2 points of the grid (136 lines) and points of intersection of these lines inside the grid (1961 points) ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In an m × n rectangular grid of points (here m = 4, n = 6) lines through at least 2 points of the grid (136 lines) and points of intersection of these lines inside the grid (1961 points)
Construction of fractal interpolation surfaces on rectangular grids
, 2008
"... We present a general method of generating continuous fractal interpolation surfaces by iterated function systems on an arbitrary data set over rectangular grids and estimate their Boxcounting dimension. ..."
Abstract
 Add to MetaCart
We present a general method of generating continuous fractal interpolation surfaces by iterated function systems on an arbitrary data set over rectangular grids and estimate their Boxcounting dimension.
On monochromatic subsets of a rectangular grid
 Integers
"... Abstract. For n ∈ N, let [n] denote the integer set {0, 1,..., n − 1}. For any subset V ⊂ Z 2, let Hom(V) = {cV + b: c ∈ N,b ∈ Z 2}. For k ∈ N, let Rk(V) denote the least integer N0 such that for any N ≥ N0 and for any kcoloring of [N] 2, there is a monochromatic subset U ∈ Hom(V). The argument of ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. For n ∈ N, let [n] denote the integer set {0, 1,..., n − 1}. For any subset V ⊂ Z 2, let Hom(V) = {cV + b: c ∈ N,b ∈ Z 2}. For k ∈ N, let Rk(V) denote the least integer N0 such that for any N ≥ N0 and for any kcoloring of [N] 2, there is a monochromatic subset U ∈ Hom(V). The argument of Gallai ensures that Rk(V) is finite. We investigate bounds on Rk(V) when V is a three or fourpoint configuration in general position. In particular, we prove that R2(S) ≤ V W(8), where V W is the classical van der Waerden number for arithmetic progressions and S is a square S = {(0, 0), (0,1),(1, 0),(1, 1)}. 1.
Perfect domination in rectangular grid graphs
"... A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S ′ of a side Pm of an m × n grid graph G, the perfect dominating sets S in G with S ′ = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ of runni ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S ′ of a side Pm of an m × n grid graph G, the perfect dominating sets S in G with S ′ = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ
Enumeration of hamiltonian circuits in rectangular grids
 J. Combin. Math. Combin. Comput
, 1996
"... [ Note: this article has been accepted for publication by the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
[ Note: this article has been accepted for publication by the
The Congestion of nCube Layout on a Rectangular Grid
, 1998
"... We consider the problem of embedding the ndimensional cube into a rectangular grid with 2 n vertices in such a way as to minimize the congestion, the maximum number of edges along any point of the grid. After presenting a short solution for the cutwidth problem of the ncube (in which the ncube ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
We consider the problem of embedding the ndimensional cube into a rectangular grid with 2 n vertices in such a way as to minimize the congestion, the maximum number of edges along any point of the grid. After presenting a short solution for the cutwidth problem of the ncube (in which the n
Constrained C1 Interpolation on Rectangular Grids
"... Abstract.This paper is concerned with the range restricted interpolation of 'data on rectangular grids. The interpolant is constrained to lie on the same side of the constraint surface as the data. Sufficient nonnegativity conditions on the Bezier ordinates are derived to ensure the nonnegati ..."
Abstract
 Add to MetaCart
Abstract.This paper is concerned with the range restricted interpolation of 'data on rectangular grids. The interpolant is constrained to lie on the same side of the constraint surface as the data. Sufficient nonnegativity conditions on the Bezier ordinates are derived to ensure the non
Mixed finite element method on distorted rectangular grids
, 1994
"... A new mixed nite element method on totally distorted rectangular meshes is introduced with optimal error estimates for both pressure and velocity. This new mixed discretization discontinuity of the rough coe ts the geometric shapes of the cients and domain boundaries well. This new mixed method also ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
also enables us to derive the optimal error estimates and existence and uniqueness of Thomas's mixed distorted rectangular grids [19]. The lowest order RaviartThomas mixed nite elements method on nite rectangular element method becomes a special case of both methods, when all the elements
Results 1  10
of
105,075