Computational geometric problems in pattern recognition.

Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

    Original languageEnglish (US)
    Pages (from-to)73-91
    Number of pages19
    JournalUnknown Journal
    StatePublished - Jan 1 1982

    Fingerprint

    pattern recognition
    polygon
    hull
    Pattern Recognition
    Pattern recognition
    Polygon Decomposition
    Design and Analysis of Algorithms
    diagram
    decomposition
    Decomposition
    Voronoi Diagram
    Convex Hull
    Graph in graph theory
    analysis

    ASJC Scopus subject areas

    • Environmental Science(all)
    • Earth and Planetary Sciences(all)

    Cite this

    Computational geometric problems in pattern recognition. / Toussaint, Godfried.

    In: Unknown Journal, 01.01.1982, p. 73-91.

    Research output: Contribution to journalArticle

    @article{4790cdbc6da44a25bc477103de6f4656,
    title = "Computational geometric problems in pattern recognition.",
    abstract = "Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author",
    author = "Godfried Toussaint",
    year = "1982",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "73--91",
    journal = "Theoretical Computer Science",
    issn = "0304-3975",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - Computational geometric problems in pattern recognition.

    AU - Toussaint, Godfried

    PY - 1982/1/1

    Y1 - 1982/1/1

    N2 - Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

    AB - Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

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

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

    M3 - Article

    SP - 73

    EP - 91

    JO - Theoretical Computer Science

    JF - Theoretical Computer Science

    SN - 0304-3975

    ER -