Skip to content
@iShape-Rust

iShape-Rust

Pinned

  1. iShape-js iShape-js Public

    A poly-bool library supports main operations such as union, intersection, difference, xor, and self-intersection by the even-odd rule. This algorithm is based on Vatti clipping ideas but is an orig…

    JavaScript 3

  2. iOverlay iOverlay Public

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

    Rust 9 1

  3. iTriangle iTriangle Public

    A fast and efficient library for Delaunay triangulation and converting complex polygons into convex shapes, including advanced self-intersection resolution.

    Rust 2 1

Repositories

Showing 8 of 8 repositories
  • iComputation Public

    iComputation is a Rust library that makes GPU computations easy using wgpu. It provides a sugar API and a common pipeline for computational tasks, focusing solely on computation without rendering. Ideal for developers seeking efficient, computation-focused GPU operations.

    Rust 0 MIT 0 0 0 Updated Jun 11, 2024
  • iOverlay Public

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

    Rust 9 MIT 1 0 0 Updated May 27, 2024
  • iOverlayPerformance Public

    Performance test app for iOverlay

    Makefile 0 MIT 0 0 0 Updated May 24, 2024
  • iTriangle Public

    A fast and efficient library for Delaunay triangulation and converting complex polygons into convex shapes, including advanced self-intersection resolution.

    Rust 2 MIT 1 0 0 Updated May 24, 2024
  • iFloat Public

    This fixed float math library provides an efficient and deterministic solution for arithmetic and geometric operations.

    Rust 2 MIT 0 0 0 Updated May 24, 2024
  • iShape Public

    iShape is a compact and efficient library specifically designed for representing 2D data structures using FixVec.

    Rust 1 MIT 0 0 0 Updated May 19, 2024
  • iShape-js Public

    A poly-bool library supports main operations such as union, intersection, difference, xor, and self-intersection by the even-odd rule. This algorithm is based on Vatti clipping ideas but is an original implementation.

    JavaScript 3 MIT 0 0 0 Updated May 14, 2024
  • iTree Public

    Red-black tree implementation for rust

    Rust 0 MIT 0 0 0 Updated May 13, 2024

Top languages

Loading…

Most used topics

Loading…