Results 261 to 270 of about 31,680 (296)
Some of the next articles are maybe not open access.
On Identifying Codes in the Triangular and Square Grids
SIAM Journal on Computing, 2004Summary: It is shown that in the infinite square grid the density of every \((r, \leq 2)\)-identifying code is at least 1/8 and that there exists a sequence \(C_r\) of \((r, \leq 2)\)-identifying codes such that the density of \(C_{r}\) tends to 1/8 when \(r \rightarrow \infty\).
Iiro S. Honkala, Tero Laihonen
openaire +1 more source
Routing in the triangular grid with evolved agents
2010 International Conference on High Performance Computing & Simulation, 2010Summary: This paper describes an efficient novel router on the 6-valent triangular grid with toroidal connections, denoted T-grid in the sequel. The router uses six channels per node that can host up to six agents. The topological properties of the T-grid are given first, as well as a minimal routing scheme, as a basis for a cellular automata modeling ...
Patrick Ediger +2 more
openaire +3 more sources
A recursive algorithm for Hermite interpolation over a triangular grid
Journal of Computational and Applied Mathematics, 1996 A recursive algorithm for Hermite interpolation of bivariate data over triangular grids is presented. This interpolation algorithm has a dynamic programming flavor and it computes a single polynomial that interpolates the full set of data.
R.N. Goldman +7 more
exaly +2 more sources
Mathematical Morphology on the Triangular Grid: The Strict Approach
SIAM Journal on Imaging Sciences, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohsen Abdalla, Benedek Nagy
openaire +3 more sources
Simple conditions for forming triangular grids
Neurocomputing, 2007We have used simple learning rules to study how firing maps containing triangular grids-as found in in vivo experiments-can be developed by Hebbian means in realistic robotic simulations. We started from typical non-local postrhinal neuronal responses.
Bálint Takács, András Lörincz
openaire +1 more source
Weighted Distances on a Triangular Grid
2014In this paper we introduce weighted distances on a triangular grid. Three types of neighborhood relations are used on the grid, and therefore three weights are used to define a distance function. Some properties of the weighted distances, including metrical properties are discussed.
openaire +2 more sources
Surface representations based on triangular grids
The Visual Computer, 1987The problem of representing 2 1/2 dimensional surfaces defined at a set of randomly located points by means of triangular grids is considered. Such representations approximate a surface as a network of planar, triangular faces with vertices at the data points.
openaire +1 more source
Finite differences on triangular grids
Numerical Methods for Partial Differential Equations, 1998A finite difference method is defined on a triangular grid for the Dirichlet problem of the Poisson equation. A relation between this finite difference scheme and the finite element method is given. From this new point of view the properties (maximum principle) of the solution and convergence are analyzed.
Brighi, B, Chipot, M, Gut, E
openaire +3 more sources
Isoperimetrically Optimal Polygons in the Triangular Grid
2011It is well known that a digitized circle doesn't have the smallest (digital arc length) perimeter of all objects having a given area. There are various measures of perimeter and area in digital geometry, and so there can be various definitions of digital circles using the isoperimetric inequality (or its digital form).
Benedek Nagy, Krisztina Barczi
openaire +1 more source
Cellular Topology on the Triangular Grid
2012In this paper we use the triangular grid and present a coordinate system that is appropriate to address elements (cells) of cell complexes. Coordinate triplets are used to address the triangle pixels of both orientations, the edges between them and the points at the corners of the triangles.
openaire +1 more source