The Generation of Circular Arcs on Hexagonal Grids

dc.contributor.authorYong-Kui, Liuen_US
dc.date.accessioned2014-10-21T07:23:24Z
dc.date.available2014-10-21T07:23:24Z
dc.date.issued1993en_US
dc.description.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. Error criteria are explicitly specified.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume12en_US
dc.identifier.doi10.1111/1467-8659.1210021en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages21-26en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1210021en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleThe Generation of Circular Arcs on Hexagonal Gridsen_US
Files
Collections