Exact and approximation algorithms for minimum-width cylindrical shells

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Let S be a set of n points in R3. Let ω* = ω*(S) be the width (i.e., thickness) of a minimum-width infinite cylindrical shell (the region between two co-axial cylinders) containing S. We first present an O(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ>0, that computes a cylindrical shell of width at most 26(1+1/n4/9)ω* containing S.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    PublisherSIAM
    Pages510-517
    Number of pages8
    StatePublished - 2000
    Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
    Duration: Jan 9 2000Jan 11 2000

    Other

    Other11th Annual ACM-SIAM Symposium on Discrete Algorithms
    CitySan Francisco, CA, USA
    Period1/9/001/11/00

    Fingerprint

    Cylindrical Shell
    Approximation algorithms
    Exact Algorithms
    Approximation Algorithms
    Coaxial
    Computing

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Agarwal, P. K., Aronov, B., & Sharir, M. (2000). Exact and approximation algorithms for minimum-width cylindrical shells. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 510-517). SIAM.

    Exact and approximation algorithms for minimum-width cylindrical shells. / Agarwal, Pankaj K.; Aronov, Boris; Sharir, Micha.

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2000. p. 510-517.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Agarwal, PK, Aronov, B & Sharir, M 2000, Exact and approximation algorithms for minimum-width cylindrical shells. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 510-517, 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/9/00.
    Agarwal PK, Aronov B, Sharir M. Exact and approximation algorithms for minimum-width cylindrical shells. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 2000. p. 510-517
    Agarwal, Pankaj K. ; Aronov, Boris ; Sharir, Micha. / Exact and approximation algorithms for minimum-width cylindrical shells. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2000. pp. 510-517
    @inproceedings{346fb1a68efd4c15b420234a1753ea29,
    title = "Exact and approximation algorithms for minimum-width cylindrical shells",
    abstract = "Let S be a set of n points in R3. Let ω* = ω*(S) be the width (i.e., thickness) of a minimum-width infinite cylindrical shell (the region between two co-axial cylinders) containing S. We first present an O(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ>0, that computes a cylindrical shell of width at most 26(1+1/n4/9)ω* containing S.",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Micha Sharir",
    year = "2000",
    language = "English (US)",
    pages = "510--517",
    booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
    publisher = "SIAM",

    }

    TY - GEN

    T1 - Exact and approximation algorithms for minimum-width cylindrical shells

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - Sharir, Micha

    PY - 2000

    Y1 - 2000

    N2 - Let S be a set of n points in R3. Let ω* = ω*(S) be the width (i.e., thickness) of a minimum-width infinite cylindrical shell (the region between two co-axial cylinders) containing S. We first present an O(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ>0, that computes a cylindrical shell of width at most 26(1+1/n4/9)ω* containing S.

    AB - Let S be a set of n points in R3. Let ω* = ω*(S) be the width (i.e., thickness) of a minimum-width infinite cylindrical shell (the region between two co-axial cylinders) containing S. We first present an O(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ>0, that computes a cylindrical shell of width at most 26(1+1/n4/9)ω* containing S.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0033881364

    SP - 510

    EP - 517

    BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

    PB - SIAM

    ER -