Delineating Boundaries for Imprecise Regions

Authors:
Iris Reinbacher;Marc Benkert;Marc van Kreveld;Joseph S. B. Mitchell;Jack Snoeyink;Alexander Wolff
Affiliations:
The Hong Kong University of Science and Technology, Department of Computer Science and Engineering, Hong Kong, China;Karlsruhe University, Department of Computer Science, Karlsruhe, Germany;Utrecht University, Institute of Information and Computing Sciences, Utrecht, The Netherlands;State University of New York at Stony Brook, Department of Applied Mathematics and Statistics, Stony Brook, USA;University of North Carolina at Chapel Hill, Department of Computer Science, Chapel Hill, USA;Karlsruhe University, Department of Computer Science, Karlsruhe, Germany
Venue:
Algorithmica
Year:
2008

Citing 0
Cited 3

Bounds for point recolouring in geometric graphs

Computational Geometry: Theory and Applications
Delineating imprecise regions via shortest-path graphs

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Fault recovery in wireless networks: the geometric recolouring approach

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In geographic information retrieval, queries often name geographic regions that do not have a well-defined boundary, such as “Southern France.” We provide two algorithmic approaches to the problem of computing reasonable boundaries of such regions based on data points that have evidence indicating that they lie either inside or outside the region. Our problem formulation leads to a number of subproblems 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.