Algorithms.Geometry.DelaunayTriangulation.Types

Documentation

type VertexID = Int

Rotating Right - rotate clockwise

type Vertex = CList VertexID

type Adj = IntMap (CList VertexID)

data Triangulation p r

Neighbours are stored in clockwise order: i.e. rotating right moves to the next clockwise neighbour.

Constructors

Triangulation

Fields

_vertexIds :: Map (Point 2 r) VertexID

_positions :: Vector (Point 2 r :+ p)

_neighbours :: Vector (CList VertexID)

Instances

(Eq p, Eq r) => Eq (Triangulation p r)

(Show p, Show r) => Show (Triangulation p r)

vertexIds :: forall p r. Lens' (Triangulation p r) (Map (Point 2 r) VertexID)

positions :: forall p r p. Lens (Triangulation p r) (Triangulation p r) (Vector ((:+) (Point 2 r) p)) (Vector ((:+) (Point 2 r) p))

neighbours :: forall p r. Lens' (Triangulation p r) (Vector (CList VertexID))

type Mapping p r = (Map (Point 2 r) VertexID, Vector (Point 2 r :+ p))

showDT :: (Show p, Show r) => Triangulation p r -> IO ()

triangulationEdges :: Triangulation p r -> [(Point 2 r :+ p, Point 2 r :+ p)]

tEdges :: Triangulation p r -> [(VertexID, VertexID)]

drawTriangulation :: IpeOut (Triangulation p r) (IpeObject r)

data ST a b c

Constructors

ST

Fields

fst' :: !a

snd' :: !b

trd' :: !c

type ArcID = Int

type ST' a = ST (Map (VertexID, VertexID) ArcID) ArcID a

ST' is a strict triple (m,a,x) containing:

• m: a Map, mapping edges, represented by a pair of vertexId's (u,v) with u < v, to arcId's.
• a: the next available unused arcID
• x: the data value we are interested in computing

toPlaneGraph :: forall proxy s p r. proxy s -> Triangulation p r -> PlaneGraph s Primal_ p () () r