A simple linear hidden-line algorithm for star-shaped polygons

David Rappaport, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.

    Original languageEnglish (US)
    Pages (from-to)35-39
    Number of pages5
    JournalPattern Recognition Letters
    Volume3
    Issue number1
    DOIs
    StatePublished - Jan 1 1985

    Fingerprint

    Stars
    Visibility

    Keywords

    • Algorithms
    • complexity
    • computational geometry
    • discrete geometry
    • hidden-line problem
    • star-shaped polygons
    • visibility

    ASJC Scopus subject areas

    • Software
    • Signal Processing
    • Computer Vision and Pattern Recognition
    • Artificial Intelligence

    Cite this

    A simple linear hidden-line algorithm for star-shaped polygons. / Rappaport, David; Toussaint, Godfried.

    In: Pattern Recognition Letters, Vol. 3, No. 1, 01.01.1985, p. 35-39.

    Research output: Contribution to journalArticle

    Rappaport, David ; Toussaint, Godfried. / A simple linear hidden-line algorithm for star-shaped polygons. In: Pattern Recognition Letters. 1985 ; Vol. 3, No. 1. pp. 35-39.
    @article{05f4ecf9a09240a6872395bf3e83b230,
    title = "A simple linear hidden-line algorithm for star-shaped polygons",
    abstract = "A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.",
    keywords = "Algorithms, complexity, computational geometry, discrete geometry, hidden-line problem, star-shaped polygons, visibility",
    author = "David Rappaport and Godfried Toussaint",
    year = "1985",
    month = "1",
    day = "1",
    doi = "10.1016/0167-8655(85)90040-6",
    language = "English (US)",
    volume = "3",
    pages = "35--39",
    journal = "Pattern Recognition Letters",
    issn = "0167-8655",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - A simple linear hidden-line algorithm for star-shaped polygons

    AU - Rappaport, David

    AU - Toussaint, Godfried

    PY - 1985/1/1

    Y1 - 1985/1/1

    N2 - A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.

    AB - A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.

    KW - Algorithms

    KW - complexity

    KW - computational geometry

    KW - discrete geometry

    KW - hidden-line problem

    KW - star-shaped polygons

    KW - visibility

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

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

    U2 - 10.1016/0167-8655(85)90040-6

    DO - 10.1016/0167-8655(85)90040-6

    M3 - Article

    VL - 3

    SP - 35

    EP - 39

    JO - Pattern Recognition Letters

    JF - Pattern Recognition Letters

    SN - 0167-8655

    IS - 1

    ER -