| Copyright | (C) Frank Staals |
|---|---|
| License | see the LICENSE file |
| Maintainer | Frank Staals |
| Safe Haskell | None |
| Language | Haskell2010 |
Algorithms.Geometry.PolygonTriangulation.Types
Description
Synopsis
- data PolygonEdgeType
- constructSubdivision :: forall s r p. (Fractional r, Ord r) => LineSegment 2 p r -> [LineSegment 2 p r] -> [LineSegment 2 p r] -> PlanarSubdivision s p PolygonEdgeType PolygonFaceData r
- constructGraph :: forall s r p. (Fractional r, Ord r) => LineSegment 2 p r -> [LineSegment 2 p r] -> [LineSegment 2 p r] -> PlaneGraph s p PolygonEdgeType PolygonFaceData r
Documentation
data PolygonEdgeType Source #
After triangulation, edges are either from the original polygon or a new diagonal.
Instances
| Eq PolygonEdgeType Source # | |
Defined in Algorithms.Geometry.PolygonTriangulation.Types Methods (==) :: PolygonEdgeType -> PolygonEdgeType -> Bool # (/=) :: PolygonEdgeType -> PolygonEdgeType -> Bool # | |
| Read PolygonEdgeType Source # | |
Defined in Algorithms.Geometry.PolygonTriangulation.Types Methods readsPrec :: Int -> ReadS PolygonEdgeType # readList :: ReadS [PolygonEdgeType] # | |
| Show PolygonEdgeType Source # | |
Defined in Algorithms.Geometry.PolygonTriangulation.Types Methods showsPrec :: Int -> PolygonEdgeType -> ShowS # show :: PolygonEdgeType -> String # showList :: [PolygonEdgeType] -> ShowS # | |
Arguments
| :: forall s r p. (Fractional r, Ord r) | |
| => LineSegment 2 p r | A counter-clockwise edge along the outer boundary |
| -> [LineSegment 2 p r] | remaining original edges |
| -> [LineSegment 2 p r] | diagonals |
| -> PlanarSubdivision s p PolygonEdgeType PolygonFaceData r |
Given a list of original edges and a list of diagonals, creates a planar-subdivision
running time: \(O(n\log n)\)
Arguments
| :: forall s r p. (Fractional r, Ord r) | |
| => LineSegment 2 p r | A counter-clockwise edge along the outer boundary |
| -> [LineSegment 2 p r] | remaining original edges |
| -> [LineSegment 2 p r] | diagonals |
| -> PlaneGraph s p PolygonEdgeType PolygonFaceData r |
Given a list of original edges and a list of diagonals, creates a planar-subdivision
running time: \(O(n\log n)\)