mikolalysenko/simplify-planar-graph
Simplifies a 2D polygonal region
Public GitHub Catalog
Discovered Sep 27, 2026
mikolalysenko / node-gcd
compute the greatest common divisor using euclid's algorithm
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#9951671GitHub System ID
mikolalysenkoOrganization / User
PublicVisibility
ActiveCatalog Status
More from mikolalysenko
mikolalysenko/vectorize-text
Turns a text string into a 2D poly line
mikolalysenko/zero-crossings
Finds all zero crossings in a 1D ndarray
mikolalysenko/surface-nets
Arbitrary dimensional level sets