Written by experts, Digital Terrain Modeling: Principles and Methodology provides comprehensive coverage of recent developments in the field. The topics include terrain analysis, sampling strategy, acquisition methodology, surface modeling principles, triangulation algorithms, interpolation techniques, on-line and off-line quality control in data a

Building generalization is a difficult operation due to the complexity of the spatial distribution of buildings and for reasons of spatial recognition. In this study, building generalization is decomposed into two steps, i.e. building grouping and generalization execution. The neighbourhood model in urban morphology provides global constraints for guiding the global partitioning of building sets on the whole map by means of roads and rivers, by which enclaves, blocks, superblocks or neighbourhoods are formed; whereas the local constraints from Gestalt principles provide criteria for the further grouping of enclaves, blocks, superblocks and/or neighbourhoods. In the grouping process, graph theory, Delaunay triangulation and the Voronoi diagram are employed as supporting techniques. After grouping, some useful information, such as the sum of the building's area, the mean separation and the standard deviation of the separation of buildings, is attached to each group. By means of the attached information, an appropriate operation is selected to generalize the corresponding groups. Indeed, the methodology described brings together a number of well-developed theories/techniques, including graph theory, Delaunay triangulation, the Voronoi diagram, urban morphology and Gestalt theory, in such a way that multiscale products can be derived.

This article describes a new set of algorithms for locally–adaptive line generalization based on the so-called natural principle of objective generalization. The drawbacks of existing methods of line generalization are briefly discussed and the algorithms described. The performance of these new methods is compared with benchmarks based on both manual cartographic procedures and a standard method found in many geographical information systems.

This article proposes an efficient solution algorithm to aid travelers' route choice decisions in road network with travel time uncertainty, in the context of advanced traveler information systems (ATIS). In this article, the travel time of a link is assumed to be spatially correlated only to the neighboring links within a local ‘impact area.’ Based on this assumption, the spatially dependent reliable shortest path problem (SD-RSPP) is formulated as a multicriteria shortest path-finding problem. The dominant conditions for the SD-RSPP are established in this article. A new multicriteria A* algorithm is proposed to solve the SD-RSPP in an equivalent two-level hierarchical network. A case study using real-world data shows that link travel times are, indeed, only strongly correlated within the local impact areas; and the proposed limited spatial dependence assumption can well approximate path travel time variance when the size of the impact area is sufficiently large. Computational results demonstrate that the size of the impact area would have a significant impact on both accuracy and computational performance of the proposed solution algorithm.

Models of spatial relations are a key component of geographical information science (GIS). Efforts have been made to formally define spatial relations. The foundation model for such a formal presentation is the 4-intersection model proposed by Egenhofer and Franzosa (1991). In this model, the topological relations between two simple spatial entities A and B are transformed into pointset topology problems in terms of the intersections of A's interior and boundary with B's interior and boundary. Later, Egenhofer and Herring (1991) extended this model to 9-intersection by addition of another element, i.e. the exterior of an entity, which is then defined as its complement. However, the use of its complement as the exterior of an entity causes the linear dependency between its interior, boundary and exterior. Thus such an extension from 4- to 9-intersection should be of no help in terms of the number of relations. This can be confirmed by the discovery of Egenhofer et al. (1993). The distinction of additional relations in the case where the co-dimension is not zero is purely due to the adoption of definitions of the interior, boundary and exterior of entities in a lower dimensional to a higher dimension of space, e.g. lines in 1-dimensional space to 2-dimensional space. With such adoption, the topological convention that the boundary of a spatial entity separates its interior from its exterior is violated. It is such a change of conventional topological properties that causes the linear dependency between these three elements of a spatial entity (i.e. the interior, boundary and exterior) to disappear, thus making the distinction of additional relations possible in such a case (i.e. the co-dimension is not zero). It has been discussed that the use of Voronoi-regions of an entity to replace its complement as its exterior in the 9-intersection model would solve the problem (i.e. violation of topological convention) or would make this model become more comprehensive. Therefore, a Voronoi-based 9-intersection model is proposed. In addition to the improvement in the theoretical aspect, the Voronoi-based 9-intersection model (V9I) can also distinguish additional relations which are beyond topological relations, such as high-resolution disjoint relations and relations of complex spatial entities. However, high-resolution disjoint relations defined by this model are not purely topological. In fact, it is a mixture of topology and metric.