Delineating boundaries for imprecise regions

Authors:
Iris Reinbacher;Marc Benkert;Marc van Kreveld;Joseph S. B. Mitchell;Alexander Wolff
Affiliations:
Institute of Information and Computing Sciences, Utrecht University;Dept. of Comp. Science, Karlsruhe University;Institute of Information and Computing Sciences, Utrecht University;Department of Applied Mathematics and Statistics, State University of New York at Stony Brook;Dept. of Comp. Science, Karlsruhe University
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 8
Cited 4

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
The complexity of computing minimum separating polygons

Pattern Recognition Letters - Special issue on computational geometry
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Spatial information retrieval and geographical ontologies an overview of the SPIRIT project

SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Low-Dimensional Linear Programming with Violations

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Dynamic Planar Convex Hull

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Minimum-link watchman tours

Information Processing Letters
Extracting Spatial Knowledge from the Web

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet

Neighborhood restrictions in geographic IR

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Determining geographic representations for arbitrary concepts at query time

Proceedings of the first international workshop on Location and the web
Location approximation for local search services using natural language hints

International Journal of Geographical Information Science
Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems

Quantified Score

Hi-index	0.00

Visualization

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.