On minimum-area hulls: (Extended abstract)

Esther M. Arkin, Yi Jen Chiang, Martin Held, Joseph S B Mitchell, Vera Sacristan, Steven S. Skiena, Tae Cheon Yang

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

    Abstract

    We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. We also consider the case in which P* is required to be monotone (the minimum-area monotone hull problem).

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA 1996 - 4th Annual European Symposium, Proceedings
    PublisherSpringer Verlag
    Pages334-348
    Number of pages15
    Volume1136
    ISBN (Print)3540616802, 9783540616801
    DOIs
    StatePublished - 1996
    Event4th European Symposium on Algorithms, ESA 1996 - Barcelona, Spain
    Duration: Sep 25 1996Sep 27 1996

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1136
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other4th European Symposium on Algorithms, ESA 1996
    CountrySpain
    CityBarcelona
    Period9/25/969/27/96

    Fingerprint

    Stars
    Star
    Monotone
    Simple Polygon
    Convex Hull
    Polygon
    Generalise
    Vertex of a graph

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Arkin, E. M., Chiang, Y. J., Held, M., Mitchell, J. S. B., Sacristan, V., Skiena, S. S., & Yang, T. C. (1996). On minimum-area hulls: (Extended abstract). In Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings (Vol. 1136, pp. 334-348). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1136). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_66

    On minimum-area hulls : (Extended abstract). / Arkin, Esther M.; Chiang, Yi Jen; Held, Martin; Mitchell, Joseph S B; Sacristan, Vera; Skiena, Steven S.; Yang, Tae Cheon.

    Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. Vol. 1136 Springer Verlag, 1996. p. 334-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1136).

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

    Arkin, EM, Chiang, YJ, Held, M, Mitchell, JSB, Sacristan, V, Skiena, SS & Yang, TC 1996, On minimum-area hulls: (Extended abstract). in Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. vol. 1136, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1136, Springer Verlag, pp. 334-348, 4th European Symposium on Algorithms, ESA 1996, Barcelona, Spain, 9/25/96. https://doi.org/10.1007/3-540-61680-2_66
    Arkin EM, Chiang YJ, Held M, Mitchell JSB, Sacristan V, Skiena SS et al. On minimum-area hulls: (Extended abstract). In Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. Vol. 1136. Springer Verlag. 1996. p. 334-348. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-61680-2_66
    Arkin, Esther M. ; Chiang, Yi Jen ; Held, Martin ; Mitchell, Joseph S B ; Sacristan, Vera ; Skiena, Steven S. ; Yang, Tae Cheon. / On minimum-area hulls : (Extended abstract). Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. Vol. 1136 Springer Verlag, 1996. pp. 334-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{b35052fb5ce7455bab526a8e2704d4d3,
    title = "On minimum-area hulls: (Extended abstract)",
    abstract = "We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. We also consider the case in which P* is required to be monotone (the minimum-area monotone hull problem).",
    author = "Arkin, {Esther M.} and Chiang, {Yi Jen} and Martin Held and Mitchell, {Joseph S B} and Vera Sacristan and Skiena, {Steven S.} and Yang, {Tae Cheon}",
    year = "1996",
    doi = "10.1007/3-540-61680-2_66",
    language = "English (US)",
    isbn = "3540616802",
    volume = "1136",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "334--348",
    booktitle = "Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - On minimum-area hulls

    T2 - (Extended abstract)

    AU - Arkin, Esther M.

    AU - Chiang, Yi Jen

    AU - Held, Martin

    AU - Mitchell, Joseph S B

    AU - Sacristan, Vera

    AU - Skiena, Steven S.

    AU - Yang, Tae Cheon

    PY - 1996

    Y1 - 1996

    N2 - We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. We also consider the case in which P* is required to be monotone (the minimum-area monotone hull problem).

    AB - We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. We also consider the case in which P* is required to be monotone (the minimum-area monotone hull problem).

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

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

    U2 - 10.1007/3-540-61680-2_66

    DO - 10.1007/3-540-61680-2_66

    M3 - Conference contribution

    SN - 3540616802

    SN - 9783540616801

    VL - 1136

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 334

    EP - 348

    BT - Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings

    PB - Springer Verlag

    ER -