module Waterfall.BoundingBox.AxisAligned
( axisAlignedBoundingBox
, aabbToSolid
) where
import Waterfall.Internal.Solid(Solid, acquireSolid)
import Waterfall.Internal.Finalizers (unsafeFromAcquire)
import Waterfall.Internal.FromOpenCascade (gpPntToV3)
import Waterfall.Solids (box, volume)
import Waterfall.Transforms (translate)
import Linear (V3 (..), (^-^))
import qualified OpenCascade.Bnd.Box as Bnd.Box
import qualified OpenCascade.BRepBndLib as BRepBndLib
import Control.Monad.IO.Class (liftIO)
axisAlignedBoundingBox :: Solid -> Maybe (V3 Double, V3 Double)
axisAlignedBoundingBox :: Solid -> Maybe (V3 Double, V3 Double)
axisAlignedBoundingBox Solid
s =
if Solid -> Double
volume Solid
s Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
<= Double
0
then Maybe (V3 Double, V3 Double)
forall a. Maybe a
Nothing
else (V3 Double, V3 Double) -> Maybe (V3 Double, V3 Double)
forall a. a -> Maybe a
Just ((V3 Double, V3 Double) -> Maybe (V3 Double, V3 Double))
-> (Acquire (V3 Double, V3 Double) -> (V3 Double, V3 Double))
-> Acquire (V3 Double, V3 Double)
-> Maybe (V3 Double, V3 Double)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Acquire (V3 Double, V3 Double) -> (V3 Double, V3 Double)
forall a. Acquire a -> a
unsafeFromAcquire (Acquire (V3 Double, V3 Double) -> Maybe (V3 Double, V3 Double))
-> Acquire (V3 Double, V3 Double) -> Maybe (V3 Double, V3 Double)
forall a b. (a -> b) -> a -> b
$ do
solid <- Solid -> Acquire (Ptr Shape)
acquireSolid Solid
s
theBox <- Bnd.Box.new
liftIO $ BRepBndLib.addOptimal solid theBox True False
p1 <- liftIO . gpPntToV3 =<< Bnd.Box.cornerMin theBox
p2 <- liftIO . gpPntToV3 =<< Bnd.Box.cornerMax theBox
return (p1, p2)
aabbToSolid :: (V3 Double, V3 Double)
-> Solid
aabbToSolid :: (V3 Double, V3 Double) -> Solid
aabbToSolid (V3 Double
lo, V3 Double
hi) = V3 Double -> Solid -> Solid
forall a. Transformable a => V3 Double -> a -> a
translate V3 Double
lo (Solid -> Solid) -> Solid -> Solid
forall a b. (a -> b) -> a -> b
$ V3 Double -> Solid
box (V3 Double
hi V3 Double -> V3 Double -> V3 Double
forall a. Num a => V3 a -> V3 a -> V3 a
forall (f :: * -> *) a. (Additive f, Num a) => f a -> f a -> f a
^-^ V3 Double
lo)