The Generation of Circular Arcs on Hexagonal Grids
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 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. Error criteria are explicitly specified.
BibTeX
@article {10.1111:1467-8659.1210021,
journal = {Computer Graphics Forum},
title = {{The Generation of Circular Arcs on Hexagonal Grids}},
author = {Yong-Kui, Liu},
year = {1993},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1210021}
}
journal = {Computer Graphics Forum},
title = {{The Generation of Circular Arcs on Hexagonal Grids}},
author = {Yong-Kui, Liu},
year = {1993},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1210021}
}