Covering a convex 3D polytope by a minimal number of congruent spheres (Q2931942): Difference between revisions

@@ Property / cites work @@
+Covering the crosspolytope by equal balls
@@ Property / cites work: Covering the crosspolytope by equal balls / rank @@
+Normal rank
@@ Property / cites work @@
+Solving circle packing problems by global optimization: numerical results and industrial applications
+Normal rank
@@ Property / cites work @@
+Covering an ellipsoid with equal balls
@@ Property / cites work: Covering an ellipsoid with equal balls / rank @@
+Normal rank
@@ Property / cites work @@
+Covering spheres with spheres
@@ Property / cites work: Covering spheres with spheres / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Cholesky factorization for interior point methods of linear programming
+Normal rank
@@ Property / cites work @@
+Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
+Normal rank
@@ Property / cites work @@
+Q5568974
@@ Property / cites work: Q5568974 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a compact polygonal set by identical circles
+Normal rank
@@ Property / cites work @@
+Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
+Normal rank
@@ Property / cites work @@
+Packing of unequal spheres and automated radiosurgical treatment planning
+Normal rank
@@ Property / cites work @@
+Q5665025
@@ Property / cites work: Q5665025 / rank @@
+Normal rank