Approximation and exact algorithms for minimum-width annuli and shells

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual Symposium on Computational Geometry
    PublisherACM
    Pages380-389
    Number of pages10
    StatePublished - 1999
    EventProceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA
    Duration: Jun 13 1999Jun 16 1999

    Other

    OtherProceedings of the 1999 15th Annual Symposium on Computational Geometry
    CityMiami Beach, FL, USA
    Period6/13/996/16/99

    Fingerprint

    Roundness
    Exact Algorithms
    Ring or annulus
    Approximation Algorithms
    Shell
    Computing
    Approximation

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Geometry and Topology

    Cite this

    Agarwal, P. K., Aronov, B., Har-Peled, S., & Sharir, M. (1999). Approximation and exact algorithms for minimum-width annuli and shells. In Proceedings of the Annual Symposium on Computational Geometry (pp. 380-389). ACM.

    Approximation and exact algorithms for minimum-width annuli and shells. / Agarwal, Pankaj K.; Aronov, Boris; Har-Peled, Sariel; Sharir, Micha.

    Proceedings of the Annual Symposium on Computational Geometry. ACM, 1999. p. 380-389.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Agarwal, PK, Aronov, B, Har-Peled, S & Sharir, M 1999, Approximation and exact algorithms for minimum-width annuli and shells. in Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 380-389, Proceedings of the 1999 15th Annual Symposium on Computational Geometry, Miami Beach, FL, USA, 6/13/99.
    Agarwal PK, Aronov B, Har-Peled S, Sharir M. Approximation and exact algorithms for minimum-width annuli and shells. In Proceedings of the Annual Symposium on Computational Geometry. ACM. 1999. p. 380-389
    Agarwal, Pankaj K. ; Aronov, Boris ; Har-Peled, Sariel ; Sharir, Micha. / Approximation and exact algorithms for minimum-width annuli and shells. Proceedings of the Annual Symposium on Computational Geometry. ACM, 1999. pp. 380-389
    @inbook{ed043ba3371e4b6f9b9c013627265d4c,
    title = "Approximation and exact algorithms for minimum-width annuli and shells",
    abstract = "The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Sariel Har-Peled and Micha Sharir",
    year = "1999",
    language = "English (US)",
    pages = "380--389",
    booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
    publisher = "ACM",

    }

    TY - CHAP

    T1 - Approximation and exact algorithms for minimum-width annuli and shells

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - Har-Peled, Sariel

    AU - Sharir, Micha

    PY - 1999

    Y1 - 1999

    N2 - The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

    AB - The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

    UR - http://www.scopus.com/inward/record.url?scp=0032650948&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032650948&partnerID=8YFLogxK

    M3 - Chapter

    SP - 380

    EP - 389

    BT - Proceedings of the Annual Symposium on Computational Geometry

    PB - ACM

    ER -