On geodesic properties of polygons relevant to linear time triangulation

Hossam ElGindy, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Triangulating a simple polygon of n vertices in O(n) time is one of the main open problems in computational geometry. The fastest algorithm to date, due to Tarjan and van Wyk, runs in O(n log log n), but several classes of simple polygons have been shown to admit linear time traingulation. Famous examples of such classes are: star-shaped, monotone, spiral, edge visible, and weakly externally visible polygons. The notion of geodesic paths is used here to characterize all classes of polygons for which linear time triangulation algorithms are known. First we introduce a new class of polygons, palm polygons, which subsumes many known classes of polygons for which linear time triangulation algorithms exist, and present a linear time algorithm for triangulating polygons in this class. Then a class of polygons, crab polygons, is defined and shown to contain all classes of existing polygons for which linear time triangulation algorithms are known. As a byproduct of this characterization, a new, very simple linear time algorithm for triangulating star-shaped polygons is obtained.

    Original languageEnglish (US)
    Pages (from-to)68-74
    Number of pages7
    JournalThe Visual Computer
    Volume5
    Issue number1-2
    DOIs
    StatePublished - Jan 1 1989

    Fingerprint

    Triangulation
    Stars
    Computational geometry
    Byproducts

    Keywords

    • Computational geometry
    • Geodesic properties
    • Simple polygons
    • Triangulation

    ASJC Scopus subject areas

    • Software
    • Computer Graphics and Computer-Aided Design

    Cite this

    On geodesic properties of polygons relevant to linear time triangulation. / ElGindy, Hossam; Toussaint, Godfried.

    In: The Visual Computer, Vol. 5, No. 1-2, 01.01.1989, p. 68-74.

    Research output: Contribution to journalArticle

    ElGindy, Hossam ; Toussaint, Godfried. / On geodesic properties of polygons relevant to linear time triangulation. In: The Visual Computer. 1989 ; Vol. 5, No. 1-2. pp. 68-74.
    @article{471952bdc0604e7ba8583d26d2f121b2,
    title = "On geodesic properties of polygons relevant to linear time triangulation",
    abstract = "Triangulating a simple polygon of n vertices in O(n) time is one of the main open problems in computational geometry. The fastest algorithm to date, due to Tarjan and van Wyk, runs in O(n log log n), but several classes of simple polygons have been shown to admit linear time traingulation. Famous examples of such classes are: star-shaped, monotone, spiral, edge visible, and weakly externally visible polygons. The notion of geodesic paths is used here to characterize all classes of polygons for which linear time triangulation algorithms are known. First we introduce a new class of polygons, palm polygons, which subsumes many known classes of polygons for which linear time triangulation algorithms exist, and present a linear time algorithm for triangulating polygons in this class. Then a class of polygons, crab polygons, is defined and shown to contain all classes of existing polygons for which linear time triangulation algorithms are known. As a byproduct of this characterization, a new, very simple linear time algorithm for triangulating star-shaped polygons is obtained.",
    keywords = "Computational geometry, Geodesic properties, Simple polygons, Triangulation",
    author = "Hossam ElGindy and Godfried Toussaint",
    year = "1989",
    month = "1",
    day = "1",
    doi = "10.1007/BF01901482",
    language = "English (US)",
    volume = "5",
    pages = "68--74",
    journal = "Visual Computer",
    issn = "0178-2789",
    publisher = "Springer Verlag",
    number = "1-2",

    }

    TY - JOUR

    T1 - On geodesic properties of polygons relevant to linear time triangulation

    AU - ElGindy, Hossam

    AU - Toussaint, Godfried

    PY - 1989/1/1

    Y1 - 1989/1/1

    N2 - Triangulating a simple polygon of n vertices in O(n) time is one of the main open problems in computational geometry. The fastest algorithm to date, due to Tarjan and van Wyk, runs in O(n log log n), but several classes of simple polygons have been shown to admit linear time traingulation. Famous examples of such classes are: star-shaped, monotone, spiral, edge visible, and weakly externally visible polygons. The notion of geodesic paths is used here to characterize all classes of polygons for which linear time triangulation algorithms are known. First we introduce a new class of polygons, palm polygons, which subsumes many known classes of polygons for which linear time triangulation algorithms exist, and present a linear time algorithm for triangulating polygons in this class. Then a class of polygons, crab polygons, is defined and shown to contain all classes of existing polygons for which linear time triangulation algorithms are known. As a byproduct of this characterization, a new, very simple linear time algorithm for triangulating star-shaped polygons is obtained.

    AB - Triangulating a simple polygon of n vertices in O(n) time is one of the main open problems in computational geometry. The fastest algorithm to date, due to Tarjan and van Wyk, runs in O(n log log n), but several classes of simple polygons have been shown to admit linear time traingulation. Famous examples of such classes are: star-shaped, monotone, spiral, edge visible, and weakly externally visible polygons. The notion of geodesic paths is used here to characterize all classes of polygons for which linear time triangulation algorithms are known. First we introduce a new class of polygons, palm polygons, which subsumes many known classes of polygons for which linear time triangulation algorithms exist, and present a linear time algorithm for triangulating polygons in this class. Then a class of polygons, crab polygons, is defined and shown to contain all classes of existing polygons for which linear time triangulation algorithms are known. As a byproduct of this characterization, a new, very simple linear time algorithm for triangulating star-shaped polygons is obtained.

    KW - Computational geometry

    KW - Geodesic properties

    KW - Simple polygons

    KW - Triangulation

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

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

    U2 - 10.1007/BF01901482

    DO - 10.1007/BF01901482

    M3 - Article

    VL - 5

    SP - 68

    EP - 74

    JO - Visual Computer

    JF - Visual Computer

    SN - 0178-2789

    IS - 1-2

    ER -