Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.graphics.algorithms > #315

Re: Honeycomb tiling algorithm

Show all headers | View raw

On Wed, 10 Aug 2011 14:55:04 -0700, Tiron wrote:

> I'm trying to come up with an algorithm to calculate the points for
> the vertices of a honeycomb pattern, to be used as a tile. Basically,
> given any arbitrary tile size, I need to produce a single honeycomb
> pattern inside of it so that it can then be tiled to produce a
> seamless honeycomb pattern across the screen. These need to be
> equilateral hexagons.
> 
> I've been able to implement a rudimentary version of this myself, but
> I'm quite sure I'm doing it wrong because I can't seem to manage an
> equilateral hexagon. Does anyone know the preferred method for this?

Are you talking about rectangular tesselation? If so, then for equilateral
hexagons, the rectangles need an aspect ratio of 3 / sqrt(3) ~= 1.732, or
a rational multiple thereof.

If the tile dimensions are constrained to an integral number of pixels,
then you can't get an exact equilateral hexagon, only an approximation
(97/56 is ~53ppm).

Back to comp.graphics.algorithms | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Honeycomb tiling algorithm Tiron <weston17@gmail.com> - 2011-08-10 14:55 -0700
  Re: Honeycomb tiling algorithm Nobody <nobody@nowhere.com> - 2011-08-11 08:30 +0100
    Re: Honeycomb tiling algorithm Tiron <weston17@gmail.com> - 2011-08-11 12:48 -0700
      Re: Honeycomb tiling algorithm Nobody <nobody@nowhere.com> - 2011-08-12 04:48 +0100
  Re: Honeycomb tiling algorithm Kaba <kaba@nowhere.com> - 2011-08-12 01:23 +0300

csiph-web