Expand description
Two-dimensional geometry algorithms built on top of euclid
.
Structs§
- A convex polygon.
- A line between two points.
- A polygon.
Enums§
- The result of
Line::intersection
providing the intersection point between two line segments, if any. - The direction a point lies relative to a line. Returned by
Line::relative_direction_of
.
Functions§
- Find the center (mean) of a set of points.
- Are the given vertices in counter-clockwise order?
- Convenience function for creating lines.
- Sort the given
points
around the givenpivot
point in counter-clockwise order, starting from 12 o’clock.