Delineating boundaries for imprecise regions

Algorithmica (New York)

Volumn 50, Issue 3, 2008, Pages 386-414

  Reinbacher, Iris ^a   Benkert, Marc ^c   Van Kreveld, Marc ^b   Mitchell, Joseph S B ^d   Snoeyink, Jack ^e   Wolff, Alexander ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UTRECHT UNIVERSITY   (Netherlands)

^c UNIVERSITY OF KARLSRUHE   (Germany)

^d Stony Brook University   (United States)

^e Brooks Computer Science Building   (United States)

Author keywords

Computational geometry; Imprecise regions; Red blue separation

Indexed keywords

IMPRECISE REGIONS; RED BLUE SEPARATION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; GEOGRAPHIC INFORMATION SYSTEMS; PROBLEM SOLVING; QUERY PROCESSING;

INFORMATION RETRIEVAL;

EID: 38349084457     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9042-5     Document Type: Article

References (27)

1. Agarwal, P.K., Suri, S.: Surface approximation and geometric partitions. SIAM J. Comput. 27, 1016-1035 (1998)
2. Arampatzis, A., van Kreveld, M., Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H., Sanderson, M.: Web-based delineation of imprecise regions. Comput. Environ. Urban Syst. (CEUS) 30, 436-459 (2006)
3. Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Bicriteria shortest path problems in the plane. In: Proc. 3rd Canad. Conf. Comput. Geom., pp. 153-156 (1991)
4. Arkin, E.M., Khuller, S., Mitchell, J.S.B.: Geometric knapsack problems. Algorithmica 10, 399-427 (1993)
5. Arkin, E.M., Hurtado, F., Mitchell, J.S.B., Seara, C., Skiena, S.S.: Some separability problems in the plane. In: Abstracts 16th European Workshop Comput. Geom., pp. 51-54. Ben-Gurion University of the Negev (2000)
6. Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Minimum-link watchman tours. Inf. Process. Lett. 86(4), 203-207 (May 2003)
7. Arora, S., Chang, K.: Approximation schemes for degree-restricted MST and red-blue separation problem. Algorithmica 40(3), 189-210 (2004)
8. Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. 43rd IEEE Sympos. Found. Comput. Sci., pp. 617-626 (2002)
9. Chan, T.M.: Low-dimensional linear programming with violations. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 570-579 (2002)
10. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)
11. Eades, P., Rappaport, D.: The complexity of computing minimum separating polygons. Pattern Recognit. Lett. 14, 715-718 (1993)
12. Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol. 10. Springer, Heidelberg (1987)
13. Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. IEEE Trans. Inf. Theory IT-29, 551-559 (1983)
14. Garson, G.D., Biggs, R.S.: Analytic Mapping and Geographic Databases. Sage, Newbury Park (1992)
15. Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209-233 (1987)
16. Jones, C., Purves, R., Ruas, A., Sanderson, M., Sester, M., van Kreveld, M., Weibel, R.: Spatial information retrieval and geographical ontologies-an overview of the SPIRIT project. In: Proc. 25th Annu. Int. Conf. on Research and Development in Information Retrieval (SIGIR 2002), pp. 387-388 (2002)
17. Markowetz, A., Brinkhoff, T., Seeger, B.: Exploiting the Internet as a geospatial database. In: Workshop on Next Generation Geospatial Information, 2003
18. Mitchell, J.S.B.: Approximation algorithms for geometric separation problems. Technical Report, Department of Applied Mathematics, SUNY Stony Brook, NY (July 1993)
19. Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28, 1298-1309 (1999)
20. Morimoto, Y., Aono, M., Houle, M., McCurley, K.: Extracting spatial knowledge from the Web. In: Proc. IEEE Sympos. on Applications and the Internet (SAINT'03), pp. 326-333 (2003)
21. Núñez, Y., Rappaport, D.: Tight bounds for point recoloring. In: Proc. 18th Canad. Conf. Comput. Geometry, pp. 67-70 (2006)
22. O'Sullivan, D., Unwin, D.J.: Geographic Information Analysis. Wiley, New York (2003)
23. Piatko, C.D.: Geometric bicriteria optimal path problems. Ph.D. thesis, Cornell University (1993)
24. Purves, R.S., Clough, P., Joho, H.: Identifying imprecise regions for geographic information retrieval using the web. In: Proceedings of GISRUK 2005, Glasgow, pp. 313-318 (2005)
25. Seara, C.: On geometric separability. Ph.D. thesis, Universitat Polytècnica de Catalunya, Barcelona (2002)
26. Sharir, M., Welzl, E.: On the number of crossing-free matchings (cycles, and partitions). In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 860-869 (2006)
27. Toussaint, G.: Pattern recognition pages, http://cgm.cs.mcgill.ca/ ~godfried/teaching/pr-web.html