IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v363y2019ic47.html
   My bibliography  Save this article

QuickhullDisk: A faster convex hull algorithm for disks

Author

Listed:
  • Nguyen, Linh Kieu
  • Song, Chanyoung
  • Ryu, Joonghyun
  • An, Phan Thanh
  • Hoang, Nam-Dũng
  • Kim, Deok-Soo

Abstract

Convex hull is one of the most fundamental constructs in geometry and its construction has been extensively studied. There are many prior works on the convex hull of points. However, its counterpart for weighted points has not been sufficiently addressed despite important applications. Here, we present a simple and fast algorithm, QuickhullDisk, for the convex hull of a set of disks in R2 by generalizing the quickhull algorithm for points. QuickhullDisk takes O(nlog n) time on average and O(mn) time in the worst case where m represents the number of extreme disks which contribute to the boundary of the convex hull of n disks. These time complexities are identical to those of the quickhull algorithm for points in R2. Experimental result shows that the proposed QuickhullDisk algorithm runs significantly faster than the O(nlog n) time incremental algorithm, proposed by Devillers and Golin in 1995, particularly for big data. QuickhullDisk is approximately 2.6 times faster than the incremental algorithm for random disks and is 1.2 times faster even for the disk sets where all disks are extreme. This speed-up is because the basic geometric operation of the QuickhullDisk algorithm is a predicate for the location of a point w.r.t. a line and is much faster than that of the incremental algorithm. The source code of QuickhullDisk is freely available from Mendeley Data and a GUI-version from Voronoi Diagram Research Center, Hanyang University (http://voronoi.hanyang.ac.kr/).

Suggested Citation

  • Nguyen, Linh Kieu & Song, Chanyoung & Ryu, Joonghyun & An, Phan Thanh & Hoang, Nam-Dũng & Kim, Deok-Soo, 2019. "QuickhullDisk: A faster convex hull algorithm for disks," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    • Handle: RePEc:eee:apmaco:v:363:y:2019:i:c:47
    DOI: 10.1016/j.amc.2019.124626
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319306186
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124626?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. Bahman Kalantari, 2015. "A characterization theorem and an algorithm for a convex hull problem," Annals of Operations Research, Springer, vol. 226(1), pages 301-349, March.
    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. An, Phan Thanh & Huyen, Phong Thi Thu & Le, Nguyen Thi, 2021. "A modified Graham’s convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    2. Kieu Linh, Nguyen & Thanh An, Phan & Van Hoai, Tran, 2022. "A fast and efficient algorithm for determining the connected orthogonal convex hulls," Applied Mathematics and Computation, Elsevier, vol. 429(C).

    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. Pranjal Awasthi & Bahman Kalantari & Yikai Zhang, 2020. "Robust vertex enumeration for convex hulls in high dimensions," Annals of Operations Research, Springer, vol. 295(1), pages 37-73, December.
    2. Supanut Chaidee & Kokichi Sugihara, 2020. "The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms," Mathematics, MDPI, vol. 8(4), pages 1-13, April.

    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:eee:apmaco:v:363:y:2019:i:c:47. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.