Computing the width of a set

Michael B. Houle, Godfried Toussaint

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

    Abstract

    Given a set of points P - {p1,p2....Pn} ,n three dimensions, the width of P, W(P)% is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n logn time and O(n) space, where / is the number of antipodal pairs? of edges of the convex hull of P, and in the worst case O(n2). [f P is a set of points in the plane, this complexity can be reduced to O(n logn). Finally, for simple polygons linear time suffices.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985
    PublisherAssociation for Computing Machinery, Inc
    Pages1-7
    Number of pages7
    ISBN (Electronic)0897911636, 9780897911634
    DOIs
    StatePublished - Jun 1 1985
    Event1st Annual Symposium on Computational Geometry, SCG 1985 - Baltimore, United States
    Duration: Jun 5 1985Jun 7 1985

    Other

    Other1st Annual Symposium on Computational Geometry, SCG 1985
    CountryUnited States
    CityBaltimore
    Period6/5/856/7/85

    Fingerprint

    Set of points
    Simple Polygon
    Computing
    Minimum Distance
    Convex Hull
    Three-dimension
    Linear Time

    ASJC Scopus subject areas

    • Computational Mathematics
    • Geometry and Topology

    Cite this

    Houle, M. B., & Toussaint, G. (1985). Computing the width of a set. In Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985 (pp. 1-7). Association for Computing Machinery, Inc. https://doi.org/10.1145/323233.323234

    Computing the width of a set. / Houle, Michael B.; Toussaint, Godfried.

    Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985. Association for Computing Machinery, Inc, 1985. p. 1-7.

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

    Houle, MB & Toussaint, G 1985, Computing the width of a set. in Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985. Association for Computing Machinery, Inc, pp. 1-7, 1st Annual Symposium on Computational Geometry, SCG 1985, Baltimore, United States, 6/5/85. https://doi.org/10.1145/323233.323234
    Houle MB, Toussaint G. Computing the width of a set. In Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985. Association for Computing Machinery, Inc. 1985. p. 1-7 https://doi.org/10.1145/323233.323234
    Houle, Michael B. ; Toussaint, Godfried. / Computing the width of a set. Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985. Association for Computing Machinery, Inc, 1985. pp. 1-7
    @inproceedings{37ceac11df0245b7a0acbb62ed5f5746,
    title = "Computing the width of a set",
    abstract = "Given a set of points P - {p1,p2....Pn} ,n three dimensions, the width of P, W(P){\%} is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n logn time and O(n) space, where / is the number of antipodal pairs? of edges of the convex hull of P, and in the worst case O(n2). [f P is a set of points in the plane, this complexity can be reduced to O(n logn). Finally, for simple polygons linear time suffices.",
    author = "Houle, {Michael B.} and Godfried Toussaint",
    year = "1985",
    month = "6",
    day = "1",
    doi = "10.1145/323233.323234",
    language = "English (US)",
    pages = "1--7",
    booktitle = "Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985",
    publisher = "Association for Computing Machinery, Inc",

    }

    TY - GEN

    T1 - Computing the width of a set

    AU - Houle, Michael B.

    AU - Toussaint, Godfried

    PY - 1985/6/1

    Y1 - 1985/6/1

    N2 - Given a set of points P - {p1,p2....Pn} ,n three dimensions, the width of P, W(P)% is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n logn time and O(n) space, where / is the number of antipodal pairs? of edges of the convex hull of P, and in the worst case O(n2). [f P is a set of points in the plane, this complexity can be reduced to O(n logn). Finally, for simple polygons linear time suffices.

    AB - Given a set of points P - {p1,p2....Pn} ,n three dimensions, the width of P, W(P)% is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n logn time and O(n) space, where / is the number of antipodal pairs? of edges of the convex hull of P, and in the worst case O(n2). [f P is a set of points in the plane, this complexity can be reduced to O(n logn). Finally, for simple polygons linear time suffices.

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

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

    U2 - 10.1145/323233.323234

    DO - 10.1145/323233.323234

    M3 - Conference contribution

    SP - 1

    EP - 7

    BT - Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985

    PB - Association for Computing Machinery, Inc

    ER -