Results 271 to 280 of about 28,807 (292)

Image reconstruction with a hexagonal grid

2002 IEEE Nuclear Science Symposium Conference Record, 2003
Conventional image reconstruction methods use a square grid for ease of calculation or display of the image. On a square grid there are two possible ways to define neighboring pixels. We can either regard pixels as neighbors when they have a common edge or when they have at least one common corner, so that four and eight neighbors exist (a 4 ...
A. Yabushita, K. Ogawa
openaire   +1 more source

The Generation of Circular Arcs on Hexagonal Grids

Computer Graphics Forum, 1993
AbstractThe best disposition of a discrete set of points on the plane can be reached if the points are on a hexagonal grid. This paper describes two algorithms for circular arc mesh point selection on hexagonal grids. They find the closest integer coordinates to the actual circular arc using only integer arithmetic.
openaire   +1 more source

A generalized methodology for the gridding of microarray images with rectangular or hexagonal grid

Signal, Image and Video Processing, 2015
Microarrays provide a simple way to measure the level of hybridization of known probes of interest with one or more samples under different conditions. The rapid development of microarray technology requires the implementation of smart and flexible algorithms to deal either with the great amount of data or with the variations of the used hardware.
Nikolaos Giannakeas, Fanis G. Kalatzis, Markos G. Tsipouras, Dimitrios I. Fotiadis   +3 more
openaire   +1 more source

Fourier Analysis of Multigrid Methods on Hexagonal Grids

SIAM Journal on Scientific Computing, 2009
This paper applies local Fourier analysis to multigrid methods on hexagonal grids. Using oblique coordinates to express the grids and a dual basis for the Fourier modes, the analysis proceeds essentially the same as for rectangular grids. The framework for one- and two-grid analyses is given and then applied to analyze the performance of multigrid ...
Guohua Zhou, Scott R. Fulton
openaire   +1 more source

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

A hexagonal grid geometry system for applications in 3D graphics

International Journal of Computer Applications in Technology, 2023
Shichang Sun
exaly