Algorithms.Geometry.SmallestEnclosingBall

Types to represent the smallest enclosing disk of a set of points in \(\mathbb{R}^2\)

Documentation

data DiskResult p r

The result of a smallest enclosing disk computation: The smallest ball and the points defining it

Constructors

DiskResult

Fields

• _enclosingDisk :: Disk () r
• _definingPoints :: TwoOrThree (Point 2 r :+ p)

Instances

(Eq r, Eq p) => Eq (DiskResult p r)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

(==) :: DiskResult p r -> DiskResult p r -> Bool

(/=) :: DiskResult p r -> DiskResult p r -> Bool

(Show r, Show p) => Show (DiskResult p r)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

showsPrec :: Int -> DiskResult p r -> ShowS

show :: DiskResult p r -> String

showList :: [DiskResult p r] -> ShowS

enclosingDisk :: forall p r. Lens' (DiskResult p r) (Disk () r)

definingPoints :: forall p r p. Lens (DiskResult p r) (DiskResult p r) (TwoOrThree ((:+) (Point 2 r) p)) (TwoOrThree ((:+) (Point 2 r) p))

data TwoOrThree a

List of two or three elements

Constructors

Two !a !a

Three !a !a !a

Instances

Functor TwoOrThree

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

fmap :: (a -> b) -> TwoOrThree a -> TwoOrThree b

(<$) :: a -> TwoOrThree b -> TwoOrThree a

Foldable TwoOrThree

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

fold :: Monoid m => TwoOrThree m -> m

foldMap :: Monoid m => (a -> m) -> TwoOrThree a -> m

foldMap' :: Monoid m => (a -> m) -> TwoOrThree a -> m

foldr :: (a -> b -> b) -> b -> TwoOrThree a -> b

foldr' :: (a -> b -> b) -> b -> TwoOrThree a -> b

foldl :: (b -> a -> b) -> b -> TwoOrThree a -> b

foldl' :: (b -> a -> b) -> b -> TwoOrThree a -> b

foldr1 :: (a -> a -> a) -> TwoOrThree a -> a

foldl1 :: (a -> a -> a) -> TwoOrThree a -> a

toList :: TwoOrThree a -> [a]

null :: TwoOrThree a -> Bool

length :: TwoOrThree a -> Int

elem :: Eq a => a -> TwoOrThree a -> Bool

maximum :: Ord a => TwoOrThree a -> a

minimum :: Ord a => TwoOrThree a -> a

sum :: Num a => TwoOrThree a -> a

product :: Num a => TwoOrThree a -> a

Eq a => Eq (TwoOrThree a)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

(==) :: TwoOrThree a -> TwoOrThree a -> Bool

(/=) :: TwoOrThree a -> TwoOrThree a -> Bool

Ord a => Ord (TwoOrThree a)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

compare :: TwoOrThree a -> TwoOrThree a -> Ordering

(<) :: TwoOrThree a -> TwoOrThree a -> Bool

(<=) :: TwoOrThree a -> TwoOrThree a -> Bool

(>) :: TwoOrThree a -> TwoOrThree a -> Bool

(>=) :: TwoOrThree a -> TwoOrThree a -> Bool

max :: TwoOrThree a -> TwoOrThree a -> TwoOrThree a

min :: TwoOrThree a -> TwoOrThree a -> TwoOrThree a

Read a => Read (TwoOrThree a)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

readsPrec :: Int -> ReadS (TwoOrThree a)

readList :: ReadS [TwoOrThree a]

readPrec :: ReadPrec (TwoOrThree a)

readListPrec :: ReadPrec [TwoOrThree a]

Show a => Show (TwoOrThree a)

Defined in Algorithms.Geometry.SmallestEnclosingBall.Types

Methods

showsPrec :: Int -> TwoOrThree a -> ShowS

show :: TwoOrThree a -> String

showList :: [TwoOrThree a] -> ShowS

twoOrThreeFromList :: [a] -> Either String (TwoOrThree a)

Construct datatype from list with exactly two or three elements.