hasufell
984ed40c63
# Conflicts: # Algebra/Vector.hs # CG2.cabal # Graphics/Diagram/Core.hs # Graphics/Diagram/Gif.hs # Graphics/Diagram/Gtk.hs # Test/Vector.hs
80 lines
2.6 KiB
Haskell
80 lines
2.6 KiB
Haskell
{-# OPTIONS_HADDOCK ignore-exports #-}
|
|
|
|
module Graphics.Diagram.Gtk where
|
|
|
|
import Algebra.Vector
|
|
import qualified Data.ByteString.Char8 as B
|
|
import Data.List(find)
|
|
import Diagrams.Backend.Cairo
|
|
import Diagrams.Prelude
|
|
import Graphics.Diagram.AlgoDiags
|
|
import Graphics.Diagram.Core
|
|
import Graphics.Diagram.Plotter
|
|
import Parser.Meshparser
|
|
|
|
|
|
-- |Data structure that holds an algorithm identifier and it's
|
|
-- corresponding list of diagrams.
|
|
newtype DiagAlgo = DiagAlgo { getDiagAlgo ::
|
|
(Int -- the identifier for the algorithm
|
|
, [Diag]) -- the diagrams making up this algorithm
|
|
}
|
|
|
|
|
|
-- |Introspective data structure holding all algorithms for the
|
|
-- coordinate system.
|
|
diagAlgos :: [DiagAlgo]
|
|
diagAlgos =
|
|
[DiagAlgo (0, [coordPointsText, coordPoints, plotterBG])
|
|
,DiagAlgo (1, [convexHPText, convexHP, convexHLs, coordPoints, plotterBG])
|
|
,DiagAlgo (2, [polyLines, coordPointsText, coordPoints, plotterBG])
|
|
,DiagAlgo (3, [polyIntersectionText, polyIntersection,
|
|
coordPoints, polyLines, plotterBG])
|
|
,DiagAlgo (4, [quadPathSquare, squares, coordPointsText,
|
|
coordPoints, plotterBG])
|
|
,DiagAlgo (5, [kdRange, kdSquares, coordPointsText, coordPoints, plotterBG])
|
|
,DiagAlgo (6, [monotonePolys, coordPointsText, polyTriCategorizedPoints,
|
|
plotterBG])]
|
|
|
|
|
|
-- |Introspective data structure holding all algorithms for the
|
|
-- tree view.
|
|
diagTreAlgos :: [DiagAlgo]
|
|
diagTreAlgos =
|
|
[DiagAlgo (4, [treePretty])
|
|
,DiagAlgo (5, [kdTreeDiag])]
|
|
|
|
|
|
-- |Create the Diagram from the points.
|
|
diag :: DiagProp -> [DiagAlgo] -> [[P2 Double]] -> Diagram Cairo
|
|
diag p das vts = maybe mempty (\x -> mkDiag x p vts)
|
|
$ mconcat
|
|
-- get the actual [Diag] array
|
|
<$> (snd . getDiagAlgo)
|
|
-- find the correct element from the [DiagAlgo] list
|
|
-- which corresponds to the algorithm from DiagProp
|
|
<$> find ((==) (algo p) . fst . getDiagAlgo) das
|
|
|
|
|
|
-- |Create the Diagram from a String which is supposed to be the contents
|
|
-- of an obj file.
|
|
diagS :: DiagProp -> B.ByteString -> Diagram Cairo
|
|
diagS p mesh =
|
|
diag p diagAlgos
|
|
. fmap (filterValidPT p)
|
|
. (\x -> if null x then [meshToArr mesh] else x)
|
|
. facesToArr
|
|
$ mesh
|
|
|
|
|
|
-- |Create the tree diagram from a String which is supposed to be the contents
|
|
-- of an obj file.
|
|
diagTreeS :: DiagProp -> B.ByteString -> Diagram Cairo
|
|
diagTreeS p mesh =
|
|
diag p diagTreAlgos
|
|
. fmap (filterValidPT p)
|
|
. (\x -> if null x then [meshToArr mesh] else x)
|
|
. facesToArr
|
|
$ mesh
|
|
|