Delineating boundaries for imprecise regions

I. Reinbacher, M. Benkert, M.J. Kreveld, van, J.S.B. Mitchell, A. Wolff

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    6 Citations (Scopus)

    Abstract

    In geographic information retrieval, queries often use names of geographic regions that do not have a well-defined boundary, such as "Southern France." We provide two classes of algorithms for the problem of computing reasonable boundaries of such regions, based on evidence of given data points that are deemed likely to lie either inside or outside the region. Our problem formulation leads to a number of problems related to red-blue point separation and minimum-perimeter polygons, many of which we solve algorithmically. We give experimental results from our implementation and a comparison of the two approaches.
    Original languageEnglish
    Title of host publicationAlgorithms - ESA 2005 : 13th annual european symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings
    EditorsS. Leonardi
    Place of PublicationBerlin
    PublisherSpringer
    Pages143-154
    ISBN (Print)3-540-29118-0
    DOIs
    Publication statusPublished - 2005

    Publication series

    NameLecture Notes in Computer Science
    Volume3669
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'Delineating boundaries for imprecise regions'. Together they form a unique fingerprint.

    Cite this