Skip to content

Examples

  • Circle Packing — Pack circles of given radii to minimize overlap and overall bounding box size, without any nesting or graph structure.
  • Optimization for layered graph layouts — import pathlib
  • Rectangle Packing — Pack rectangles of given sizes to minimize overlap and overall bounding box area.
  • Soft interval overlap for collision losses — In gradient-based layout optimization, collision between shapes can be penalized by measuring how much their bounding intervals overlap. The overlap between two 1D intervals is min(r1, r2) - max(l1, l2), clamped to zero.
  • Enclosing radially convex set — Given a set of circles in the plane, let us find a star-shaped (radially convex) region that encloses all of them while minimizing a weighted sum of area and perimeter.