Computing Visibility Properties of Polygons

Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    In many pattern recognition problems the objects of interest are represented as polygons. For some applications such as pattern matching the shape of the polygons is successfully measured in terms of the visibility relations between the edges. In this paper we survey some recent results in computational geometry that allow efficient computation of visibility properties between edges of a simple polygon as well as more general visibility relations. In particular, four natural definitions of edge-to-edge visibility are considered and a linear-time, and thus optimal, algorithm is discussed to determine edge-to-edge visibility under any of the four definitions. Furthermore, an O(n log log n) time algorithm is reviewed for determining that region of an n-gon P that is weakly visible from a specified edge of P (the strong hidden-line problem). The algorithm combines results from visibility and geodesic paths with the recent polygon triangulation algorithm of Tarjan and Van Wyk [42]. We also discuss the problem of determining whether a polygon is visible from a specified edge. In particular three natural definitions of edge-visibility of polygons are considered and new optimal algorithms are proposed for testing visibility from a specified edge under any of the three definitions.

    Original languageEnglish (US)
    Pages (from-to)103-122
    Number of pages20
    JournalMachine Intelligence and Pattern Recognition
    Volume7
    Issue numberC
    DOIs
    StatePublished - Jan 1 1988

    Fingerprint

    Visibility
    Computational geometry
    Pattern matching
    Triangulation
    Pattern recognition
    Testing

    ASJC Scopus subject areas

    • Computer Vision and Pattern Recognition
    • Artificial Intelligence

    Cite this

    Computing Visibility Properties of Polygons. / Toussaint, Godfried.

    In: Machine Intelligence and Pattern Recognition, Vol. 7, No. C, 01.01.1988, p. 103-122.

    Research output: Contribution to journalArticle

    Toussaint, Godfried. / Computing Visibility Properties of Polygons. In: Machine Intelligence and Pattern Recognition. 1988 ; Vol. 7, No. C. pp. 103-122.
    @article{33e6d7afc9054e11970941f616271b43,
    title = "Computing Visibility Properties of Polygons",
    abstract = "In many pattern recognition problems the objects of interest are represented as polygons. For some applications such as pattern matching the shape of the polygons is successfully measured in terms of the visibility relations between the edges. In this paper we survey some recent results in computational geometry that allow efficient computation of visibility properties between edges of a simple polygon as well as more general visibility relations. In particular, four natural definitions of edge-to-edge visibility are considered and a linear-time, and thus optimal, algorithm is discussed to determine edge-to-edge visibility under any of the four definitions. Furthermore, an O(n log log n) time algorithm is reviewed for determining that region of an n-gon P that is weakly visible from a specified edge of P (the strong hidden-line problem). The algorithm combines results from visibility and geodesic paths with the recent polygon triangulation algorithm of Tarjan and Van Wyk [42]. We also discuss the problem of determining whether a polygon is visible from a specified edge. In particular three natural definitions of edge-visibility of polygons are considered and new optimal algorithms are proposed for testing visibility from a specified edge under any of the three definitions.",
    author = "Godfried Toussaint",
    year = "1988",
    month = "1",
    day = "1",
    doi = "10.1016/B978-0-444-87137-4.50014-X",
    language = "English (US)",
    volume = "7",
    pages = "103--122",
    journal = "Machine Intelligence and Pattern Recognition",
    issn = "0923-0459",
    publisher = "Elsevier",
    number = "C",

    }

    TY - JOUR

    T1 - Computing Visibility Properties of Polygons

    AU - Toussaint, Godfried

    PY - 1988/1/1

    Y1 - 1988/1/1

    N2 - In many pattern recognition problems the objects of interest are represented as polygons. For some applications such as pattern matching the shape of the polygons is successfully measured in terms of the visibility relations between the edges. In this paper we survey some recent results in computational geometry that allow efficient computation of visibility properties between edges of a simple polygon as well as more general visibility relations. In particular, four natural definitions of edge-to-edge visibility are considered and a linear-time, and thus optimal, algorithm is discussed to determine edge-to-edge visibility under any of the four definitions. Furthermore, an O(n log log n) time algorithm is reviewed for determining that region of an n-gon P that is weakly visible from a specified edge of P (the strong hidden-line problem). The algorithm combines results from visibility and geodesic paths with the recent polygon triangulation algorithm of Tarjan and Van Wyk [42]. We also discuss the problem of determining whether a polygon is visible from a specified edge. In particular three natural definitions of edge-visibility of polygons are considered and new optimal algorithms are proposed for testing visibility from a specified edge under any of the three definitions.

    AB - In many pattern recognition problems the objects of interest are represented as polygons. For some applications such as pattern matching the shape of the polygons is successfully measured in terms of the visibility relations between the edges. In this paper we survey some recent results in computational geometry that allow efficient computation of visibility properties between edges of a simple polygon as well as more general visibility relations. In particular, four natural definitions of edge-to-edge visibility are considered and a linear-time, and thus optimal, algorithm is discussed to determine edge-to-edge visibility under any of the four definitions. Furthermore, an O(n log log n) time algorithm is reviewed for determining that region of an n-gon P that is weakly visible from a specified edge of P (the strong hidden-line problem). The algorithm combines results from visibility and geodesic paths with the recent polygon triangulation algorithm of Tarjan and Van Wyk [42]. We also discuss the problem of determining whether a polygon is visible from a specified edge. In particular three natural definitions of edge-visibility of polygons are considered and new optimal algorithms are proposed for testing visibility from a specified edge under any of the three definitions.

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

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

    U2 - 10.1016/B978-0-444-87137-4.50014-X

    DO - 10.1016/B978-0-444-87137-4.50014-X

    M3 - Article

    VL - 7

    SP - 103

    EP - 122

    JO - Machine Intelligence and Pattern Recognition

    JF - Machine Intelligence and Pattern Recognition

    SN - 0923-0459

    IS - C

    ER -