How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.
libigl is a C++ geometry processing library used for analyzing and manipulating 3D triangle and tetrahedral meshes. It functions as a numerical linear algebra suite and a mesh manipulation framework, integrating a geometric deformation engine to implement rigid and polyharmonic transformations.
The main features of libigl/libigl are: Geometry Processing Libraries, Surface and Volume Meshes, Finite Element Operators, Boolean Mesh Operations, Constrained Delaunay Triangulations, Rigid-As-Possible Deformations, Mesh Exporters, Mesh Manipulation Toolkits.
Projects with overlapping indexed features include: nmwsharp/geometry-central — Geometry-central is a C++ framework designed for 3D geometry processing, surface analysis, and numerical computation.… scenario-labs/skills — This repository is a collection of installable agent skills that connect AI coding assistants to the Scenario… reference-lapack/lapack — LAPACK is a comprehensive library of Fortran routines designed for high-performance numerical analysis and linear… openmathlib/openblas — OpenBLAS is a high-performance implementation of the Basic Linear Algebra Subprograms standard designed for numerical… habrador/computational-geometry — This project provides a collection of algorithmic implementations for computational geometry, focusing on spatial… joelgrus/data-science-from-scratch — This project is a collection of foundational machine learning algorithms and data science tools implemented in Python.…
Geometry-central is a C++ framework designed for 3D geometry processing, surface analysis, and numerical computation. It provides a foundational toolkit for performing discrete differential geometry operations on manifold surface meshes, enabling the analysis and manipulation of complex 3D structures. The library distinguishes itself through its support for intrinsic triangulation processing, which allows for the execution of geometric algorithms independently of vertex positions to maintain stability under deformation. It utilizes a half-edge mesh representation to facilitate constant-time t
This repository is a collection of installable agent skills that connect AI coding assistants to the Scenario generation server and to expert 3D and game-engine tools. The skills cover generating and editing images, video, audio, and 3D assets, and driving Blender, Maya, ZBrush, Unity, Unreal Engine, Godot, and Roblox through scripted workflows. Each skill is a self-contained instruction file with metadata, installed into many coding assistants through a shared open format. What defines the skills is how they run generation and tool work. Models are discovered through a standard tool protocol
OpenBLAS is a high-performance implementation of the Basic Linear Algebra Subprograms standard designed for numerical computing and matrix operations. It serves as a hardware-accelerated numerical library and optimized math kernel library, providing a computational engine for large-scale matrix multiplication and vector operations. The library distinguishes itself through the use of hand-tuned assembly kernels and SIMD instruction mapping, such as AVX and SVE, to maximize floating-point performance on specific CPU architectures. It features a multi-threaded framework that manages parallel exe
LAPACK is a comprehensive library of Fortran routines designed for high-performance numerical analysis and linear algebra. It serves as a foundational scientific computing framework, providing standardized procedures for solving systems of linear equations, eigenvalue problems, and least squares approximations. The library distinguishes itself through a hierarchical routine abstraction that organizes mathematical operations into distinct levels of complexity. It utilizes block-partitioned matrix algorithms and a column-major memory layout to optimize data locality and hardware efficiency. By