Data.Geometry.Properties

Documentation

type family Dimension t :: Nat

A type family for types that are associated with a dimension. The dimension is the dimension of the geometry they are embedded in.

Instances

type Dimension (Boundary g)

type Dimension (Boundary g) = Dimension g

type Dimension (Image r)

type Dimension (Image r) = 2

type Dimension (IpeSymbol r)

type Dimension (IpeSymbol r) = 2

type Dimension (MiniPage r)

type Dimension (MiniPage r) = 2

type Dimension (TextLabel r)

type Dimension (TextLabel r) = 2

type Dimension (PathSegment r)

type Dimension (PathSegment r) = 2

type Dimension (Path r)

type Dimension (Path r) = 2

type Dimension (IpeObject r)

type Dimension (IpeObject r) = 2

type Dimension (Group r)

type Dimension (Group r) = 2

type Dimension (Interval a r)

type Dimension (Interval a r) = 1

type Dimension (Point d r)

type Dimension (Point d r) = d

type Dimension (Line d r)

type Dimension (Line d r) = d

type Dimension (HalfLine d r)

type Dimension (HalfLine d r) = d

type Dimension (ConvexPolygon p r)

type Dimension (ConvexPolygon p r) = 2

type Dimension (Triangle p r)

type Dimension (Triangle p r) = 2

type Dimension (SubLine d p r)

type Dimension (SubLine d p r) = d

type Dimension (Box d p r)

type Dimension (Box d p r) = d

type Dimension (LineSegment d p r)

type Dimension (LineSegment d p r) = d

type Dimension (Ball d p r)

type Dimension (Ball d p r) = d

type Dimension (PolyLine d p r)

type Dimension (PolyLine d p r) = d

type Dimension (Polygon t p r)

type Dimension (Polygon t p r) = 2

type family NumType t :: *

A type family for types that have an associated numeric type.

Instances

type NumType (Range a)

type NumType (Range a) = a

type NumType (Boundary g)

type NumType (Boundary g) = NumType g

type NumType (Image r)

type NumType (Image r) = r

type NumType (IpeSymbol r)

type NumType (IpeSymbol r) = r

type NumType (MiniPage r)

type NumType (MiniPage r) = r

type NumType (TextLabel r)

type NumType (TextLabel r) = r

type NumType (PathSegment r)

type NumType (PathSegment r) = r

type NumType (Path r)

type NumType (Path r) = r

type NumType (IpeObject r)

type NumType (IpeObject r) = r

type NumType (Group r)

type NumType (Group r) = r

type NumType (I a)

type NumType (I a) = NumType a

type NumType (Interval a r)

type NumType (Interval a r) = r

type NumType (Point d r)

type NumType (Point d r) = r

type NumType (Line d r)

type NumType (Line d r) = r

type NumType (Transformation d r)

type NumType (Transformation d r) = r

type NumType (HalfLine d r)

type NumType (HalfLine d r) = r

type NumType (ConvexPolygon p r)

type NumType (ConvexPolygon p r) = r

type NumType (Triangle p r)

type NumType (Triangle p r) = r

type NumType (SubLine d p r)

type NumType (SubLine d p r) = r

type NumType (Box d p r)

type NumType (Box d p r) = r

type NumType (LineSegment d p r)

type NumType (LineSegment d p r) = r

type NumType (Ball d p r)

type NumType (Ball d p r) = r

type NumType (PolyLine d p r)

type NumType (PolyLine d p r) = r

type NumType (Polygon t p r)

type NumType (Polygon t p r) = r

type NumType (PlaneGraph k s w v e f r)

type NumType (PlaneGraph k s w v e f r) = r

data NoIntersection

A simple data type expressing that there are no intersections

Constructors

NoIntersection

Instances

Eq NoIntersection

Methods

(==) :: NoIntersection -> NoIntersection -> Bool

(/=) :: NoIntersection -> NoIntersection -> Bool

Ord NoIntersection

Methods

compare :: NoIntersection -> NoIntersection -> Ordering

(<) :: NoIntersection -> NoIntersection -> Bool

(<=) :: NoIntersection -> NoIntersection -> Bool

(>) :: NoIntersection -> NoIntersection -> Bool

