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

Computing Optimal Beams in Two and Three Dimensions

Author

Listed:
  • Danny Z. Chen

    (University of Notre Dame)

  • Xiaobo (Sharon) Hu

    (University of Notre Dame)

  • Jinhui Xu

    (State University of New York at Buffalo)

Abstract

The problem of computing an optimal beam among weighted regions (called the optimal beam problem) arises in several applied areas such as radiation therapy, stereotactic brain surgery, medical surgery, geological exploration, manufacturing, and environmental engineering. In this paper, we present computational geometry techniques that enable us to develop efficient algorithms for solving various optimal beam problems among weighted regions in two and three dimensional spaces. In particular, we consider two types of problems: the covering problems (seeking an optimal beam to contain a specified target region), and the piercing problems (seeking an optimal beam of a fixed shape to pierce the target region). We investigate several versions of these problems, with a variety of beam shapes and target region shapes in 2-D and 3-D. Our algorithms are based on interesting combinations of computational geometry techniques and optimization methods, and transform the optimal beam problems to solving a collection of instances of certain special non-linear optimization problems. Our approach makes use of interesting geometric observations, such as utilizing some new features of Minkowski sums.

Suggested Citation

  • Danny Z. Chen & Xiaobo (Sharon) Hu & Jinhui Xu, 2003. "Computing Optimal Beams in Two and Three Dimensions," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 111-136, June.
    • Handle: RePEc:spr:jcomop:v:7:y:2003:i:2:d:10.1023_a:1024484412699
    DOI: 10.1023/A:1024484412699
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1024484412699
    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:1024484412699?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.

    Citations

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


    Cited by:

    1. Azadeh Tabatabaei & Mohammad Ghodsi, 2015. "Walking in streets with minimal sensing," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 387-401, August.
    2. Yam Ki Cheung & Ovidiu Daescu, 2011. "Line facility location in weighted regions," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 52-70, July.

    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:7:y:2003:i:2:d:10.1023_a:1024484412699. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.