Packing of unequal spheres and automated radiosurgical treatment planning
From MaRDI portal
Publication:1970338
DOI10.1023/A:1009831621621zbMath0958.90086MaRDI QIDQ1970338
Publication date: 18 April 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68R05: Combinatorics in computer science
90C39: Dynamic programming
92C50: Medical applications (general)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
05B40: Combinatorial aspects of packing and covering
Related Items
Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Packing congruent spheres into a multi‐connected polyhedral domain, STUDY OF THE UNEQUAL SPHERES PACKING PROBLEM: AN APPLICATION TO RADIOSURGERY TREATMENT, A literature review on circle and sphere packing problems: models and methodologies, Packing cylinders and rectangular parallelepipeds with distances between them into a given region, A local search-based method for sphere packing problems, Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D, Monte Carlo study of the sphere packing problem, Optimized packing multidimensional hyperspheres: a unified approach, Skeletonization for isocentre selection in Gamma Knife\(^\circledR\) Perfexion\(^{\text{TM}}\), Constraints in container loading -- a state-of-the-art review, Covering a convex 3D polytope by a minimal number of congruent spheres, Packing identical spheres into a cylinder, GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
