Thesis (M.S.)--Ohio University, August, 2008. / Title from PDF t.p. Includes bibliographical references.

Thèse (Ph. D.)--Université Laval, 2006. / Bibliogr.: f. 161-205. Publié aussi en version électronique dans la Collection Mémoires et thèses électroniques.

Thèse (M.Sc.)--Université Laval, 2007. / Bibliogr.: f. [115]-120. Publié aussi en version électronique dans la Collection Mémoires et thèses électroniques.

Thesis (M.S.)-- Brigham Young University. Department of Geography. / Bibliography: leaves 83-84.

This thesis describes a doctoral project which has addressed some of the problems of automatically performing cartographic generalization in a holistic manner, that is, processing the map features in the context of the whole map rather than individual features in isolation. The approach is based on two key ideas: firstly, that the map surface can be represented by a structure based on simplicial complexes which provides useful relationships for topology and proximity and facilitates many of the fundamental generalization operations. Secondly, that the epistemological structures needed for generalization can be represented by a hierarchy of "context" frames, each of which encapsulate the knowledge required to recognize, generalize and resolve a cartographic situation. A data structure that uses simplicial complexes to represent map objects has been designed and implemented. Each object is described by a set of two-dimensional simplices (triangles) that are maintained in the form of a constrained Delaunay triangulation. This structure gives a fully connected two-dimensional plenum that stores important spatial relationships such as "enclosed", "adjacent" and "between" explicitly. This simplicial data structure (SDS), as it is called, can be used directly to perform several types of operations necessary for automatic generalization, for example, automatic overlap detection, displacement, merging, enlargement, simplification of building outlines and skeletonization. Algorithms for many of these operators have been implemented while others are proposed. Pseudo-code and descriptions are used to document many of these operators, results are given and discussed. A frame-based architecture is proposed which provides a framework for the representation and application of knowledge for generalization. The project was funded by an EPSRC CASE studentship in collaboration with the Ordnance Survey.

Includes railroad lines in Alabama, Georgia, Tennessee, South Carolina, North Carolina, Kentucky, and Virginia. Highlights line from Spartanburg to Elkhorn. Prepared by Traffic Dept. May 1909. Revised August 1, 1911. Revised April 3, 1913. Revised October 14, 1916. X-929. No scale provided. / https://dc.etsu.edu/rare-maps/1158/thumbnail.jpg

Highlights railroad lines from Atlanta to Memphis and north to Paducah, Kentucky. Indicates battlefields and national cemeteries. Copyright 1906 by Nashville, Chattanooga, and St. Louis Railway. Scale 1 in = 11 statute miles. / https://dc.etsu.edu/rare-maps/1159/thumbnail.jpg

Indicates numerous railroad lines from Florida to New York and west to the Mississippi, including line from Spartanburg to Elkhorn City in red. M.B. Brown Printing and Binding Company, N.Y. No scale provided. / https://dc.etsu.edu/rare-maps/1157/thumbnail.jpg

No description available.

No description available.