Applications of a two-dimensional hidden-line algorithm to other geometric problems

H. ElGindy, D. Avis, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Recently ElGindy and Avis (EA) presented an O(n) algorithm for solving the two-dimensional hidden-line problem in an n-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating an L-convex polygon and finding the convex hull of a simple polygon can be accomplished in O(n) time, whereas testing a simple polygon for L-convexity can be done in O(n2) time.

    Original languageEnglish (US)
    Pages (from-to)191-202
    Number of pages12
    JournalComputing
    Volume31
    Issue number3
    DOIs
    StatePublished - Sep 1 1983

    Fingerprint

    Simple Polygon
    Line
    Convex polygon
    Convex Hull
    Convexity
    Testing

    Keywords

    • algorithms
    • AMS Subject Classifications: 52.A30, 52.A10
    • convex hull
    • edge visible polygon
    • geometric complexity
    • L-convex polygon
    • simple polygon
    • triangulation
    • Visibility

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Software
    • Numerical Analysis
    • Computer Science Applications
    • Computational Theory and Mathematics
    • Computational Mathematics

    Cite this

    Applications of a two-dimensional hidden-line algorithm to other geometric problems. / ElGindy, H.; Avis, D.; Toussaint, Godfried.

    In: Computing, Vol. 31, No. 3, 01.09.1983, p. 191-202.

    Research output: Contribution to journalArticle

    ElGindy, H. ; Avis, D. ; Toussaint, Godfried. / Applications of a two-dimensional hidden-line algorithm to other geometric problems. In: Computing. 1983 ; Vol. 31, No. 3. pp. 191-202.
    @article{0720daa9ae654e79b73da35131f99e05,
    title = "Applications of a two-dimensional hidden-line algorithm to other geometric problems",
    abstract = "Recently ElGindy and Avis (EA) presented an O(n) algorithm for solving the two-dimensional hidden-line problem in an n-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating an L-convex polygon and finding the convex hull of a simple polygon can be accomplished in O(n) time, whereas testing a simple polygon for L-convexity can be done in O(n2) time.",
    keywords = "algorithms, AMS Subject Classifications: 52.A30, 52.A10, convex hull, edge visible polygon, geometric complexity, L-convex polygon, simple polygon, triangulation, Visibility",
    author = "H. ElGindy and D. Avis and Godfried Toussaint",
    year = "1983",
    month = "9",
    day = "1",
    doi = "10.1007/BF02263430",
    language = "English (US)",
    volume = "31",
    pages = "191--202",
    journal = "Computing (Vienna/New York)",
    issn = "0010-485X",
    publisher = "Springer Wien",
    number = "3",

    }

    TY - JOUR

    T1 - Applications of a two-dimensional hidden-line algorithm to other geometric problems

    AU - ElGindy, H.

    AU - Avis, D.

    AU - Toussaint, Godfried

    PY - 1983/9/1

    Y1 - 1983/9/1

    N2 - Recently ElGindy and Avis (EA) presented an O(n) algorithm for solving the two-dimensional hidden-line problem in an n-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating an L-convex polygon and finding the convex hull of a simple polygon can be accomplished in O(n) time, whereas testing a simple polygon for L-convexity can be done in O(n2) time.

    AB - Recently ElGindy and Avis (EA) presented an O(n) algorithm for solving the two-dimensional hidden-line problem in an n-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating an L-convex polygon and finding the convex hull of a simple polygon can be accomplished in O(n) time, whereas testing a simple polygon for L-convexity can be done in O(n2) time.

    KW - algorithms

    KW - AMS Subject Classifications: 52.A30, 52.A10

    KW - convex hull

    KW - edge visible polygon

    KW - geometric complexity

    KW - L-convex polygon

    KW - simple polygon

    KW - triangulation

    KW - Visibility

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

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

    U2 - 10.1007/BF02263430

    DO - 10.1007/BF02263430

    M3 - Article

    VL - 31

    SP - 191

    EP - 202

    JO - Computing (Vienna/New York)

    JF - Computing (Vienna/New York)

    SN - 0010-485X

    IS - 3

    ER -