Safe Haskell | None |
---|---|
Language | Haskell98 |
Synopsis
- boolPathOp :: (Bool -> Bool -> Bool) -> [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double]
- union :: [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double]
- intersection :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double]
- difference :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double]
- exclusion :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double]
- data FillRule
Documentation
:: (Bool -> Bool -> Bool) | operation |
-> [ClosedPath Double] | first path (merged with union) |
-> [ClosedPath Double] | second path (merged with union) |
-> FillRule | input fillrule |
-> Double | tolerance |
-> [ClosedPath Double] |
`O((n+m)*log(n+m))`, for n
segments and m
intersections.
Combine paths using the given boolean operation
:: [ClosedPath Double] | Paths |
-> FillRule | input fillrule |
-> Double | Tolerance |
-> [ClosedPath Double] |
`O((n+m)*log(n+m))`, for n
segments and m
intersections.
Union of paths, removing overlap and rounding to the given
tolerance.
intersection :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double] Source #
path intersection
difference :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double] Source #
path difference
exclusion :: [ClosedPath Double] -> [ClosedPath Double] -> FillRule -> Double -> [ClosedPath Double] Source #
path exclusion