IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v83y2022i1d10.1007_s10898-021-01101-3.html
   My bibliography  Save this article

An exact algorithm for constructing minimum Euclidean skeletons of polygons

Author

Listed:
  • Nicolau Andrés-Thió

    (The University of Melbourne)

  • Marcus Brazil

    (The University of Melbourne)

  • Charl Ras

    (The University of Melbourne)

  • Doreen Thomas

    (The University of Melbourne)

  • Marcus Volz

    (The University of Melbourne)

Abstract

A Euclidean skeleton is a set of edges in the interior (or on the boundary) of a polygon that intersects any line segment that joins two points outside of the polygon and that intersects the polygon. In this paper we study minimum cardinality Euclidean skeletons and develop an algorithm for constructing them. We first prove a number of structural properties of minimum skeletons and use these to develop a canonical form. We then design an exact algorithm which initially generates a set of canonical skeleton edges, then executes a pruning module to reduce the set of candidate edges, and finally runs existing integer linear programming code to output an optimal solution. Finally, we perform computational testing on our algorithm to demonstrate its performance, and observe a number of experimental properties of minimum skeletons.

Suggested Citation

  • Nicolau Andrés-Thió & Marcus Brazil & Charl Ras & Doreen Thomas & Marcus Volz, 2022. "An exact algorithm for constructing minimum Euclidean skeletons of polygons," Journal of Global Optimization, Springer, vol. 83(1), pages 137-162, May.
    • Handle: RePEc:spr:jglopt:v:83:y:2022:i:1:d:10.1007_s10898-021-01101-3
    DOI: 10.1007/s10898-021-01101-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01101-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-021-01101-3?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. Marcus Volz & Marcus Brazil & Charl Ras & Doreen Thomas, 2020. "Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane," Journal of Optimization Theory and Applications, Springer, vol. 186(1), pages 102-133, July.
    Full references (including those not matched with items on IDEAS)

    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.

      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:jglopt:v:83:y:2022:i:1:d:10.1007_s10898-021-01101-3. 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.