Generalisation operators of buildings
Abstract
The use of the drawing recognisability norm eliminates the parameter, which has been hitherto determined by the user for the generalisation operators. As a result, the unambiguity of the generalisation process is preserved and its verification is possible.
Keywords:
Full Text:
PDF (Polish)References
Anders K.-H., 2003: A hierarchical graph-clustering approach to find groups of objects. In Technical Paper, ICA Commission on Map Generalization, 5th Workshop on Progress in Automated Map Generalization (Paris: IGN).
Anders K.-H.,Sester M., 2000: Parameter-free cluster detection in spatial databases and its application to typification. In Proceedings of IAPRS, Vol. 33, Amsterdam.
Brassel K., Weibel R., 1988. A review and conceptuał framework of automated map generalization, Intemational Joumal of Geographical Information Systems 2 (3).
Burghardt D., Cecconi A., 2007: Mesh simplification for building typification. International Journal of Geographical Information Science Vol. 21, No. 3, March 2007: 283-298.
Chrobak T., 1999: Badanie przydatności trójkąta elementarnego w komputerowej generalizacji kartograficznej. AGH, Uczelniane Wydawnictwa Naukowo-Dydaktyczne, Kraków.
Chrobak T., 2009: Przydatność osnowy kartograficznej i metody obiektywnego upraszczania obiektów do aktualizacji danych w BDT. Geomatics and Environmental Engineering 3(1/1): 81-90.
Chrobak T., 2010: The role of least image dimensions in generalized of object in spatial databases. Geodesy and Cartography 59(2): 99-120.
Chrobak T., Kozioł K., 2009: Digital cartographic generalization of buldings layer in creating data of the topographical database. Archives of Photogrammetry, Cartography and Remote Sensing vol. 19: 59-69.
Jarvis R., Patrick E., 1973: Clustering using a similarity measure based on shared near neighbours. [In:] IEEE Transactions on Computers, Vol. 22, No 11: 1025-1034.
Kirkpatrick D., Radke J., 1985: A framework for computational morphology. [In:] Toussaint G. (ed.), Computational Geometry, North-Holland, 217-248.
Kozioł K., 2006: Eliminacja obiektów liniowych z zastosowaniem regionów strukturalnych na przykładzie sieci drogowej. Roczniki Geomatyki t. 4, z. 3:109-117, PTIP, Warszawa.
Kozioł K., 2011: Porównanie wybranych algorytmów upraszczania linii na przykładzie reprezentatywnego obszaru testowego. Roczniki Geomatyki t. 9, z. 1: 49-57, PTIP, Warszawa.
Kozioł K., 2012: The importance of fixed points in the simplification process, Archives of Photogrammetry, Cartography and Remote Sensing, Vol. 23: 169-177.
McMaster R. B., 1986: A Statistical Analysis of Mathematical Measures for Linear Simplification. The American Cartographer 13(2): 103-17.
Regnauld N., 1996: Recoginition of building clusters for generalization. [In:] Proceedings of the 7th International Symposium on Spatial Data Handling, Delft, 4B.1-4B.14.
Regnauld N., McMaster. R.B., 2007: A synoptic view of generalisation operators. [In:] Mackaness W.A., Ruas A., Sarjakoski L.T. (eds), Generalisation of geographic information: cartographic modelling and applications. Oxford, UK: Elsevier, 37-66.
Richardson D. E., 1993: Automatic spatial and thematic generalization using a context transformation model. Doctoral dissertation, Wageningen Agricultural University, Ottawa (Canada).
Saliszczew K. A., 1998: Kartografia ogólna. Wydawnictwo Naukowe PWN, Warszawa.
Toussaint G., 1980: The relative neighborhood graph of a finite planar set. [In:] Pattern Recognition, vol. 12: 261-268.
Żukowska M., 2009: Resolving of internal graphic conflicts of broken lines, which shape is subject to simplification. Geomatics and Environmental Engineering vol. 3 no. 1: 61-68.