mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Numerical and mathematical computing
mesh-generator
mesh generation and adaptive refinement
Gmsh, Cubit
System
Techniques · 9
Primitives · 17
mesh-generator
B rep topology
geometry · medium: Boundary representation: solids as shells, faces, loops, edges and vertices with geometry attached
Delaunay triangulation
geometry · medium: Bowyer-Watson and incremental flips; maximizes minimum angles, dual of Voronoi
Nurbs
geometry · medium: B-splines and NURBS curves and surfaces: knot vectors, de Boor evaluation, knot insertion
Polygon tessellation
geometry · medium: Triangulate polygons with holes (ear clipping, earcut, monotone sweep)
Solid boolean operations
geometry · medium: Union, intersection and difference of solids: classify, split and merge faces robustly
Surface surface intersection
geometry · medium: Intersect parametric surfaces by marching with subdivision and Newton refinement
Voronoi diagrams
geometry · medium: Fortune sweep and jump flooding to compute Voronoi regions and distance fields
Exact geometric predicates
geometry · low: Robust orient and incircle tests with adaptive-precision floats (Shewchuk) or exact arithmetic
Half edge mesh
graphics · low: Half-edge mesh connectivity for editable polygon meshes
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
Quadtree octree
geometry · low: Adaptive spatial subdivision trees for queries and level of detail; loose and linear variants
R-tree
geometry · low: A balanced tree of nested bounding boxes that indexes rectangles and points, answering window and nearest-neighbour queries by pruning whole subtrees.
›
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Space filling curves
geometry · low: Z-order/Morton (geohash) and Hilbert curves mapping multi-dimensional points to sortable keys
Bézier curves
graphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Bounding volume hierarchy
physics · low: Binary tree of nested bounding boxes; prunes overlap and ray queries to O(log n) for any size distribution, and supports cheap insert/remove for moving objects.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
+ 2 more techniques
+ 1 more primitives
System
Techniques · 9
Primitives · 17
mesh-generator
B rep topology
geometry · medium: Boundary representation: solids as shells, faces, loops, edges and vertices with geometry attached
Delaunay triangulation
geometry · medium: Bowyer-Watson and incremental flips; maximizes minimum angles, dual of Voronoi
Nurbs
geometry · medium: B-splines and NURBS curves and surfaces: knot vectors, de Boor evaluation, knot insertion
Polygon tessellation
geometry · medium: Triangulate polygons with holes (ear clipping, earcut, monotone sweep)
Solid boolean operations
geometry · medium: Union, intersection and difference of solids: classify, split and merge faces robustly
Surface surface intersection
geometry · medium: Intersect parametric surfaces by marching with subdivision and Newton refinement
Voronoi diagrams
geometry · medium: Fortune sweep and jump flooding to compute Voronoi regions and distance fields
Graph partitioning
graphs · medium: Split a graph into k balanced parts with few edges between them; multilevel coarsen-partition-refine (METIS, KaHIP) for quality, streaming heuristics (LDG, Fennel) for one-pass scale.
›
Fill-reducing ordering
numerics · medium: Permute a sparse symmetric matrix before Cholesky/LU so the factor has few new nonzeros; minimum degree, nested dissection and RCM trade quality, speed and parallelism.
›
Exact geometric predicates
geometry · low: Robust orient and incircle tests with adaptive-precision floats (Shewchuk) or exact arithmetic
Half edge mesh
graphics · low: Half-edge mesh connectivity for editable polygon meshes
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
Quadtree octree
geometry · low: Adaptive spatial subdivision trees for queries and level of detail; loose and linear variants
R-tree
geometry · low: A balanced tree of nested bounding boxes that indexes rectangles and points, answering window and nearest-neighbour queries by pruning whole subtrees.
›
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Space filling curves
geometry · low: Z-order/Morton (geohash) and Hilbert curves mapping multi-dimensional points to sortable keys
Bézier curves
graphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Bounding volume hierarchy
physics · low: Binary tree of nested bounding boxes; prunes overlap and ray queries to O(log n) for any size distribution, and supports cheap insert/remove for moving objects.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
Copy for AI
Similar systems
Share the most building blocks with this one.
cad-kernel
48 %
mechanical-cad
20 %
multiphysics
19 %