An efficient search algorithm using the principle of Hexagon-Based Search algorithm (HEXBS) for motion estimation called Hexagon-Based Fast Search algorithm (HEXFS) is proposed in this paper. The proposed algorithm combines the hexagon search algorithm and a two-step search algorithm which uses cross search patterns to reduce the huge calculation complexity. The experimental results show that t...

We show that a generalized hexagon of order 3 which contains a subhexagon of order (1, 3) must be the split Cayley hexagon H(3). MSC-2000 : 51E12 keywords : generalized hexagon, split-Cayley hexagon, incidence geometry

An approach to modeling and visualization of non-Newtonian flows that is based on lattice-Boltzmann techniques is described. Important advantages over traditional, finite-element methods include the speed and simplicity of the update and the reduced storage, which is linear in the number of nodes. Because the quantities of interest in the solution depend critically upon directional flow densiti...

we show that the category of convergence approach spaces is a simultaneously reective and coreective subcategory of the category of latticevalued limit spaces. further we study the preservation of diagonal conditions, which characterize approach spaces. it is shown that the category of preapproach spaces is a simultaneously reective and coreective subcategory of the category of lattice-valued p...

In this paper, we propose a new hybrid Cross Hexagon Diamond Search algorithm (CHDS) using crossshaped search pattern as the initial step and asymmetric hexagon-shaped patterns and small diamond pattern as the subsequent steps for fast block motion estimation. In block motion estimation, search pattern with different shape or size and the center biased motion vector distribution characteristics...

Hexagonal regions are optimal for subdividing the plane in the sense that the regions are as close as possible to the disk shape while still providing a tessellation of the plane. It is however not possible to do recursive subdivisions, i.e. to divide a hexagon into smaller hexagons. In this paper, hexagon-like fractal regions will be presented. It is possible to decompose a hexagon-like fracta...

We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...

Using the molecular dynamics method, of hydrogen bond (HB) networks emerging on surface a graphene sheet during its functionalization with hydroxyl groups OH are simulated. It is demonstrated that two form an energetically more advantageous structure when they covalently attached one side to carbon atoms forming opposite vertices hexagon valence bonds sheet. Attaching located at hexagons leads ...

In this paper we discuss the design of a novel category of photonic crystal slabs (PCS) and as an example, we consider structures based on SOI wafers. Fabrication issues related to lithographic accuracy are addressed, too. The geometry consists in a triangular lattice of hexagons having their symmetry axes rotated with respect to the lattice.We show that the mirror-symmetric 'hexagon-type' PCS ...

We investigate certain measures induced by families of non-intersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abc-hexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained, e.g. the Krawtchouk and Hahn ensembles, have the same structure as the eigenvalue measures in random matrix theory like GUE, which can in fact can be obtain...