PDF-Download - Deutsche Geodätische Kommission

LITERATURVERZEICHNIS 117
Rao, S. (1998), Some Studies on Beta-Skeletons, Doktorarbeit, Department of Computer Science & Engineering,
Indian Institute of Technology, Kanpur.
Regnauld, N. (1996), Recognition of Building Clusters for Generalization, in: M. Kraak & M. Molenaar, Hrsg.,
‘Advances in GIS Research, Proc. of 7th Int. Symposium on Spatial Data Handling (SDH)’, Vol. 1, Faculty
of Geod. Engineering, Delft, The Netherlands, Seiten 4B.1–4B.14.
Reinhardt, F. & Soeder, H. (1984), dtv-Atlas zur Mathematik, Band I Grundlagen, Algebra und Geometrie,
Deutscher Taschenbuch Verlag, München. ISBN 3-423-03007-0.
Sachs, L. (1999), Angewandte Statistik: Anwendung statistischer Methoden, Springer-Verlag, Berlin Heidelberg.
ISBN 3-540-65371-6.
Samet, H. (1990), The Design and Analysis of Spatial Data Structures, Addison-Wesley.
Sankoff, D. & Kruskal, J., Hrsg. (1983), Time Warps, String Edits, and Macromolecules: The Theory and
Practice of Sequence Comparsion, Addison-Wesley, Kanpur.
Sedlacek, J. (1971), Einführung in die Graphentheorie, B. G. Teubner Verlagsgesellschaft, Leipzig.
Sester, M. (1995), Lernen struktureller Modelle für die Bildanalyse, Vol. C441, Deutsche Geodätische Kommission,
München.
Sester, M., Anders, K.-H. & Walter, V. (1998), ‘Linking Objects of Different Spatial Data Sets by Integration
and Aggregation’, GeoInformatica 2(4), 335–358.
Shaw, G. & Wheeler, D. (1994), Statistical Techniques in Geographical Analysis, David Fulton, London.
Sniedovich, M., Hrsg. (1992), Dynamic Programming, Marcel Dekker, New York.
Supowit, K. (1983), ‘The relative neighborhood graph, with an application to minimum spanning trees’,
J.Assoc.Comput.Mach. 30, 428–448.
Titterington, D., Smith, A. & Makov, U. (1985), Statistical Analysis of Finite Mixture Distributions, John Wiley
& Sons, New York.
Tobler, W. (1970), ‘A computer movie simulating urban growth in the Detroit region’, Economic Geography
46(2), 234–240.
Toussaint, G. (1980a), ‘Algorithms for computation of relative neighbourhood graph’, Electronic Letters
16(22), 860–861.
Toussaint, G. (1980b), ‘The relative neighborhood graph of a finite planar set’, Pattern Recognition 12, 261–268.
Toussaint, G. (1988), A graph-theoretical primal sketch, in: G. Toussaint, Hrsg., ‘Computational Morphology’,
North-Holland, Seiten 229–260.
Toussaint, G. (1991), Some unsolved problems on proximity graphs, in: D. Dearholt & F. Harary, Hrsg., ‘Proceedings
of the First Workshop on Proximity Graphs. Memoranda in Computer and Cognitive Science
MCCS-91-224’, Computing research laboratory, New Mexico State University, La Cruces.
Ukkonen, E. (1985), ‘Algorithms for approximate string matching’, Information and Control 64, 100–118.
Urquhart, R. (1980), ‘Algorithms for computation of relative neighbourhood graph’, Electronic Letters
16(14), 556–557.
Urquhart, R. (1982), ‘Graph theoretical clustering based on limited neighborhood sets’, Pattern Recognition
15, 173–187.
van Dongen, S. (2000), Graph Clustering by Flow Simulation, Doktorarbeit, Universität Utrecht, Center for
Mathematics and Computer Science (CWI), Amsterdam.
van Schröder, M. (2001), Gebiete optimal aufteilen OR-Verfahren für die Gebietsaufteilung als Anwendungsfall
der gleichmä¨siger Baumzerlegung, Doktorarbeit, Universität Karlsruhe, Fakultät für Wirtschaftswissenschaften.