Módulo Node.js para execução de sub-rotinas de processamento do algoritmo Cloud Partitioning for Iterative Closest Point (CP-ICP).

Ultra fast DFT scan stitching partition generator. Amortized O(N) complexity

file name will reveal per se.

Dynamic square matrix multiplication program using C and MPI.

Header-Only-Library providing functions that perform parallel in-place Partitioning, Quickselect and Quicksort

massively parallel geophysics distributed mesh generator

Heuristic Algorithms for Number Partitioning

✂️ Simple C++ program to perform line-based partitioning of files.

Verlet particle simulator that uses spatial grid partitioning for more optimized collision detection.

PSML: parallel system modeling and simulation language for electronic system level

University of Pittsburgh ECE 0302

Image partitioning (color/gray/multichannel) based on the piecewise affine-linear Mumford-Shah model (aka the affine-linear Potts model)

Multiway Parallel Quicksort (MPQsort) is a fast implementation of parallel in-place Quicksort using OpenMP.

Implementation of hypergraph partitioning using MinMax streaming

Spatial cache data structures with python binding implementation.

A Parallel Graph Partitioning Approach designed to work on density-based clustering algorithms.

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

Tailor is a spatially load balancing flow solver which can operate on three-dimensional moving overset meshes.