Liu Yong‐Kui
Abstract
Abstract The 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.
OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract The 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.
Key concepts: Hexagonal tiling, Hexagonal crystal system, Grid, Set (abstract data type), Plane (geometry), Computer science, Integer (computer science), Computer graphics (images)