(>=) :: NoIntersection -> NoIntersection -> Bool

max :: NoIntersection -> NoIntersection -> NoIntersection

min :: NoIntersection -> NoIntersection -> NoIntersection

Read NoIntersection

Methods

readsPrec :: Int -> ReadS NoIntersection

readList :: ReadS [NoIntersection]

readPrec :: ReadPrec NoIntersection

readListPrec :: ReadPrec [NoIntersection]

Show NoIntersection

Methods

showsPrec :: Int -> NoIntersection -> ShowS

show :: NoIntersection -> String

showList :: [NoIntersection] -> ShowS

type Intersection g h = CoRec Identity (IntersectionOf g h)

The result of interesecting two geometries is a CoRec,

type family IntersectionOf g h :: [*]

The type family specifying the list of possible result types of an intersection.

Instances

type IntersectionOf (Range a) (Range a)

type IntersectionOf (Range a) (Range a) = (:) * NoIntersection ((:) * (Range a) ([] *))

type IntersectionOf (Line 2 r) (Boundary (Rectangle p r))

type IntersectionOf (Line 2 r) (Boundary (Rectangle p r)) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (Point 2 r, Point 2 r) ((:) * (LineSegment 2 () r) ([] *))))

type IntersectionOf (Interval a r) (Interval a r)

type IntersectionOf (Interval a r) (Interval a r) = (:) * NoIntersection ((:) * (Interval a r) ([] *))

type IntersectionOf (Line 2 r) (Line 2 r)

type IntersectionOf (Line 2 r) (Line 2 r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (Line 2 r) ([] *)))

type IntersectionOf (Line 2 r) (Rectangle p r)

type IntersectionOf (Line 2 r) (Rectangle p r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (LineSegment 2 () r) ([] *)))

type IntersectionOf (Line 2 r) (Circle p r)

type IntersectionOf (Line 2 r) (Circle p r) = (:) * NoIntersection ((:) * (Touching (Point 2 r)) ((:) * (Point 2 r, Point 2 r) ([] *)))

type IntersectionOf (HalfLine 2 r) (HalfLine 2 r)

type IntersectionOf (HalfLine 2 r) (HalfLine 2 r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (LineSegment 2 () r) ((:) * (HalfLine 2 r) ([] *))))

type IntersectionOf (HalfLine 2 r) (Line 2 r)

type IntersectionOf (HalfLine 2 r) (Line 2 r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (HalfLine 2 r) ([] *)))

type IntersectionOf (Point d r) (Box d p r)

type IntersectionOf (Point d r) (Box d p r) = (:) * NoIntersection ((:) * (Point d r) ([] *))

type IntersectionOf (Line 2 r) (Slab o a r)

type IntersectionOf (Line 2 r) (Slab o a r) = (:) * NoIntersection ((:) * (Line 2 r) ((:) * (LineSegment 2 a r) ([] *)))

type IntersectionOf (HalfLine 2 r) (LineSegment 2 p r)

type IntersectionOf (HalfLine 2 r) (LineSegment 2 p r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (LineSegment 2 () r) ([] *)))

type IntersectionOf (LineSegment 2 p r) (Line 2 r)

type IntersectionOf (LineSegment 2 p r) (Line 2 r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (LineSegment 2 p r) ([] *)))

type IntersectionOf (LineSegment 2 p r) (Circle q r)

type IntersectionOf (LineSegment 2 p r) (Circle q r) = (:) * NoIntersection ((:) * (Touching (Point 2 r)) ((:) * (Point 2 r) ((:) * (Point 2 r, Point 2 r) ([] *))))

type IntersectionOf (SubLine 2 p r) (SubLine 2 q r)

type IntersectionOf (SubLine 2 p r) (SubLine 2 q r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (SubLine 2 p r) ([] *)))

type IntersectionOf (SubLine 2 p r) (Slab o a r)

type IntersectionOf (SubLine 2 p r) (Slab o a r) = (:) * NoIntersection ((:) * (SubLine 2 () r) ([] *))

type IntersectionOf (Box d p r) (Box d q r)

type IntersectionOf (Box d p r) (Box d q r) = (:) * NoIntersection ((:) * (Box d () r) ([] *))

