An efficient algorithm for decomposing a polygon into star-shaped polygons

D. Avis, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency of this new decomposition contrasts with the heavy computational burden of existing methods.

    Original languageEnglish (US)
    Pages (from-to)395-398
    Number of pages4
    JournalPattern Recognition
    Volume13
    Issue number6
    DOIs
    StatePublished - Jan 1 1981

    Fingerprint

    Computational efficiency
    Set theory
    Stars
    Decomposition
    Geometry

    Keywords

    • Colouring algorithms
    • Computational geometry
    • Polygonal decomposition
    • Star-shaped polygons
    • Syntactic pattern recognition
    • Triangulation

    ASJC Scopus subject areas

    • Computer Vision and Pattern Recognition
    • Signal Processing
    • Electrical and Electronic Engineering

    Cite this

    An efficient algorithm for decomposing a polygon into star-shaped polygons. / Avis, D.; Toussaint, Godfried.

    In: Pattern Recognition, Vol. 13, No. 6, 01.01.1981, p. 395-398.

    Research output: Contribution to journalArticle

    Avis, D. ; Toussaint, Godfried. / An efficient algorithm for decomposing a polygon into star-shaped polygons. In: Pattern Recognition. 1981 ; Vol. 13, No. 6. pp. 395-398.
    @article{595fd1166b504516a86ba84e421461f3,
    title = "An efficient algorithm for decomposing a polygon into star-shaped polygons",
    abstract = "In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency of this new decomposition contrasts with the heavy computational burden of existing methods.",
    keywords = "Colouring algorithms, Computational geometry, Polygonal decomposition, Star-shaped polygons, Syntactic pattern recognition, Triangulation",
    author = "D. Avis and Godfried Toussaint",
    year = "1981",
    month = "1",
    day = "1",
    doi = "10.1016/0031-3203(81)90002-9",
    language = "English (US)",
    volume = "13",
    pages = "395--398",
    journal = "Pattern Recognition",
    issn = "0031-3203",
    publisher = "Elsevier Limited",
    number = "6",

    }

    TY - JOUR

    T1 - An efficient algorithm for decomposing a polygon into star-shaped polygons

    AU - Avis, D.

    AU - Toussaint, Godfried

    PY - 1981/1/1

    Y1 - 1981/1/1

    N2 - In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency of this new decomposition contrasts with the heavy computational burden of existing methods.

    AB - In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency of this new decomposition contrasts with the heavy computational burden of existing methods.

    KW - Colouring algorithms

    KW - Computational geometry

    KW - Polygonal decomposition

    KW - Star-shaped polygons

    KW - Syntactic pattern recognition

    KW - Triangulation

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

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

    U2 - 10.1016/0031-3203(81)90002-9

    DO - 10.1016/0031-3203(81)90002-9

    M3 - Article

    VL - 13

    SP - 395

    EP - 398

    JO - Pattern Recognition

    JF - Pattern Recognition

    SN - 0031-3203

    IS - 6

    ER -