Results 271 to 280 of about 8,134 (290)

Hexagon-Diamond Grid System for Motion Tracking

2009 Third UKSim European Symposium on Computer Modeling and Simulation, 2009
Based on the block-matching motion vector estimation techniques, a grid system using the block-based technique is proposed for motion tracking in video sequences. The technique is known as hexagon-diamond grid system (HDGS). The HDGS has a large hexagon and small diamond search pattern based on block-matching motion tracking characteristics.
Singh Sarban Singh Ranjit, Siva Kumar Subramaniam, Sani Irwan Md. Salim, Ridza Azri Ramlee   +3 more
openaire   +1 more source

Binary Tomography on Triangular Grid Involving Hexagonal Grid Approach

2018
In this paper, we consider the binary tomography reconstruction problem of images on the triangular grid. The reconstruction process is based on three natural directions of projections, defined by the lane directions of the triangular grid (they are analogous to row and column directions on the square grid).
Nagy, Benedek, Lukic, Tibor
openaire   +1 more source

Zero-Sum Flow Numbers of Hexagonal Grids

2013
As an analogous concept of nowhere-zero flows for directed and bi-directed graphs, we consider zero-sum flows for undirected graphs in this article. For an undirected graph G, a zero-sum k -flow is an assignment of non-zero integers whose absolute values less than k to the edges, such that the sum of the values of all edges incident with each vertex is
Tao-Ming Wang, Guang-Hui Zhang
openaire   +1 more source

Wiring layouts in the tri-hexagonal grid^∗

International Journal of Computer Mathematics, 1990
The problem of wiring (or layer assignment for) VLSI layouts is a fundamental and classical one, and arises naturally after the routing phase of a CAD system. In this paper we present an algorithm for wiring layouts in the tri-hexagonal grid. This is the first wiring algorithm for layouts in the tri-hexagonal grid and it produces wirings that require ...
openaire   +1 more source

The Elementary Equation of the Conjugate Transformation for the Hexagonal Grid

1993
In this paper the conjugate transformation of the hexagonal grid is described and its elementary equation is defined. Two strategies are used to extend a matrix morphology into the conjugate transformation. First, the conjugate classification represents 128 structuring elements of the kernel form of the hexagonal grid to a tree of six levels. Each node
Z. J. Zheng, Anthony J. Maeder
openaire   +1 more source

Full and Sparse Hexagonal Grids in the Plane

Springer Atmospheric Sciences, 2022
Jürgen Steppeler, Jinxi Li, Steppeler Jürgen   +2 more
exaly  

Method of Building a Hexagonal Grid

2021 XV International Scientific-Technical Conference on Actual Problems Of Electronic Instrument Engineering (APEIE), 2021
Nickolay M. Zubashevskiy, Alexander B. Berkin   +1 more
openaire   +1 more source

Distance transformations on hexagonal grids

Pattern Recognition Letters, 1989
Gunilla Borgefors
exaly  

Rectangular and hexagonal grids used for observation, experiment and simulation in ecology

Ecological Modelling, 2007
Colin P D Birch
exaly  

Hexagonal Grid Halftoning

2018
openaire   +1 more source