You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Exact rectangle union area in Rust using an O(n log n) sweep-line algorithm, coordinate compression, and a segment tree. Includes deterministic generators, independent verification, SVG visualizations, and benchmarks.
An interactive SVG-based visualization engine demonstrating the O(N log N) optimization of the Longest Flat Subsequence problem using Segment Trees and Coordinate Compression.