Packing Cylinders into Cylindrical Containers

DOI10.2307/2688509zbMATH Open0192.28801OpenAlexW4231503232MaRDI QIDQ5586963FDOQ5586963

Authors: Sidney Kravitz 

Publication date: 1967

Full work available at URL: https://doi.org/10.2307/2688509

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Cited In (19)

• Analytical representation and efficient computation of the effective conductivity of two‐phase composite materials
• Title not available (Why is that?)
• Constrained circles packing test problems: all the optimal solutions known
• Packing 16, 17 or 18 circles in an equilateral triangle
• Packing equal circles into a circle with circular prohibited areas
• Quasi-physical global optimization method for solving the equal circle packing problem
• Dense packing of congruent circles in free-form non-convex containers
• Iterated dynamic thresholding search for packing equal circles into a circular container
• Disk packing for the estimation of the size of a wire bundle
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Phase field approach to optimal packing problems and related Cheeger clusters
• Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5
• Packing disks into disks with optimal worst-case density
• Densest packings of eleven congruent circles in a circle
• An approximation algorithm for locating maximal disks within convex polygons
• Reformulation descent applied to circle packing problems
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Dense packings of congruent circles in a circle
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container

This page was built for publication: Packing Cylinders into Cylindrical Containers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586963)