Skip to content
View NailxSharipov's full-sized avatar
☘️
A little luck never hurts the code
☘️
A little luck never hurts the code
27 followers · 6 following

Achievements

Achievement: Pull Sharkx2Achievement: Starstruckx2Achievement: Arctic Code Vault Contributor

Achievements

Achievement: Pull Sharkx2Achievement: Starstruckx2Achievement: Arctic Code Vault Contributor

Organizations

@iShapeUnity @iShape-Swift @iShape-Rust

Block or report NailxSharipov

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
NailxSharipov/README.md

📫 Contact: nailxsharipov@gmail.com | LinkedIn

Rust enthusiast with love to solve complex math problems and making them run fast.

What I do:

  • High-Performance Algorithms: I focus on zero-allocation and cache-friendly code.
  • Robust Geometry: I prefer integer-based math to avoid floating-point errors.
  • EDA Experience: I've built verification engines (DRC) for microcircuit design using Rust and GDS data.

My Articles:

Pinned Loading

  1. iShape-Rust/iOverlay iShape-Rust/iOverlay Public

    Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.

    Rust 174 13

  2. iShape-Rust/iShape-js iShape-Rust/iShape-js Public

    A fast 2D geometry library in WebAssembly for JavaScript and TypeScript. Supports polygon boolean operations, buffering, and triangulation.

    JavaScript 43 1

  3. iShape-Rust/iTriangle iShape-Rust/iTriangle Public

    A fast, efficient and extremely stable 2d triangulation library for rust.

    Rust 136 8

  4. iShape-Rust/iKeySort iShape-Rust/iKeySort Public

    A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.

    Rust 2 2