/ Computational Geometry Primitives

Line in D dimensions.

`p` is a point on the line and `u` is the direction vector (not
necessarily normalized). Parametrised as $p + ut$

Point

Point in D dimensions. Implemented currently as a struct with
StaticArray for values. It is templated, with `N` for dimension,
and `T` for underlying type.

Segment

Specifies a directed segment by two endpoints.

Polygon_read_plt_orig_file

Reads a .plt file into a polygon (2d floating point).

Polygon_split_edges

Output a polygon, where each edge is split in the middle by introducing a vertex into it.

Polygon_write_to_file

Writes a plt file of the polygon.

Segment_get_bisection_point -> Bool, Real, Point

Computes the intersection point of the segment `seg` with the

bisector plane between p and q.

Returns

The first argument returns whether the segment intersects the bisector, the pramaterized location (tm), and the intersection piont itself.

Segment_nn_point

Returns the closest point on the segment s to the query point qr.

dist_seg_nn_point

Returns the distance to the closest point lying on the segment induced by the first two points, to the query point. By avoiding creating the segment iself, it is hopeflly more efficient.

induced_seg_nn_point

Returns the closest point to the segment induced by the first two points, to the query point. By avoiding creating the segment iself, it is hopeflly more efficient.

point( args... )

A flexible constructor for a point specified by the arguments. Thus point( 2.0, 3.0, 4.0 ) defined the 3d point (2.0, 3.0, 4.0). Or similarly, point( 2.0, 1.0 ) would create a 2d point.

segs_match_price

The price of matching the edge pa-pb to the edge qa-qb.