type IntersectionOf (LineSegment 2 p r) (LineSegment 2 p r)

type IntersectionOf (LineSegment 2 p r) (LineSegment 2 p r) = (:) * NoIntersection ((:) * (Point 2 r) ((:) * (LineSegment 2 p r) ([] *)))

type IntersectionOf (Slab o a r) (Slab o a r)

type IntersectionOf (Slab o a r) (Slab o a r) = (:) * NoIntersection ((:) * (Slab o a r) ([] *))

type IntersectionOf (Slab Horizontal a r) (Slab Vertical a r)

type IntersectionOf (Slab Horizontal a r) (Slab Vertical a r) = (:) * (Rectangle (a, a) r) ([] *)

coRec :: a ∈ as => a -> CoRec Identity as

Helper to produce a corec

class IsIntersectableWith g h where

Minimal complete definition

intersect, nonEmptyIntersection

Methods

intersect :: g -> h -> Intersection g h

intersects :: g -> h -> Bool

g intersects h = The intersection of g and h is non-empty.

The default implementation computes the intersection of g and h, and uses nonEmptyIntersection to determine if the intersection is non-empty.

nonEmptyIntersection :: proxy g -> proxy h -> Intersection g h -> Bool

Helper to implement intersects.

nonEmptyIntersection :: (NoIntersection ∈ IntersectionOf g h, RecApplicative (IntersectionOf g h)) => proxy g -> proxy h -> Intersection g h -> Bool

Helper to implement intersects.

Instances

Ord a => IsIntersectableWith (Range a) (Range a)

Methods

intersect :: Range a -> Range a -> Intersection (Range a) (Range a)

intersects :: Range a -> Range a -> Bool

nonEmptyIntersection :: proxy (Range a) -> proxy (Range a) -> Intersection (Range a) (Range a) -> Bool

Ord r => IsIntersectableWith (Interval a r) (Interval a r)

Methods

intersect :: Interval a r -> Interval a r -> Intersection (Interval a r) (Interval a r)

intersects :: Interval a r -> Interval a r -> Bool

nonEmptyIntersection :: proxy (Interval a r) -> proxy (Interval a r) -> Intersection (Interval a r) (Interval a r) -> Bool

(Eq r, Fractional r) => IsIntersectableWith (Line 2 r) (Line 2 r)

Methods

intersect :: Line 2 r -> Line 2 r -> Intersection (Line 2 r) (Line 2 r)

intersects :: Line 2 r -> Line 2 r -> Bool

nonEmptyIntersection :: proxy (Line 2 r) -> proxy (Line 2 r) -> Intersection (Line 2 r) (Line 2 r) -> Bool

(Ord r, Floating r) => IsIntersectableWith (Line 2 r) (Circle p r)

Methods

intersect :: Line 2 r -> Circle p r -> Intersection (Line 2 r) (Circle p r)

intersects :: Line 2 r -> Circle p r -> Bool

nonEmptyIntersection :: proxy (Line 2 r) -> proxy (Circle p r) -> Intersection (Line 2 r) (Circle p r) -> Bool

(Arity d, Ord r) => IsIntersectableWith (Point d r) (Box d p r)

Methods

intersect :: Point d r -> Box d p r -> Intersection (Point d r) (Box d p r)

intersects :: Point d r -> Box d p r -> Bool

nonEmptyIntersection :: proxy (Point d r) -> proxy (Box d p r) -> Intersection (Point d r) (Box d p r) -> Bool

(Fractional r, Ord r, HasBoundingLines o) => IsIntersectableWith (Line 2 r) (Slab o a r)

Methods

intersect :: Line 2 r -> Slab o a r -> Intersection (Line 2 r) (Slab o a r)

intersects :: Line 2 r -> Slab o a r -> Bool

nonEmptyIntersection :: proxy (Line 2 r) -> proxy (Slab o a r) -> Intersection (Line 2 r) (Slab o a r) -> Bool

(Ord r, Fractional r) => IsIntersectableWith (LineSegment 2 p r) (Line 2 r)

Methods

intersect :: LineSegment 2 p r -> Line 2 r -> Intersection (LineSegment 2 p r) (Line 2 r)

