Matches a specific keyword, which ensuring that it's not followed by a letter. This avoids cases like `generic_expression` being parsed as `generic`,

Overloaded version of nom's `char` that eats trailing whitespace

Overloaded version of nom's `tag` that eats trailing whitespace

Returns a parser which recognizes '(' p ')' with optional whitespace

Returns a parser for zero or more items p, delimited by c with whitespace

Insert a new Point-Edge pair into the hull, using a hint to save time searching for the new point's position.

Main entry function for the parser

For basis functions of order `p + 1`, finds the span in the knot vector that is relevant for position `u`. ALGORITHM A2.1

Advances the triangulation by one step. # Errors This may return [`Error::PointOnFixedEdge`], [`Error::NoMorePoints`], or [`Error::CrossingFixedEdge`

Returns a parser which runs `p` then consumes all whitespace

For a given point, returns the HullIndex which will be split when this point is inserted. Use `Hull::edge` to get the associated EdgeIndex.

Helper function to generate a `nom` error result

Returns all of the resulting triangles, as indexes into the original `points` array from the constructor.

Inner implementation of basis_funs

Sanity-checks invariants of the data structure, raising an assertion failure if an invariant is broken. This is a slow operation and should only be r

Checks whether the triangulation is done

Removes the given point from the hull

Returns the hull index associated with the given point

Runs the triangulation algorithm until completion # Errors This may return [`Error::PointOnFixedEdge`], [`Error::NoMorePoints`], or [`Error::Crossing

Writes the current state of the triangulation to an SVG file, including the upper hull as a debugging visualization.

Parses a STEP file from a raw array of bytes `data` must be preprocessed by [`strip_flatten`] first

Converts a point at position t onto the 3D line, using basis functions of order `p + 1` respectively. ALGORITHM A4.1

Toggles the lock sign of an edge and its buddy (if present) See discussion of [`Edge::sign`] for why this is signed, rather than a simple flag.

Looks up what bucket a given pseudo-angle will fall into.

Converts a point at position t onto the 3D line, using basis functions of order `p + 1` respectively. ALGORITHM A3.1

Links a new edge in the triangulation, copying the value of `fixed` from the old edge which is its buddy. This differs from [`Half::link`], which che

Converts a normalized mouse position into 3D

Parse a single attribute from a parameter list, consuming the trailing comma (if this is midway through the list) or close parens (at the end) The in

Lowers a 3D point on a specific surface into a 2D space defined by the surface type. This should only be called from `lower_verts`, to ensure that `p

Returns a pseudo-angle in the 0-1 range, without expensive trig functions The angle has the following shape: ```text 0.25 ^ y | | 0 |

Returns a matrix which compensates for window aspect ratio and clipping

Computes the relative scale of U and V, based on average distance between control points in 3D space

Checks that invariants of the algorithm are maintained. This is a slow operation and should only be used for debugging. # Panics Panics if invariants