Delineating imprecise regions via shortest-path graphs

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2011, Pages 271-280

  De Berg, Mark ^a   Meulemans, Wouter ^a   Speckmann, Bettina ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

geographic context; shortest path graph; vernacular regions

Indexed keywords

EFFICIENT ALGORITHM; GEOGRAPHIC CONTEXT; NEIGHBORHOOD GRAPHS; NONLOCAL; POINT SET; REGION BOUNDARIES; SHORTEST-PATH; SQUARED EUCLIDEAN DISTANCE; VERNACULAR REGIONS;

ALGORITHMS; GEOGRAPHIC INFORMATION SYSTEMS; GRAPHIC METHODS; INFORMATION SYSTEMS;

GRAPH THEORY;

EID: 84856451114     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2093973.2094010     Document Type: Conference Paper

References (23)

1. H. Alani, C. Jones, and D. Tudhope. Voronoi-based region approximation for geographical information retrieval with gazetteers. Int. Journal of Geographical Information Science, 15(4):287-306, 2001. (Pubitemid 32554965)
2. S. Cabello. Many distances in planar graphs. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, pages 1213-1220, 2006.
3. A. Chaudhuri, B. Chaudhuri, and S. Parui. A Novel Approach to Computation of the Shape of a Dot Pattern and Extraction of Its Perceptual Border. Computer Vision and Image Understanding, 68(3):257-275, 1997. (Pubitemid 127433235)
4. A. Cohn and N. Gotts. The 'egg-yolk' representation of regions with indeterminate boundaries. In Geographic Objects with Indeterminate Boundaries, pages 171-187. Taylor & Francis, 1996.
5. C. Davies, I. Holt, J. Green, J. Harding, and L. Diamond. User Needs and Implications for Modelling Vague Named Places. Spatial Cognition & Computation, 9(3):174-194, 2009.
6. M. de Berg, K. Dobrindt, and O. Schwarzkopf. On lazy randomized incremental construction. Discrete and Computational Geometry, 14(1):261-286, 1995.
7. M. Duckham, L. Kulik, M. Worboys, and A. Galton. Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recognition, 41(10):3224-3236, 2008.
8. M. Erwig and M. Schneider. Vague regions. In Advances in Spatial Databases, LNCS 1262, pages 298-320, 1997.
9. K. Gabriel and R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259-279, 1969.
10. C. Grothe and J. Schaab. Automated Footprint Generation from Geotags with Kernel Density Estimation and Support Vector Machines. Spatial Cognition & Computation, 9(3):195-211, 2009.
11. J. Hershberger and S. Suri. An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM Journal on Computing, 28(6):2215-2256, 1999. (Pubitemid 30530998)
12. L. Hollenstein and R. Purves. Exploring place through user-generated content: Using Flickr tags to describe city cores. Journal of Spatial Information Science, 1:21-48, 2010.
13. C. Jones, R. Purves, P. Clough, and H. Joho. Modelling vague places with knowledge from the Web. Int. Journal of Geographical Information Science, 22(10):1045-1066, 2008.
14. V. King and M. Thorup. A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. In Computing and Combinatorics, LNCS 2108, pages 268-277, 2001.
15. D. Kirkpatrick and J. Radke. A framework for computational morphology. Computational geometry, 85:217-248, 1985.
16. P. Klein. Multiple-source shortest paths in planar graphs. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pages 146-155, 2005.
17. D. Lee and B. Schachter. Two algorithms for constructing a Delaunay triangulation. Int. Journal of Parallel Programming, 9(3):219-242, 1980.
18. W. Meulemans. Modeling and Computation of Vernacular Regions. Master's thesis, Technische Universiteit Eindhoven, 2010.
19. D. Montello, M. Goodchild, J. Gottsegen, and P. Fohl. Where's downtown?: Behavioral methods for determining referents of vague spatial queries. Spatial Cognition & Computation, 3(2&3):185-204, 2003.
20. R. Purves, P. Clough, and H. Joho. Identifying imprecise regions for geographic information retrieval using the web. In Proc. GIS Research UK 13th Annual Conference, pages 313-318, 2005.
21. I. Reinbacher, M. Benkert, M. van Kreveld, J. Mitchell, J. Snoeyink, and A. Wolff. Delineating boundaries for imprecise regions. Algorithmica, 50(3):386-414, 2008.
22. Y. Shiloach and S. Even. An On-Line Edge-Deletion Problem. Journal of the ACM, 28(1):1-4, 1981.
23. R. Wein. Exact and approximate construction of offset polygons. Computer-Aided Design, 39(6):518-527, 2007. (Pubitemid 46755166)