Algorithms.Geometry.DelaunayTriangulation.Types

Synopsis

• type VertexID = Int
• type Vertex = CList VertexID
• type Adj = IntMap (CList VertexID)
• data Triangulation p r = Triangulation {
  • _vertexIds :: Map (Point 2 r) VertexID
  • _positions :: Vector (Point 2 r :+ p)
  • _neighbours :: Vector (CList VertexID)
  }
• 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 = ST {
  • fst' :: !a
  • snd' :: !b
  • trd' :: !c
  }
• type ArcID = Int
• type ST' a = ST (Map (VertexID, VertexID) ArcID) ArcID a
• toPlanarSubdivision :: proxy s -> Triangulation p r -> PlanarSubdivision s p () () r
• toPlaneGraph :: forall proxy s p r. proxy s -> Triangulation p r -> PlaneGraph s Primal_ p () () r

Documentation