Results 261 to 270 of about 28,807 (292)
Some of the next articles are maybe not open access.
IEEE Transactions on Games, 2021
A fundamental requirement for scientific treatment of board games is a simple and practical numbering of the map locations. With square grids, an obvious solution is coordinates along two orthogonal axes. Hexagonal grids, however, have three axes, and only one of them can be aligned with an edge of a square board. Various systems have been proposed for
openaire +1 more source
A fundamental requirement for scientific treatment of board games is a simple and practical numbering of the map locations. With square grids, an obvious solution is coordinates along two orthogonal axes. Hexagonal grids, however, have three axes, and only one of them can be aligned with an edge of a square board. Various systems have been proposed for
openaire +1 more source
Computer graphics on a hexagonal grid
Computers & Graphics, 1984Abstract Aberrations in digital images can be attenuated by computing the image at higher-than-display resolution, convolving it with a two-dimensional filter kernel and decimating the filtered image back to display resolution for presentation. Traditionally, this has been performed using a rectangular sampling grid, which is parallel to the display ...
Lewis Neale Lester, John Sandor
openaire +1 more source
Detector shape in hexagonal sampling grids
SPIE Proceedings, 2001Recent improvements in CCD technology make hexagonal sampling attractive for practical applications and bring a new interest on this topic. In the following the performances of hexagonal sampling are analyzed under general assumptions and compared with the performances of conventional rectangular sampling.
S. Baronti +4 more
openaire +1 more source
Distance transformations on hexagonal grids
Pattern Recognition Letters, 1988A distance transformation converts a binary image, consisting of feature and non-feature pixels, into a distance image. In this distance image each non-feature pixel has a value that approximates (or is equal to) the distance to the nearest feature pixel. Distance transformation will be denoted DT henceforth.
openaire +1 more source
Skeletonizing the distance transform on the hexagonal grid
[1988 Proceedings] 9th International Conference on Pattern Recognition, 2003An efficient skeletonizing algorithm is presented for the hexagonal grid. The skeleton has unit width, except at crossings and in regions of the shape having even width. Otherwise the skeleton has all the properties generally required for correct skeletons.
G Borgefors, G Sanniti di Baja
openaire +3 more sources
A hexagonal Fourier model of grid cells
Hippocampus, 2018AbstractGrid cells in rat medial entorhinal cortex are widely thought to play a major role in spatial behavior. However, the exact computational role of the population of grid cells is not known. Here we provide a descriptive model, which nonetheless considers biologically feasible mechanisms, whereby the grid cells are viewed as a two‐dimensional ...
Ulises Rodríguez‐Domínguez +1 more
openaire +2 more sources
Go Without Ko on Hexagonal Grids [PDF]
ICGA Journal, 2012 The note explains why the ko rule, which is essential for the game of Go, is not needed for hexagonal versions of the game. This known property was recently re-discovered through an evolutionary search for new games.
openaire +1 more source
Drawing conics on a hexagonal grid
Proceedings Fifth International Conference on Information Visualisation, 2002An algorithm is presented which can be used to outline ellipses, circles, or any of the other conic sections on a hexagonal lattice. The basic algorithm requires just one test and three add operations in the inner loop, though an additional test is required to detect a change in the overall direction between two adjacent sectants.
openaire +1 more source
Optimal halftoning over hexagonal grids
SPIE Proceedings, 2006Halftoning approaches to image rendering on binary devices have traditionally relied on rectangular grids for dot placement. This practice has been followed mainly due to restrictions on printer hardware technology. However, recent advances on printing devices coupled with the availability of efficient interpolation and resampling algorithms are making
Jan Bacca Rodríguez +3 more
openaire +1 more source
The Generation of Straight Lines on Hexagonal Grids
Computer Graphics Forum, 1993AbstractThe 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 an algorithm for the generation of straight lines on hexagonal grids. It uses only integer arithmetic.
openaire +1 more source