Point package:diagrams-lib

A handy wrapper to help distinguish points from vectors at the type level

Points in space. For more tools for working with points and vectors, see Linear.Affine.

A PointLight radiates uniformly in all directions from a given point.

Special functions for points in R2.

Create a "point diagram", which has no content, no trace, an empty query, and a point envelope.

Construct a Diagram with a single PointLight at the origin, which takes up no space.

pointAt about initial final produces a rotation which brings the direction initial to point in the direction final by first panning around about, then tilting about the axis perpendicular to about and final. In particular, if this can be accomplished without tilting, it will be, otherwise if only tilting is necessary, no panning will occur. The tilt will always be between ± 1/4 turn.

pointAt' has the same behavior as pointAt, but takes vectors instead of directions.

Get the center of a the bounding box of an enveloped object, return the origin for object with empty envelope.

Create a degenerate bounding "box" containing only a single point.

Create the smallest bounding box containing all the given points.

Get the center of a the bounding box of an enveloped object, return Nothing for object with empty envelope.

Curried version of position, takes a list of points and a list of objects.

Attach an atomic name to a certain point (which may be computed from the given diagram), treated as a subdiagram with no content and a point envelope.

Create a "point subdiagram", that is, a pointDiagram (with no content and a point envelope) treated as a subdiagram with local origin at the given point. Note this is not the same as mkSubdiagram . pointDiagram, which would result in a subdiagram with local origin at the parent origin, rather than at the given point.

Extract the points of a path, resulting in a separate list of points for each component trail. Here a point is any place where two segments join; see also pathVertices and trailPoints. This function allows you "observe" the fact that trails are implemented as lists of segments, which may be problematic if we want to think of trails as parametric vector functions. This also means that the behavior of this function may not be stable under future changes to the implementation of trails and paths. For an unproblematic version which only yields vertices at which there is a sharp corner, excluding points differentiable points, see pathVertices. This function is not re-exported from Diagrams.Prelude; to use it, import Diagrams.Path.

Extract the segment join points of a concretely located line. See trailPoints for more information. This function allows you "observe" the fact that lines are implemented as lists of segments, which may be problematic if we want to think of lines as parametric vector functions. This also means that the behavior of this function may not be stable under future changes to the implementation of trails. For an unproblematic version which only yields vertices at which there is a sharp corner, excluding points where the trail is differentiable, see lineVertices. This function is not re-exported from Diagrams.Prelude; to use it, import Diagrams.Trail.

Extract the segment join points of a concretely located loop. Note that the initial vertex is not repeated at the end. See trailPoints for more information. This function allows you "observe" the fact that lines are implemented as lists of segments, which may be problematic if we want to think of lines as parametric vector functions. This also means that the behavior of this function may not be stable under future changes to the implementation of trails. For an unproblematic version which only yields vertices at which there is a sharp corner, excluding points where the trail is differentiable, see lineVertices. This function is not re-exported from Diagrams.Prelude; to use it, import Diagrams.Trail.

Extract the points of a concretely located trail, i.e. the points where one segment ends and the next begins. Note that for loops, the starting point will not be repeated at the end. If you want this behavior, you can use cutTrail to make the loop into a line first, which happens to repeat the same point at the start and end, e.g. with trailPoints . mapLoc cutTrail. Note that it does not make sense to ask for the points of a Trail by itself; if you want the points of a trail with the first point at, say, the origin, you can use trailPoints . (`at` origin). This function allows you "observe" the fact that trails are implemented as lists of segments, which may be problematic if we want to think of trails as parametric vector functions. This also means that the behavior of this function may not be stable under future changes to the implementation of trails. For an unproblematic version which only yields vertices at which there is a sharp corner, excluding points where the trail is differentiable, see trailVertices. This function is not re-exported from Diagrams.Prelude; to use it, import Diagrams.Trail.

Find the intersect points of two objects that can be converted to a path.