grid-7.0: Tools for working with regular grids (graphs, lattices).

Portabilityportable
Stabilityexperimental
Maintaineramy@nualeargais.ie
Safe HaskellSafe-Inferred

Math.Geometry.Grid.TriangularInternal

Description

A module containing private TriGrid internals. Most developers should use TriGrid instead. This module is subject to change without notice.

Synopsis

Documentation

data UnboundedTriGrid Source

An unbounded grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

UnboundedTriGrid 

triZ :: Int -> Int -> IntSource

For triangular tiles, it is convenient to define a third component z.

data TriTriGrid Source

A triangular grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

TriTriGrid Int [(Int, Int)] 

triTriGrid :: Int -> TriTriGridSource

triTriGrid s returns a triangular grid with sides of length s, using triangular tiles. If s is nonnegative, the resulting grid will have s^2 tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

data ParaTriGrid Source

A Parallelogrammatical grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

ParaTriGrid (Int, Int) [(Int, Int)] 

paraTriGrid :: Int -> Int -> ParaTriGridSource

paraTriGrid r c returns a grid in the shape of a parallelogram with r rows and c columns, using triangular tiles. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

data RectTriGrid Source

A rectangular grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

RectTriGrid (Int, Int) [(Int, Int)] 

rectTriGrid :: Int -> Int -> RectTriGridSource

rectTriGrid r c returns a grid in the shape of a rectangle (with jagged edges) that has r rows and c columns, using triangular tiles. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

data TorTriGrid Source

A toroidal grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

TorTriGrid (Int, Int) [(Int, Int)] 

torTriGrid :: Int -> Int -> TorTriGridSource

torTriGrid r c returns a toroidal grid with r rows and c columns, using triangular tiles. The indexing method is the same as for ParaTriGrid. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

data YCylTriGrid Source

A cylindrical grid with triangular tiles, where the cylinder is along the y-axis. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

YCylTriGrid (Int, Int) [(Int, Int)] 

yCylTriGrid :: Int -> Int -> YCylTriGridSource

yCylTriGrid r c returns a cylindrical grid with r rows and c columns, using triangular tiles, where the cylinder is along the y-axis. The indexing method is the same as for ParaTriGrid. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.