IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v4y2000i4d10.1023_a1009889628489.html
   My bibliography  Save this article

Medial Axis and Optimal Locations for Min-Max Sphere Packing

Author

Listed:
  • Jie Wang

    (The University of North Carolina at Greensboro)

Abstract

We study the following min-max sphere packing problem originated from radiosurgical treatment planning using gamma knife (Bourland and Wu, 1996; Wu, 1996). Given an input (R, V), where R is a 3-dimensional (3D) bounded region and V a positive integer, find a packing of R using the minimum number of spheres (spheres may not be identical) such that the covered volume is at least V, and the number of points on the boundary of R touched by spheres is maximized. Bourland and Wu (1996) and Wu (1996), devised a greedy algorithm to solve the problem based on medial axis analysis. In particular, the algorithm places the center of each sphere on the medial axis of each subsequent region starting from R. While this approach has met with certain success, we show that medial axis does not always provide optimal locations for min-max sphere packing.

Suggested Citation

  • Jie Wang, 2000. "Medial Axis and Optimal Locations for Min-Max Sphere Packing," Journal of Combinatorial Optimization, Springer, vol. 4(4), pages 487-503, December.
    • Handle: RePEc:spr:jcomop:v:4:y:2000:i:4:d:10.1023_a:1009889628489
    DOI: 10.1023/A:1009889628489
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009889628489
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009889628489?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jie Wang, 1999. "Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 453-463, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Evgueniia Doudareva & Kimia Ghobadi & Dionne Aleman & Mark Ruschin & David Jaffray, 2015. "Skeletonization for isocentre selection in Gamma Knife® Perfexion™," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 369-385, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    2. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2024. "Packing spheres with quasi-containment conditions," Journal of Global Optimization, Springer, vol. 90(3), pages 671-689, November.
    3. Evgueniia Doudareva & Kimia Ghobadi & Dionne Aleman & Mark Ruschin & David Jaffray, 2015. "Skeletonization for isocentre selection in Gamma Knife® Perfexion™," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 369-385, July.
    4. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    5. Li, S.P & Ng, Ka-Lok, 2003. "Monte Carlo study of the sphere packing problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 321(1), pages 359-363.
    6. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2023. "Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    7. A. Sutou & Y. Dai, 2002. "Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D," Journal of Optimization Theory and Applications, Springer, vol. 114(3), pages 671-694, September.
    8. Stoyan, Yu. & Chugay, A., 2009. "Packing cylinders and rectangular parallelepipeds with distances between them into a given region," European Journal of Operational Research, Elsevier, vol. 197(2), pages 446-455, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:4:y:2000:i:4:d:10.1023_a:1009889628489. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.