Results 251 to 260 of about 8,134 (290)
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.
Yong-Kui, Liu
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fourier Analysis of Multigrid Methods on Hexagonal Grids
SIAM Journal of Scientific Computing, 2009This 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 ...
Scott R Fulton
exaly +2 more sources
Firefighting on the hexagonal grid
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdullah Dean +6 more
openaire +2 more sources
Weighted distances on the truncated hexagonal grid
Pattern Recognition Letters, 2021Abstract Recently chamfer distances have been developed not only on the usual integer grids, but also on some non traditional grids including grids which are not lattices. In this paper the truncated hexagonal grid is considered: its pixels are dodecagons and two shaped (oriented) triangles.
Kovacs, Gergely +2 more
openaire +1 more source
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
Dynamic monopolies and feedback vertex sets in hexagonal grids
Computers and Mathematics With Applications, 2011 In a majority conversion process, the vertices of a graph can be in one of the two states, colored or uncolored, and these states are dynamically updated so that a vertex becomes colored at a certain time period if at least half of its neighbors were in ...
Sarah Spence Adams, Denise Sakai Troxell
exaly +2 more sources
IEEE Transactions on Computers, 1976
A simple formula is derived for the distance between two points on a hexagonal grid, in terms of coordinates with respect to a pair of oblique axes.
Luczak, Ed, Rosenfeld, Azriel
openaire +1 more source
A simple formula is derived for the distance between two points on a hexagonal grid, in terms of coordinates with respect to a pair of oblique axes.
Luczak, Ed, Rosenfeld, Azriel
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