zapollo

Brought to you by: mzerzan

Last Update: 2013-03-21

Constrained apollonian packing. Given radii {r(i)} and domain D, find the distribution of non-overlapping spheres of radii in {r(i)} in D which most completely fills the domain D (problem shows up in e.g. determining cement grain distributions)

Project Activity

See All Activity >

Follow zapollo

zapollo Web Site

Other Useful Business Software

Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.

Start Free

Rate This Project

User Reviews

Be the first to post a review of zapollo!

Additional Project Details

Registered

2006-01-05

Report inappropriate content

Recommended Projects

The Blue Obelisk Data Repository
The Blue Obelisk Data Repository lists many important chemoinformatics data such as element and isotope properties, atomic radii, etc. including references to original literature. Developers can use this repository to make their software interoperable.
Blur my Shell
Extension that adds a blur look to different parts of the GNOME Shell
GrainSizeTools script
A Python script for estimating the grain size from thin sections
EQ Sphere Partitions
The Recursive Zonal Equal Area (EQ) Sphere Partitioning Toolbox is a suite of Matlab functions for partitioning and point distribution on multidimensional spheres.
BondInfo
BondInfo - a program for interatomic distances analysis