2D cross product for point-in-polygon winding test

* 1D squared Euclidean distance transform. * Uses lower envelope of parabolas algorithm. * Reads from `f`, writes result into `out`.

* Estimate the direction of travel at the end of a chain, accounting for curvature. * * Splits the lookback window into two halves (older and recent

* Find distance from a point to the nearest boundary point. * Uses brute-force search over boundary samples.

* Parse a percentage string like `"50%"` into a 0–1 fraction. Returns `null` * for non-percentage strings or unparseable input. Whitespace around the

Decompose a glyph into a body phase and an optional dot phase.

* Follow a branch from (cx,cy) through `start` for up to `steps` pixels * without modifying visited state. Returns the furthest point reached.

Render the engine at an absolute time (seconds) and return its backing canvas.

* Returns the props (including style) that should be applied to the container element, * plus the inner content tree rendered via a framework `crea

* Merge the `quality` JS property with `pixel-ratio` / `segment-size` / * `smoothing` attribute shortcuts. Attributes override properties on a *

Slugify the preview text into a safe-ish base filename.

* Gap distance between two axis-aligned bboxes (in bitmap units). Zero when * they overlap or touch.

* Draw a 1-pixel line between two points using Bresenham's algorithm.

* Looping CSS-keyframe variant. Each stroke draws via `stroke-dashoffset` on a * constant-width path, holds while the rest of the word finishes, fade

* Build a 256-entry lookup table for topology-preserving pixel removal. * Index is the 8-bit encoding of the 3×3 neighborhood (P2..P9 mapped to bits

* Flag short-and-isolated strokes as dots (priority -1) so word-level timeline * scheduling can defer them until after every body stroke in the word

* Single pass: find multi-pixel junction clusters and collapse each to one pixel. * Returns null if no clusters were found.

* Chamfer distance transform (2-pass, sqrt(2) diagonal cost). * Fast approximation that produces smooth gradients.

* Exact Euclidean distance transform using Felzenszwalb & Huttenlocher's algorithm. * Returns actual (non-squared) Euclidean distances.

* Contract edges shorter than `threshold` by merging their endpoints. * Keeps the endpoint with higher degree (more connections) to preserve topology

* Stream-decompress the bz2 dump via `bzcat` and count Hangul codepoint * frequencies. Streaming keeps the decompressed XML (hundreds of MB) out of

* Decode the KS X 1001 (Wansung / EUC-KR) Hangul region 0xB0A1–0xC8FE into its * 2,350 precomposed syllables, in the standard's fixed order. Derived

Render a single-point dot as a circle (round cap) or rect (butt/square cap).