On the sectional area of convex polytopes

David Avis, Prosenjit Bose, Thomas C. Shermer, Jack Snoeyink, Godfried Toussaint, Binhai Zhu

    Research output: Contribution to conferencePaper

    Abstract

    A function f: R → R is unimodal if it increases to a maximum value and then decreases. It is strictly unimodal if the increase and decrease are strict. Unimodality is important for the design of efficient search algorithms because it permits prune-and-search strategies. It also simplifies proofs. An algorithm for R3 is presented which has an application to shape matching. Given convex polygon P and Q and a direction in which to translate P, it is easy to find the translation having maximum overlap with Q in linear time.

    Original languageEnglish (US)
    StatePublished - Jan 1 1996
    EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
    Duration: May 24 1996May 26 1996

    Other

    OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
    CityPhiladelphia, PA, USA
    Period5/24/965/26/96

    Fingerprint

    Convex Polytopes
    Shape Matching
    Unimodality
    Decrease
    Convex polygon
    Search Strategy
    Search Algorithm
    Linear Time
    Overlap
    Simplify
    Efficient Algorithms
    Strictly
    Design
    Direction compound

    ASJC Scopus subject areas

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

    Cite this

    Avis, D., Bose, P., Shermer, T. C., Snoeyink, J., Toussaint, G., & Zhu, B. (1996). On the sectional area of convex polytopes. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .

    On the sectional area of convex polytopes. / Avis, David; Bose, Prosenjit; Shermer, Thomas C.; Snoeyink, Jack; Toussaint, Godfried; Zhu, Binhai.

    1996. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .

    Research output: Contribution to conferencePaper

    Avis, D, Bose, P, Shermer, TC, Snoeyink, J, Toussaint, G & Zhu, B 1996, 'On the sectional area of convex polytopes' Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, 5/24/96 - 5/26/96, .
    Avis D, Bose P, Shermer TC, Snoeyink J, Toussaint G, Zhu B. On the sectional area of convex polytopes. 1996. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .
    Avis, David ; Bose, Prosenjit ; Shermer, Thomas C. ; Snoeyink, Jack ; Toussaint, Godfried ; Zhu, Binhai. / On the sectional area of convex polytopes. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .
    @conference{aea30be3b01d447aa5beb60bf7ead4ea,
    title = "On the sectional area of convex polytopes",
    abstract = "A function f: R → R is unimodal if it increases to a maximum value and then decreases. It is strictly unimodal if the increase and decrease are strict. Unimodality is important for the design of efficient search algorithms because it permits prune-and-search strategies. It also simplifies proofs. An algorithm for R3 is presented which has an application to shape matching. Given convex polygon P and Q and a direction in which to translate P, it is easy to find the translation having maximum overlap with Q in linear time.",
    author = "David Avis and Prosenjit Bose and Shermer, {Thomas C.} and Jack Snoeyink and Godfried Toussaint and Binhai Zhu",
    year = "1996",
    month = "1",
    day = "1",
    language = "English (US)",
    note = "Proceedings of the 1996 12th Annual Symposium on Computational Geometry ; Conference date: 24-05-1996 Through 26-05-1996",

    }

    TY - CONF

    T1 - On the sectional area of convex polytopes

    AU - Avis, David

    AU - Bose, Prosenjit

    AU - Shermer, Thomas C.

    AU - Snoeyink, Jack

    AU - Toussaint, Godfried

    AU - Zhu, Binhai

    PY - 1996/1/1

    Y1 - 1996/1/1

    N2 - A function f: R → R is unimodal if it increases to a maximum value and then decreases. It is strictly unimodal if the increase and decrease are strict. Unimodality is important for the design of efficient search algorithms because it permits prune-and-search strategies. It also simplifies proofs. An algorithm for R3 is presented which has an application to shape matching. Given convex polygon P and Q and a direction in which to translate P, it is easy to find the translation having maximum overlap with Q in linear time.

    AB - A function f: R → R is unimodal if it increases to a maximum value and then decreases. It is strictly unimodal if the increase and decrease are strict. Unimodality is important for the design of efficient search algorithms because it permits prune-and-search strategies. It also simplifies proofs. An algorithm for R3 is presented which has an application to shape matching. Given convex polygon P and Q and a direction in which to translate P, it is easy to find the translation having maximum overlap with Q in linear time.

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

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

    M3 - Paper

    ER -