IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i4d10.1007_s10878-012-9488-5.html
   My bibliography  Save this article

Largest area convex hull of imprecise data based on axis-aligned squares

Author

Listed:
  • Wenqi Ju

    (Chinese Academy of Sciences
    Graduate University of the Chinese Academy of Sciences
    Chinese Academy of Sciences)

  • Jun Luo

    (Chinese Academy of Sciences)

  • Binhai Zhu

    (Montana State University)

  • Ovidiu Daescu

    (University of Texas at Dallas)

Abstract

In recent years, more and more algorithms related to imprecise data have been proposed. Specifically, some algorithms on computing the maximum area convex hull are designed recently when the imprecise data are modeled as non-overlapping axis-aligned squares or as equal size squares. The time complexity of the best known algorithm based on non-overlapping axis-aligned squares is O(n 7). If the squares have equal size and can overlap, the time complexity of the best known algorithm is O(n 5). In this paper, we improve the former from O(n 7) to O(n 5) and improve the latter from O(n 5) to O(n 2). These results are obtained by exploiting the non-trivial geometric properties of the problems.

Suggested Citation

  • Wenqi Ju & Jun Luo & Binhai Zhu & Ovidiu Daescu, 2013. "Largest area convex hull of imprecise data based on axis-aligned squares," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 832-859, November.
    • Handle: RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9488-5
    DOI: 10.1007/s10878-012-9488-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9488-5
    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/s10878-012-9488-5?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.

    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:26:y:2013:i:4:d:10.1007_s10878-012-9488-5. 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.