Search Results for "packing"

...This project isn't limited to GLSL features. An extension system, based on the GLSL extension conventions, provides extended capabilities: matrix transformations, quaternions, data packing, random numbers, noise, etc. This library works perfectly with OpenGL but it also ensures interoperability with other third party libraries and SDK. It is a good candidate for software rendering (raytracing / rasterisation), image processing, physics simulations and any development context that requires a simple and convenient mathematics library. ...

Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....

Program was created for optimized packing of two dimensional rectangular elements at orthogonal table with main purpose of printing cutting sheets that can be used for cutting material at production in wood and panel furniture manufacturing. It is developed upon authors several years of experience at woodworking, and actual carpenters needs when such software is in question.

Estimates the maximum random close packing fraction of hard spheres with a distribution of diameters, based upon an algorithm in J. Chem. Phys. 131, 244104 (2009).

GUSEK provide an open source LP/MILP IDE for Win32, packing a custom version of the SciTE editor linked to the GLPK standalone solver.

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

...The project originated from the LIGGGHTS ecosystem and has been used in combination with CFDEM coupling workflows for particle-fluid simulations. It helps users study mechanical contact, particle motion, collision behavior, packing, flow, and equipment-scale granular processes. The software is especially relevant for engineering applications where macroscopic behavior emerges from many particle-level interactions. Its main value is providing a DEM simulation engine for researchers and engineers who need detailed particle-scale modeling in open-source workflows.

Maximum packing densities for individual, polydisperse (diameter), ellipitic platelets and stacks of them (max 5 platelets per stack implemented). Size fractionating for stacks (platelets with diameters below a cut-off diameter remain as individual platelets all others assemble in stacks) can be included. Considers only hard interactions and assumes spherical exclusion volumes.

It uses two different solutions: - placing of circles closest to the center from the largest to smallest, see brianshaler on github https://github.com/brianshaler/Circle-Packing-in-Processing - simulation "real" world with use of a Java Physics Engine JBox2D, see http://www.jbox2d.org

Software to identify cavities and crevices in proteins. The goal is to be able to take a protein structure, and to differentiate between five different types of environments for each residue: buried, surface, interfacial, cavity, or crevice.

A disk based production quality RTree based upon Guttman’s quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.

JOrigami is a collection of algorithms for computational origami. Some algorithms studied by computational origami does not have an implementation. JOrigami solves the famous and funny fold-and-cut using Demaine's disk packing implementation.