This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The algorithms for diamond shaped window require only seven or eight additions and subtractions per pixel. A number of other shapes of diamond windows such as skewed or parallelogram shaped diamond, long diamond, and lozenged diamond...

Candidates to the least perimeter partition of various polygonal shapes into N planar connected equal-area regions are calculated for N 6 42, compared to partitions of the disc, and discussed in the context of the energetic groundstate of a two-dimensional monodisperse foam. The total perimeter and the number of peripheral regions are presented, and the patterns classified according to the numb...

We provide a geometrical construction of the unique slim dense near hexagon with parameters (s, t, t2) = (2, 5, {1, 2}). Using this construction, we construct the rank 3 symplectic dual polar space DSp(6, 2) which is the unique slim dense near hexagon with parameters (s, t, t2) = (2, 6, 2). Both near hexagons are constructed from two copies of the unique generalized quadrangle with parameters (...

We analyze the electronic properties of boron nitride oxide (BNO) sheets using the density functional theory within the local density approximation, in a similar form as reported by Sota et al., [Diamond Relat. Mater. 17, 826 (2008)]. The BNO sheets with the chemical composition of B27N27H18+O, are represented by the circular arm-chair model. Six different configurations are considered to inves...

Isomeric diamond hydrocarbons (diamondoids or polymantanes) with the same number n of adamantane units share the same molecular formula C(Q)(CH)(T)(CH(2))(S) and can be divided into valence isomers (denoted as Q-T-S) by partitioning the number C = Q + T + S of their carbon atoms according to whether they are quaternary, tertiary, or secondary. Vertices of dualists are the centers of adamantane ...

UNLABELLED Due to the size of Next-Generation Sequencing data, the computational challenge of sequence alignment has been vast. Inexact alignments can take up to 90% of total CPU time in bioinformatics pipelines. High-performance Integrated Virtual Environment (HIVE), a cloud-based environment optimized for storage and analysis of extra-large data, presents an algorithmic solution: the HIVE-hex...

Abstract—The most essential part in Video Coding Standards is Motion Estimation. But, Motion Estimation itself consumes more than half of the coding time to encode. To reduce the computational complexity, the time required for Motion Estimation should be reduced for which efficient algorithms are required. A new Modified Cross Hexagon Diamond Search (MCHDS) algorithm is proposed which will redu...

This paper presents fast moving window algorithms for calculating local statistics in a diamond, hexagon, and general polygonal shaped windows of an image which is important for real-time applications. The algorithms for a diamond shaped window requires only seven or eight additions and subtractions per pixel. A fast sparse algorithm only needs four additions and subtractions for a sparse diamo...