intersects :: LineSegment 2 p r -> Line 2 r -> Bool

nonEmptyIntersection :: proxy (LineSegment 2 p r) -> proxy (Line 2 r) -> Intersection (LineSegment 2 p r) (Line 2 r) -> Bool

(Ord r, Floating r) => IsIntersectableWith (LineSegment 2 p r) (Circle q r)

Methods

intersect :: LineSegment 2 p r -> Circle q r -> Intersection (LineSegment 2 p r) (Circle q r)

intersects :: LineSegment 2 p r -> Circle q r -> Bool

nonEmptyIntersection :: proxy (LineSegment 2 p r) -> proxy (Circle q r) -> Intersection (LineSegment 2 p r) (Circle q r) -> Bool

(Ord r, Fractional r) => IsIntersectableWith (SubLine 2 p r) (SubLine 2 p r)

Methods

intersect :: SubLine 2 p r -> SubLine 2 p r -> Intersection (SubLine 2 p r) (SubLine 2 p r)

intersects :: SubLine 2 p r -> SubLine 2 p r -> Bool

nonEmptyIntersection :: proxy (SubLine 2 p r) -> proxy (SubLine 2 p r) -> Intersection (SubLine 2 p r) (SubLine 2 p r) -> Bool

(Fractional r, Ord r, HasBoundingLines o) => IsIntersectableWith (SubLine 2 a r) (Slab o a r)

Methods

intersect :: SubLine 2 a r -> Slab o a r -> Intersection (SubLine 2 a r) (Slab o a r)

intersects :: SubLine 2 a r -> Slab o a r -> Bool

nonEmptyIntersection :: proxy (SubLine 2 a r) -> proxy (Slab o a r) -> Intersection (SubLine 2 a r) (Slab o a r) -> Bool

(Ord r, Arity d) => IsIntersectableWith (Box d p r) (Box d q r)

Methods

intersect :: Box d p r -> Box d q r -> Intersection (Box d p r) (Box d q r)

intersects :: Box d p r -> Box d q r -> Bool

nonEmptyIntersection :: proxy (Box d p r) -> proxy (Box d q r) -> Intersection (Box d p r) (Box d q r) -> Bool

(Ord r, Fractional r) => IsIntersectableWith (LineSegment 2 p r) (LineSegment 2 p r)

Methods

intersect :: LineSegment 2 p r -> LineSegment 2 p r -> Intersection (LineSegment 2 p r) (LineSegment 2 p r)

intersects :: LineSegment 2 p r -> LineSegment 2 p r -> Bool

nonEmptyIntersection :: proxy (LineSegment 2 p r) -> proxy (LineSegment 2 p r) -> Intersection (LineSegment 2 p r) (LineSegment 2 p r) -> Bool

Ord r => IsIntersectableWith (Slab o a r) (Slab o a r)

Methods

intersect :: Slab o a r -> Slab o a r -> Intersection (Slab o a r) (Slab o a r)

intersects :: Slab o a r -> Slab o a r -> Bool

nonEmptyIntersection :: proxy (Slab o a r) -> proxy (Slab o a r) -> Intersection (Slab o a r) (Slab o a r) -> Bool

IsIntersectableWith (Slab Horizontal a r) (Slab Vertical a r)

Methods

intersect :: Slab Horizontal a r -> Slab Vertical a r -> Intersection (Slab Horizontal a r) (Slab Vertical a r)

intersects :: Slab Horizontal a r -> Slab Vertical a r -> Bool

nonEmptyIntersection :: proxy (Slab Horizontal a r) -> proxy (Slab Vertical a r) -> Intersection (Slab Horizontal a r) (Slab Vertical a r) -> Bool

type AlwaysTrueIntersection g h = RecApplicative (IntersectionOf g h)

When using IntersectionOf we may need some constraints that are always true anyway.

defaultNonEmptyIntersection :: forall g h proxy. (NoIntersection ∈ IntersectionOf g h, RecApplicative (IntersectionOf g h)) => proxy g -> proxy h -> Intersection g h -> Bool

Returns True iff the result is *not* a NoIntersection

type family Union g h :: *

class IsUnionableWith g h where

Minimal complete definition

union

Methods

union :: g -> h -> Union g h