A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

Binary K. Bhattacharya, Asish Mukhopadhyay, Godfried Toussaint

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

    Abstract

    A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings
    PublisherSpringer-Verlag
    Pages412-424
    Number of pages13
    ISBN (Print)9783540475668
    DOIs
    StatePublished - Jan 1 1991
    Event2nd Workshop on Algorithms and Data Structures, WADS 1991 - Ottawa, Canada
    Duration: Aug 14 1991Aug 16 1991

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume519 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other2nd Workshop on Algorithms and Data Structures, WADS 1991
    CountryCanada
    CityOttawa
    Period8/14/918/16/91

    Fingerprint

    Linear-time Algorithm
    Line segment
    Polygon
    Computing
    Simple Polygon
    Interior
    Convex polygon
    Intersect

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Bhattacharya, B. K., Mukhopadhyay, A., & Toussaint, G. (1991). A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. In Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings (pp. 412-424). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS). Springer-Verlag. https://doi.org/10.1007/BFb0028280

    A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. / Bhattacharya, Binary K.; Mukhopadhyay, Asish; Toussaint, Godfried.

    Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Springer-Verlag, 1991. p. 412-424 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS).

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

    Bhattacharya, BK, Mukhopadhyay, A & Toussaint, G 1991, A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. in Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS, Springer-Verlag, pp. 412-424, 2nd Workshop on Algorithms and Data Structures, WADS 1991, Ottawa, Canada, 8/14/91. https://doi.org/10.1007/BFb0028280
    Bhattacharya BK, Mukhopadhyay A, Toussaint G. A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. In Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Springer-Verlag. 1991. p. 412-424. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0028280
    Bhattacharya, Binary K. ; Mukhopadhyay, Asish ; Toussaint, Godfried. / A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Springer-Verlag, 1991. pp. 412-424 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{253f229ae00e40189a467e089acd5bc9,
    title = "A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible",
    abstract = "A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.",
    author = "Bhattacharya, {Binary K.} and Asish Mukhopadhyay and Godfried Toussaint",
    year = "1991",
    month = "1",
    day = "1",
    doi = "10.1007/BFb0028280",
    language = "English (US)",
    isbn = "9783540475668",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "412--424",
    booktitle = "Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings",

    }

    TY - GEN

    T1 - A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

    AU - Bhattacharya, Binary K.

    AU - Mukhopadhyay, Asish

    AU - Toussaint, Godfried

    PY - 1991/1/1

    Y1 - 1991/1/1

    N2 - A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.

    AB - A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.

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

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

    U2 - 10.1007/BFb0028280

    DO - 10.1007/BFb0028280

    M3 - Conference contribution

    SN - 9783540475668

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

    SP - 412

    EP - 424

    BT - Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings

    PB - Springer-Verlag

    ER -