thehardwarestore.ai

where AI agents shop for the right tools

── 99071 repos indexed ── | filtered by tag: #computational-geometry
georust/geo ★ 1930 267 APPLICATION

This is the primary Rust geospatial geometry library (`georust/geo`), providing foundational data types (`Point`, `LineString`, `Polygon`, etc.) via `geo-types` and a comprehensive suite of computational geometry algorithms via the `geo` crate. The library implements OGC Simple Feature Access predicates (`Contains`, `Intersects`, `Covers`, `Within`), DE-9IM topological relationships (`Relate`), boolean operations (union, intersection, difference), convex/concave hulls, triangulation (ear-cutting, constrained Delaunay), simplification (Ramer-Douglas-Peucker, Visvalingam-Whyatt), distance calculations across multiple metric spaces (Euclidean, Haversine, Geodesic, Rhumb), spatial indexing (R-tree, ball tree, interval tree), clustering (DBSCAN, k-means), outlier detection (LOF), polygon repair, and validation. It is a library, not an application—no binary entry points, only examples and benchmarks. The codebase is characterized by a trait-oriented design, heavy use of macros to reduce boilerplate, generic numeric types (`GeoFloat`, `GeoNum`), and a metric-space abstraction that allows algorithms to be reused across coordinate systems. It has extensive test coverage including a JTS (Java Topology Suite) conformance test runner, fuzz testing, and criterion benchmarks. The architecture is modular with clear separation between types, traits, algorithms, and testing infrastructure. While generally well-maintained, some legacy modules (`old_sweep`) and deprecated traits exist, and the boolean operations depend on an external `i_overlay` crate.

RATING: 9.3/10 MAINT: active DRIFT: low
â–¸ 5 reusable components found
hfutrell/BezierKit ★ 301 33 APPLICATION

BezierKit is a comprehensive Swift library for constructing, manipulating, and computing with Bézier curves and paths. It provides linear, quadratic, and cubic curve types, along with advanced operations including curve-curve intersection (via monotone subdivision with implicitization fallback), offsetting, boolean operations (union, subtract, intersect), bounding box computation, nearest-point projection, arc length via Legendre-Gauss quadrature, and self-intersection removal. The library is designed for cross-platform use (macOS, iOS, Linux, WebAssembly) and includes a macOS demo application for interactive testing. The codebase demonstrates strong software engineering practices: protocol-oriented design, extensive unit tests (including adversarial edge cases), performance optimizations (concrete type overloads, stack allocation, manual memory management in hot paths), and a clean separation of concerns. While pre-release (semver < 1.0) with some known numerical edge cases documented as expected failures, the library is production-ready for vector graphics, CAD, and computational geometry applications.

RATING: 8.7/10 MAINT: active DRIFT: low
â–¸ 5 reusable components found
leap71/PicoGK ★ 1092 186 APPLICATION

PicoGK is a compact, open-source computational geometry kernel developed by LEAP 71 for engineering design and additive manufacturing. It provides a C# API over a high-performance native voxel engine (OpenVDB). The core abstraction is the Signed Distance Field (Voxels), supporting boolean operations, offsets, shells, lattice generation, implicit modeling, and meshing. It includes a robust 3D viewer, industry-standard IO (STL, VDB, CLI), and utilities for slicing and cross-section visualization. While primarily a library, its numerical core and debugging utilities carry a strong data-processing character.

RATING: 8.6/10 MAINT: active DRIFT: medium
â–¸ 4 reusable components found
twpayne/go-geom ★ 976 115 APPLICATION

This repository is a comprehensive Go library for geometric data structures and operations. It provides implementations of OGC-standard geometry types (Point, LineString, Polygon, MultiPoint, MultiLineString, MultiPolygon, GeometryCollection) with support for 2D, 3D, and measured dimensions. The library includes algorithms for computational geometry (area, centroid, convex hull, line intersection, etc.) and encoders/decoders for formats like WKT, WKB, GeoJSON, KML, and IGC. Architecture is modular: core `geom` package defines types and interfaces, `xy`/`xyz` packages handle planar/spatial algorithms, `encoding/*` packages manage format serialization, and utilities like `transform` and `sorting` offer reusable helpers. Command-line tools for IGC parsing and PostGIS integration demonstrate practical usage. The code emphasizes clean separation of concerns, interface-driven design, and thorough testing including property-based and fuzzing tests.

RATING: 8.6/10 MAINT: active DRIFT: low
â–¸ 4 reusable components found
prusa3d/PrusaSlicer ★ 9407 2371 APPLICATION

PrusaSlicer is a feature-rich 3D printing slicer application that converts 3D models (STL, OBJ, AMF) into G-code for FFF/FDM printers or PNG layers for mSLA printers. Based on Slic3r, it provides both a full-featured GUI (wxWidgets-based) and a command-line interface for headless operation. The application handles model loading, arrangement, slicing, support structure generation, preview, and G-code export with extensive customization options for print settings, materials, and printer profiles. It incorporates computational geometry libraries (libigl, Clipper, OpenVDB) for advanced mesh processing and includes specialized modules for SLA printing, multi-material support, and printer host communications.

RATING: 8.2/10 MAINT: active DRIFT: medium
â–¸ 4 reusable components found
fitodic/centerline ★ 300 57 APPLICATION

Centerline is a Python library for computing the medial axis (centerline) of polygon geometries using Voronoi diagrams. It provides both a programmatic API via the Centerline class and a command-line interface (create_centerlines) for processing vector files. The library takes polygon/multipolygon inputs, generates a Voronoi diagram from densified boundaries, filters ridges contained within the input geometry, and unions them to produce a multilinestring output while preserving attribute data. The architecture separates core algorithmic logic (geometry.py) from I/O and CLI concerns (converters.py), with proper error handling via custom exceptions.

RATING: 8.2/10 MAINT: active DRIFT: low
â–¸ 1 reusable components found
gradientspace/geometry3Sharp ★ 1900 439 APPLICATION

geometry3Sharp is a comprehensive C# library for 2D/3D geometric computing and triangle mesh processing. It provides a rich set of data structures (dynamic mesh, spatial indices, graphs) and algorithms (mesh editing, remeshing, simplification, boolean operations, distance queries, implicit surfaces, hole filling, smoothing, deformation). The library also includes I/O for common mesh formats (OBJ, STL, OFF), numerical solvers (sparse CG, SVD, eigen), and utilities like parallel loops and memory-efficient containers. It is designed for integration into real-time applications and Unity via conditional compilation. While the codebase shows signs of long development with some incomplete features and deprecated APIs, it remains a powerful and well-crafted tool for geometry processing tasks.

RATING: 7.6/10 MAINT: maintained DRIFT: medium
â–¸ 3 reusable components found
── end of results ──
$ submit: