IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v35y1987i1p80-86.html
   My bibliography  Save this article

An Efficient Geometric Solution to the Minimum Spanning Circle Problem

Author

Listed:
  • B. John Oommen

    (Carleton University, Ottawa, Ontario, Canada)

Abstract

We consider the century-old problem of finding the minimum spanning circle (MSC) of N points in the plane. We propose a computational scheme that incorporates the ideas that motivate three of the best-known primal feasible algorithms. The technique converges in finite time and is extremely fast. In all our experiments that involved digitized and random data, without even a rare exception, the technique converged in exactly two iterations. We conjecture that the algorithm, which is purely geometric, has a linear time complexity.

Suggested Citation

  • B. John Oommen, 1987. "An Efficient Geometric Solution to the Minimum Spanning Circle Problem," Operations Research, INFORMS, vol. 35(1), pages 80-86, February.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:80-86
    DOI: 10.1287/opre.35.1.80
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.1.80
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.1.80?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
    ---><---

    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:inm:oropre:v:35:y:1987:i:1:p:80-86. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.