Time geography is an elegant framework for analyzing human activity–travel behaviors across temporal and spatial dimensions. At the core of this framework are the concepts of space–time paths, which represent historical trajectories, and space–time prisms, which define potential future activity spaces. However, most studies examine space–time paths and prisms in isolation, overlooking the integrative nature of time geography as a theoretical framework that incorporates the past, present, and future within a continuous temporal dimension. This study addresses this gap by developing novel methods for measuring and querying the spatiotemporal proximity of these heterogeneous and heterochronous time-geographic entities. To operationalize these methods, a GIS tool was implemented to support the local density analysis of time-geographic entities. Comprehensive computational experiments were conducted to validate the developed methods using large-scale, network-constrained, and time-geographic datasets. The developed methods exhibited high computational efficiency (approximately 2 s) in computing the local density for each path within extensive prism collections. The experimental results demonstrate the effectiveness of the developed methods in analyzing and visualizing the local density of historical paths in the near future. The methods offer new insights into space–time interactions, advancing research in human mobility forecasting and spatial decision-making.

Data mining of network-constrained trajectories has broad applications in the GIScience field. The calculation of a complete trajectory similarity matrix is a key step in various data mining algorithms. However, computing this matrix is computationally intensive for large datasets, as it involves numerous point-to-point shortest-path (PPSP) queries. To tackle this issue, we propose a new spatiotemporal construct called the space-time tree, which directly delineates the network distance from a query trajectory to any network space-time point. By constructing the space-time tree, we can efficiently compute the trajectory similarity matrix without additional PPSP queries. The space-time tree supports several similarity metrics, including closest pair distance, furthest pair distance, longest common subsequence (LCSS), and distance-weighted LCSS. It can further integrate with advanced spatiotemporal query techniques for scalable partial trajectory similarity matrix calculations. A case study using real datasets was conducted to apply the space-time tree in the trajectory clustering application. The results show that the space-time tree completed the clustering task on 0.5 million trajectories within 49 minutes, achieving a nearly 147-fold speedup compared to state-of-the-art methods.

There is a growing interest in the optimization of vehicle fleets management in urban environments. However, limited attention has been paid to the integrated optimization of electric taxi fleets accounting for different operations as well as complex spatiotemporal demand dynamics. To this end, this study develops a real-time recommendation framework based on deep reinforcement learning (DRL) for electric taxis (E-taxis) to improve their system performance with explicit modeling of multiple vehicle actions and varying travel demand across space and over time. Spatiotemporal patterns of urban taxi travels are extracted from large-scale taxi trajectories. Spatiotemporal strategies are proposed to coordinate E-taxis’ repositioning and recharging with optimized recommendation for next destinations and charging stations. A spatiotemporal double deep Q-network (ST-DDQN) is embedded in the DRL framework to maximize the daily profit. A prototype real-time recommendation system for E-taxis is implemented for the decision-making of E-taxi drivers and sensitivity analyses are carried out. The experimental results in Shenzhen, China suggest that the proposed framework could improve the overall performance. This study will benefit the promotion of connected E-taxis and the development of clean and smart transportation.

Clustering the trajectories of vehicles moving on road networks is a key data mining technique for understanding human mobility patterns, as well as their interactions with urban environments. The development of efficient and scalable trajectory clustering algorithms, however, still faces challenges because of the computational costs when measuring similarities among a large number of network-constrained trajectories. To address this problem, a novel trajectory clustering framework based on the well-developed Density-Based Spatial Clustering of Applications with Noise (DBSCAN) approach is proposed. This proposed framework accurately quantifies similarities using a trajectory representation of continuous polylines in the space and time dimensions, and does not require trajectory discretization. Further, the proposed framework utilizes the space-time buffering concept to formulate ε-neighborhood queries that directly retrieve the ε-neighbors of trajectories and thus avoids computing a trajectory similarity matrix. State-of-the-art trajectory databases and index structures are incorporated to further improve trajectory clustering performance. A comprehensive case study was carried out using an open dataset of 20,161 trajectories. Results show that the proposed framework efficiently executed trajectory clustering on the large test dataset within 3 min. This was approximately 2,700 times faster than existing DBSCAN algorithms.

The availability of Spatiotemporal Big Data has provided a golden opportunity for time geographical studies that have long been constrained by the lack of individual-level data. However, how to store, manage, and query a huge number of time geographic entities effectively and efficiently with complex spatiotemporal characteristics and relationships poses a significant challenge to contemporary GIS platforms. In this article, a hierarchical compressed linear reference (CLR) model is proposed to transform network-constrained time geographic entities from three-dimensional (3D) (x, y, t) space into two-dimensional (2D) space. Accordingly, time geographic entities can be represented as 2D spatial entities and stored in a classical spatial database. The proposed CLR model supports a hierarchical linear reference system (LRS) including not only underlying a link-based LRS but also multiple higher-level route-based LRSs. In addition, an LRS-based spatiotemporal index structure is developed to index both time geographic entities and the corresponding hierarchical network. The results of computational experiments on large datasets of space–time paths and prisms show that the proposed hierarchical CLR model is effective at storing and managing time geographic entities in road networks. The developed index structure achieves satisfactory query performance in milliseconds on large datasets of time geographic entities.

Understanding the relationship between mixed land use and urban vibrancy is vital in advanced urban planning applications. This study presents a Bayesian spatially varying coefficient (SVC) model to explore the spatially nonstationary relationship between mixed land use and urban vibrancy after controlling for other factors. We first use the convolutional conditional autoregressive prior to accommodate the ecological bias resulting from unobserved confounders. Then we develop our approach in the case of a single predictor to allow the spatially varying coefficient process. We further introduce a type of the Bayesian SVC model that considers the stratified heterogeneity of the outcome, allowing the coefficients to simultaneously vary at the local and subregion level. We illustrate the proposed model by conducting a case study in Shenzhen using mobile phone data, an officially registered point-of-interest (POI) dataset, and several supplementary datasets. The model evaluation results show that including spatially unstructured and structured component combinations can improve the model's fitness and predictive ability; additionally, considering spatial stratified heterogeneity can further enhance the model's performance. Our findings provide an alternative for measuring the variable local-scale association between mixed-use and urban vibrancy and offer new insights that broaden the fields of environmental science and spatial statistics.

Existing traffic monitoring approaches cannot completely cover all road segments in real-time, leading to massive amounts of missing traffic data, which limits the implementation of intelligent transportation systems. Most existing methods lack deep mining of the unique spatiotemporal characteristics of traffic flows, resulting in difficulty in application to urban traffic with complex topologies and variable states. In this paper, we propose a novel Spatio-Temporal constrained Low-Rank Tensor Completion (ST-LRTC) method, which adopts a manifold embedding approach to depict the local geometric structure of spatiotemporal domains. Specifically, under the low-rank assumption, the method introduces temporal constraints based on the continuity and periodicity of traffic flow and a spatial constraint matrix reflecting the traffic flow transmission mechanism. We embed low-dimensional spatiotemporal constraint matrices into the low-rank tensor completion solving process to fully utilize the global features and local spatiotemporal characteristics of the traffic tensor. Experiments were performed using traffic data from Xi’an, China, and the results indicated that ST-LRTC outperformed state-of-the-art methods under various missing rates and patterns. Thorough experiments have demonstrated that the incorporation of spatiotemporal analysis can enhance the adaptability of the tensor completion model to complex urban scenarios, which guarantees better monitoring, diagnosis, and optimization of urban traffic states.

Sewer pipe is an essential infrastructure in the city as it undertakes the transportation and circulation of wastewater resources. But sewer pipe it is easy to have faults and cause serious secondary urban accidents, such as road holes and road collapse. Because of the complex underground circumstance, inspecting large-area sewer pipes using closed-circuit television or periscope television is difficult. In this study, we proposed a collaborative sewer pipe inspection approach by using novel low-cost pipe robotic capsules, which capture the images of the pipeline inner walls when floating with the water flow. A set of workers collaboratively drop and salvage capsules to cover a large-area pipe network. The routes of workers and pipe capsules are optimized by a meta-heuristic algorithm integrating local search and simulated annealing. The deep neural network is used to recognize faults from raw captured images. A field experiment in Shenzhen was conducted to evaluate the performance of the proposed approach. The results demonstrate that it outperforms the naive inspection method with a shorter travel distance and less waiting time. It is also effective for inspecting the large-area sewer pipe networks with an overall precision of 0.92. It will help us to eliminate the potential safety risk of the public and promote the level of urban governance.

Understanding population distribution has excellent applications for planning and provision of municipal services. This study aims to explore the space-time structure of population distribution with area-level mobile phone data. We discuss a kind of Bayesian hierarchical models, fitted by Markov chain Monte Carlo simulation, that combines the overall spatial pattern and temporal trends as well as the departures from these stable components. We carry out an empirical study in Shenzhen, China, using the area-level mobile phone users in 24 hours. The results indicate that the estimation of the overall spatial pattern is not deteriorated when using a sophisticated spatio-temporal model. The temporal trend exhibits a reasonable fluctuation during the study period. Then we apply two rules to detect areas showing unstable trends of population fluctuation based on the posterior probabilities of the space-time interactions. We also include the population statistics and indices for mixed-use to explore the spatial pattern of population fluctuation. Our findings confirm that the Bayesian spatio-temporal model can enhance the understanding of the space-time variability of population distribution using mobile phone data. Further research should examine the spatial nonstationary effects of explanatory factors on mobile phone-based population fluctuation.

Global positioning system (GPS) data generated from taxi trips is a valuable source of information that offers an insight into travel behaviours of urban populations with high spatio-temporal resolution. However, in its raw form, GPS taxi data does not offer information on the purpose (or intended activity) of travel. In this context, to enhance the utility of taxi GPS data sets, we propose a two-layer framework to identify the related activities of each taxi trip automatically and estimate the return trips and successive activities after the trip, by using geographic point-of-interest (POI) data and a combination of spatio-temporal clustering, Bayesian inference and Monte Carlo simulation. Two million taxi trips in New York, the United States of America, and ten million taxi trips in Shenzhen, China, are used as inputs for the two-layer framework. To validate each layer of the framework, we collect 6,003 trip diaries in New York and 712 questionnaire surveys in Shenzhen. The results show that the first layer of the framework performs better than comparable methods published in the literature, while the second layer has high accuracy when inferring return trips.

Pedestrian networks play an important role in various applications, such as pedestrian navigation services and mobility modeling. This paper presents a novel method to extract pedestrian networks from crowdsourced tracking data based on a two-layer framework. This framework includes a walking pattern classification layer and a pedestrian network generation layer. In the first layer, we propose a multi-scale fractal dimension (MFD) algorithm in order to recognize the two different types of walking patterns: walking with a clear destination (WCD) or walking without a clear destination (WOCD). In the second layer, we generate the pedestrian network by combining the pedestrian regions and pedestrian paths. The pedestrian regions are extracted based on a modified connected component analysis (CCA) algorithm from the WOCD traces. We generate the pedestrian paths using a kernel density estimation (KDE)-based point clustering algorithm from the WCD traces. The pedestrian network generation results using two actual crowdsourced datasets show that the proposed method has good performance in both geometrical correctness and topological correctness.

The rapid development of information and communication technology and the popularization of mobile devices have generated a large number of spatiotemporal trajectory data. Trajectory data can be applied to location prediction, which is significant for urban traffic planning and location-based service. Although various methods for personal location prediction have been proposed, the historical trajectory data of some users is always sparse in practical applications, resulting in poor prediction precision of prediction models based on personal historical data for those sparse users. Targeting on this challenge, we propose an "Individual trajectory-Group trajectory assist Individual trajectory" location prediction model (ITGTAIT) by utilizing the group travel patterns to assist in predicting personal locations. First, the model conducts a spatial clustering algorithm on trajectory points to construct the clustering link. Second, the clustering link and Fano's inequality are used to estimate the predictability of the next location. Third, a Variable Order Markov Model that named Prediction by Partial Match (PPM) was adopted to predict the clustering link based on the individual trajectory for users with sufficient data. For users with sparse samples, the PPM utilizes the pattern of group travels, which using the group trajectory to assist individual trajectory. Finally, our method was evaluated by using 608,712 trajectory points from 5000 volunteers at Shenzhen city, China. The result shows that a) with the increase of training data, the precision of the ITGTAIT is gradually stable, b) for users with over four days of data, the highest precision is 87.11%, stable at about 82%, c) for users with only 1-3 days of data, the prediction precision is 55.15%, 67.04%, and 76.86% respectively, which introduces approximately 10.76%, 10.98% and 6.83% performance gains on location predictions respectively by utilizing the group characters.

Sampling fraction is crucial to sampling-related studies and applications, especially in the big data era when most data are neither originally designed nor controllable in the data collection process. A common concern among researchers is ‘what’s the modelling accuracy when using a sample?’. Taking intra-city human mobility as the study objective, this study utilizes a simple and direct method to analyse the influences of various sampling fractions on modelling accuracy. Five common intra-city human mobility indicators (travel distance, travel time, travel frequency, radius of gyration and movement entropy) are evaluated considering mean value, median and probability distribution. Experimental results demonstrate that the representativeness of each considered indicator converges to 1 in its own unique rate and variances. The minimum required sampling fractions to satisfy specific accuracies differ for various indicators and evaluation measures. To further investigate how related factors influence the modelling accuracy of sampling fractions, additional experiments are conducted considering multiple sampling methods, study scopes, and data sources. Several interesting general findings are observed. This study provides a reference for other sampling-based applications.

Lane-level road network updating is crucial for urban traffic applications that use geographic information systems contributing to, for example, intelligent driving, route planning and traffic control. Researchers have developed various algorithms to update road networks using sensor data, such as high-definition images or GPS data; however, approaches that involve change detection for road networks at lane level using GPS data are less common. This paper presents a novel method for automatic change detection of lane-level road networks based on GPS trajectories of vehicles. The proposed method includes two steps: map matching at lane level and lane-level change recognition. To integrate the most up-to-date GPS data with a lane-level road network, this research uses a fuzzy logic road network matching method. The proposed map-matching method starts with a confirmation of candidate lane-level road segments that use error ellipses derived from the GPS data, and then computes the membership degree between GPS data and candidate lane-level segments. The GPS trajectory data is classified into successful or unsuccessful matches using a set of defuzzification rules. Any topological and geometrical changes to road networks are detected by analysing the two kinds of matching results and comparing their relationships with the original road network. Change detection results for road networks in Wuhan, China using collected GPS trajectories show that these methods can be successfully applied to detect lane-level road changes including added lanes, closed lanes and lane-changing and turning rules, while achieving a robust detection precision of above 80%.

Spatiotemporal proximity analysis to determine spatiotemporal proximal paths is a critical step for many movement analysis methods. However, few effective methods have been developed in the literature for spatiotemporal proximity analysis of movement data. Therefore, this study proposes a space-time-integrated approach for spatiotemporal proximal analysis considering space and time dimensions simultaneously. The proposed approach is based on space-time buffering, which is a natural extension of conventional spatial buffering operation to space and time dimensions. Given a space-time path and spatial tolerance, space-time buffering constructs a space-time region by continuously generating spatial buffers for any location along the space-time path. The constructed space-time region can delimit all space-time locations whose spatial distances to the target trajectory are less than a given tolerance. Five space-time overlapping operations based on this space-time buffering are proposed to retrieve all spatiotemporal proximal trajectories to the target space-time path, in terms of different spatiotemporal proximity metrics of space-time paths, such as Fréchet distance and longest common subsequence. The proposed approach is extended to analyze space-time paths constrained in road networks. The compressed linear reference technique is adopted to implement the proposed approach for spatiotemporal proximity analysis in large movement datasets. A case study using real-world movement data verifies that the proposed approach can efficiently retrieve spatiotemporal proximal paths constrained in road networks from a large movement database, and has significant computational advantage over conventional space-time separated approaches.

Travel time uncertainty has significant impacts on individual activity-travel scheduling, but at present these impacts have not been considered in most accessibility studies. In this paper, an accessibility evaluation framework is proposed for urban areas with uncertain travel times. A reliable space-time service region (RSTR) model is introduced to represent the space-time service region of a facility under travel time uncertainty. Based on the RSTR model, four reliable place-based accessibility measures are proposed to evaluate accessibility to urban services by incorporating the effects of travel time reliability. To demonstrate the applicability of the proposed framework, a case study using large-scale taxi tracking data is carried out. The results of the case study indicate that the proposed accessibility measures can evaluate large-scale place-based accessibility well in urban areas with uncertain travel times. Conventional place-based accessibility indicators ignoring travel time reliability can significantly overestimate the accessibility to urban services.

Pedestrian navigation at night should differ from daytime navigation due to the psychological safety needs of pedestrians. For example, pedestrians may prefer better-illuminated walking environments, shorter travel distances, and greater numbers of pedestrian companions. Route selection at night is therefore a multi-objective optimization problem. However, multi-objective optimization problems are commonly solved by combining multiple objectives into a single weighted-sum objective function. This study extends the artificial bee colony (ABC) algorithm by modifying several strategies, including the representation of the solutions, the limited neighborhood search, and the Pareto front approximation method. The extended algorithm can be used to generate an optimal route set for pedestrians at night that considers travel distance, the illumination of the walking environment, and the number of pedestrian companions. We compare the proposed algorithm with the well-known Dijkstra shortest-path algorithm and discuss the stability, diversity, and dynamics of the generated solutions. Experiments within a study area confirm the effectiveness of the improved algorithm. This algorithm can also be applied to solving other multi-objective optimization problems.

Understanding urban functions and their relationships with human activities has great implications for smart and sustainable urban development. In this study, we present a novel approach to uncovering urban functions by aggregating human activities inferred from mobile phone positioning and social media data. First, the homes and workplaces (of travelers) are estimated from mobile phone positioning data to annotate the activities conducted at these locations. The remaining activities (such as shopping, schooling, transportation, recreation and entertainment) are labeled using a hidden Markov model with social knowledge learned from social media check-in data over a lengthy period. By aggregating identified human activities, hourly urban functions are inferred, and the diurnal dynamics of those functions are revealed. An empirical analysis was conducted for the case of Shenzhen, China. The results indicate that the proposed approach can capture citywide dynamics of both human activities and urban functions. It also suggests that although many urban areas have been officially labeled with a single land-use type, they may provide different functions over time depending on the types and range of human activities. The study demonstrates that combining different data on human activities could yield an improved understanding of urban functions, which would benefit short-term urban decision-making and long-term urban policy making.

Although mixed use is an emerging strategy that has been widely accepted in urban planning for promoting neighbourhood vibrancy, there is no consensus on how to quantitatively measure the mix and the effects of mixed use on neighbourhood vibrancy. Shannon entropy, the most commonly used diversity measurement in assessing mixed use, has been found to be inadequate in measuring the multifaceted, multidimensional characteristics of mixed use. And lack of data also makes it difficult to find the relationship between mixed use and neighbourhood vibrancy. However, the recent availability of new sources including mobile phone data and Point of Interest (POI) data have made it possible to develop new indices of mixed use and neighbourhood vibrancy to analyse their relationships. Taking advantage of these emerging new data sources, this study used the numbers of mobile phone users in a 24-hour period as a proxy of neighbourhood vibrancy and used POIs from a navigation database to develop a series of mixed-use indicators that can better reflect the multifaceted, multidimensional characteristics of mixed-use neighbourhoods. The Hill numbers, a unified form of diversity measurement used in ecological literature that includes richness, entropy, and the Simpson index, are used to measure the degrees of mixed use. Using such fine-grained data sets and the Hill numbers allowed us to obtain better insights into the relationship between mixed use and neighbourhood vibrancy. Four models varying in POI measurements that reflect different dimensions of mixed use were presented. The results showed that either POI density or entropy can explain approximately 1% of neighbourhood vibrancy, while POI richness contributes significantly in improving neighbourhood vibrancy. The results also revealed that the entropy has limitations as a measure for representing mixed use and demonstrated the necessity of adopting a set of more appropriate measurements for mixed use. Increasing the number of POIs has limited power to improve neighbourhood vibrancy compared with encouraging the mixing of complementary POIs. These exploratory findings may be useful for adjusting mixed-use assessments and to help guide urban planning and neighbourhood design.

There has been a resurgence of interest in time geography studies due to emerging spatiotemporal big data in urban environments. However, the rapid increase in the volume, diversity, and intensity of spatiotemporal data poses a significant challenge with respect to the representation and computation of time geographic entities and relations in road networks. To address this challenge, a spatiotemporal data model is proposed in this article. The proposed spatiotemporal data model is based on a compressed linear reference (CLR) technique to transform network time geographic entities in three-dimensional (3D) (x, y, t) space to two-dimensional (2D) CLR space. Using the proposed spatiotemporal data model, network time geographic entities can be stored and managed in classical spatial databases. Efficient spatial operations and index structures can be directly utilized to implement spatiotemporal operations and queries for network time geographic entities in CLR space. To validate the proposed spatiotemporal data model, a prototype system is developed using existing 2D GIS techniques. A case study is performed using large-scale datasets of space-time paths and prisms. The case study indicates that the proposed spatiotemporal data model is effective and efficient for storing, managing, and querying large-scale datasets of network time geographic entities.

Kernel Density Estimation (KDE) is an important approach to analyse spatial distribution of point features and linear features over 2-D planar space. Some network-based KDE methods have been developed in recent years, which focus on estimating density distribution of point events over 1-D network space. However, the existing KDE methods are not appropriate for analysing the distribution characteristics of certain kind of features or events, such as traffic jams, queue at intersections and taxi carrying passenger events. These events occur and distribute in 1-D road network space, and present a continuous linear distribution along network. This paper presents a novel Network Kernel Density Estimation method for Linear features (NKDE-L) to analyse the space–time distribution characteristics of linear features over 1-D network space. We first analyse the density distribution of each linear feature along networks, then estimate the density distribution for the whole network space in terms of the network distance and network topology. In the case study, we apply the NKDE-L to analyse the space–time dynamics of taxis’ pick-up events, with real road network and taxi trace data in Wuhan. Taxis’ pick-up events are defined and extracted as linear events (LE) in this paper. We first conduct a space–time statistics of pick-up LE in different temporal granularities. Then we analyse the space–time density distribution of the pick-up events in the road network using the NKDE-L, and uncover some dynamic patterns of people’s activities and traffic condition. In addition, we compare the NKDE-L with quadrat method and planar KDE. The comparison results prove the advantages of the NKDE-L in analysing spatial distribution patterns of linear features in network space.

Map matching method is a fundamental preprocessing technique for massive probe vehicle data. Various transportation applications need map matching methods to provide highly accurate and stable results. However, most current map matching approaches employ elementary geometric or topological measures, which may not be sufficient to encode the characteristic of realistic driving paths, leading to inefficiency and inaccuracy, especially in complex road networks. To address these issues, this article presents a novel map matching method, based on the measure of curvedness of Global Positioning System (GPS) trajectories. The curvature integral, which measures the curvedness feature of GPS trajectories, is considered to be one of the major matching characteristics that constrain pairwise matching between the two adjacent GPS track points. In this article, we propose the definition of the curvature integral in the context of map matching, and develop a novel accurate map matching algorithm based on the curvedness feature. Using real-world probe vehicles data, we show that the curvedness feature (CURF) constrained map matching method outperforms two classical methods for accuracy and stability under complicated road environments.

Large-scale global positioning system (GPS) positioning information of floating cars has been recognised as a major data source for many transportation applications. Mapping large-scale low-frequency floating car data (FCD) onto the road network is very challenging for traditional map-matching (MM) algorithms developed for in-vehicle navigation. In this paper, a multi-criteria dynamic programming map-matching (MDP-MM) algorithm is proposed for online matching FCD. In the proposed MDP-MM algorithm, the MDP technique is used to minimise the number of candidate routes maintained at each GPS point, while guaranteeing to determine the best matching route. In addition, several useful techniques are developed to improve running time of the shortest path calculation in the MM process. Case studies based on real FCD demonstrate the accuracy and computational performance of the MDP-MM algorithm. Results indicated that the MDP-MM algorithm is competitive with existing algorithms in both accuracy and computational performance.

Local search heuristics for very large-scale vehicle routing problems (VRPs) have made remarkable advances in recent years. However, few local search heuristics have focused on the use of the spatial neighborhood in Voronoi diagrams to improve local searches. Based on the concept of a k-ring shaped Voronoi neighbor, we propose a Voronoi spatial neighborhood-based search heuristic and algorithm to solve very large-scale VRPs. In this algorithm, k-ring Voronoi neighbors of a customer are limited to building and updating local routings, and rearranging local routings with improper links. This algorithm was evaluated using four sets of benchmark tests for 200–8683 customers. Solutions were compared with specific examples in the literature, such as the one-depot VRP. This algorithm produced better solutions than some of the best-known benchmark VRP solutions and requires less computational time. The algorithm outperformed previous methods used to solve very large-scale, real-world distance constrained capacitated VRP.

Landmarks provide the most predominant navigation cue for pedestrian navigation. Very few navigation data models in the geographical information science and transportation communities support modeling of landmarks and use of landmark-based route instructions for pedestrian navigation services. This article proposes a landmark-based pedestrian navigation data model to fill this gap. This data model can model landmarks in several pedestrian navigation scenarios (buildings, open spaces, multimodal transportation systems, and urban streets). This article implements the proposed model in the ArcGIS software environment and demonstrates two typical pedestrian navigation scenarios: (1) a multimodal pedestrian navigation environment involving bus lines, parks, and indoor spaces and (2) a subway system in a metropolitan environment. These two scenarios illustrate the feasibility of the proposed data model in real-world environments. Further improvements of this model could lead to more intuitive and user-friendly landmark-based pedestrian navigation services than the functions supported by current map-based navigation systems.

The interpolation of link-based traffic data is an important topic for transportation researchers and engineers. In recent years the kriging method has been used in traffic data interpolation from the viewpoint of spatial analysis. This method has shown promising results, especially for a large-scale road network. However, existing studies using the Euclidean distance metric, which is widely used in traditional kriging, fail to accurately describe the spatial distance in a road network. In this article we introduce road network distance to describe spatial distance between road links, and we propose an improved distance metric called approximate road network distance (ARND), based on the isometric embedding theory, for solving the problem of the invalid spatial covariance function in kriging caused by the non-Euclidean distance metric. An improved Isomap algorithm is also proposed for obtaining the ARND metric. This study is tested on a large-scale urban road network with sparse road-link travel speeds derived from approximately 1200 ‘floating cars’ (GPS-enabled taxis). Comparison was conducted on both the Euclidean distance metric and the ARND metric. The validation results show that the use of the ARND metric can obtain better interpolation accuracy in different time periods and urban regions with different road network structures. Therefore, we conclude that the improved distance metric has the ability for improving kriging interpolation accuracy for link-based traffic data within real situations, providing more reliable basic traffic data for various traffic applications.

Landmarks provide the most predominant navigational cue for pedestrian navigation. The choice and representation of landmarks require an optimal approach to meet the needs of pedestrians, for example, shorter distances, fewer turns, and easy confirmation. This article proposes a multiobjective model to generate optimal landmark sequences for pedestrian route instructions. This model offers a general approach to meet the diverse needs of pedestrians. A modified ant colony optimization (ACO) algorithm is used to implement the proposed model. This research determined the parameters of the modified ACO algorithm by testing the whole study area using various weight combinations. This article also discusses the optimization process for various cases, for example, different origin–destination (OD) pairs, different pedestrian study areas, the influence of landmark density, and the overall performance comparison in achieving four objectives. Experimental results have confirmed that this proposed model can optimize landmark sequences for pedestrian route instructions.

Strokes are products of a higher-level aggregation of street segments that can reflect functional importance and perceptual significance that is associated with them in human spatial mental conceptualizations, which is of vital importance for network analysis, street selection, and map generalization. Street properties (e.g., street names) and angles between street segments are the two main elements used for generating street strokes according to the continuity principle of perceptual grouping into networks. However, it is difficult to automatically generate strokes with good continuity from street networks with multiple lanes such as dual carriageways or complex street junctions. This article proposes a method for generating street strokes that maintain good continuity across multiple lanes and complex street junctions. The proposed method first detects dual carriageways and complex junctions in street networks and then generates strokes according to the continuity principle of perceptual grouping. Finally, it groups the generated street strokes across the dual carriageways and complex street junctions to maintain good continuity. Moreover, the generated strokes are hierarchically ranked based on stroke length and centrality measurements. Experimental studies demonstrate the validity and effectiveness of the proposed method. The result shows that the generated street strokes maintain good continuity and reflect well the hierarchical structure of the street networks.

Multi‐resolution terrain models are an efficient approach to improve the speed of three‐dimensional (3D) visualizations, especially for terrain visualization in Geographical Information Systems (GIS). As a further development to existing algorithms and models, a new model is proposed for the construction of multi‐resolution terrain models in a 3D GIS. The new model represents multi‐resolution terrains using two major methods for terrain representation: Triangulated Irregular Network (TIN) and regular grid (Grid). In this paper, first, the concepts and formal definitions of the new model are presented. Second, the methodology for constructing multi‐resolution terrain models based on the new model is proposed. Third, the error of multi‐resolution terrain models is analysed, and a set of rules is proposed to retain the important features (e.g. boundaries of man‐made objects) within the multi‐resolution terrain models. Finally, several experiments are undertaken to test the performance of the new model. The experimental results demonstrate that the new model can be applied to construct multi‐resolution terrain models with good performance in terms of time cost and maintenance of the important features. Furthermore, a comparison with previous algorithms/models shows that the speed of rendering for 3D walking/flying through has been greatly improved by applying the new model.

Developing a three-dimensional (3D) data model for Geographic Information Systems (GIS) is an essential and complex issue. 3D modelling in GIS is becoming ever more important for the development of cyber cities and digital earth, which have recently become feasible. A competent 3D model forms an efficient foundation for 3D visualization, query and spatial analysis. As a development of the existing 3D models, this study proposes particular improvements in handling complex 3D objects. We present an object-oriented data model for handling complex 3D objects in GIS. First, the conceptual data model is developed based on the principle of object-oriented (OO) data modelling. This model is designed based on the following three basic geometric elements: node, segment and triangle. Accordingly, the abstract geometric objects are defined: including points, lines, surfaces and volumes. Second, the corresponding 3D logical model is designed based on the defined abstract objects and the relationships between them. Third, a formal representation of the 3D spatial objects is described in detail. Fourth, a prototype 3D GIS is developed based on the proposed 3D data model. Finally, we describe the results of an experimental study to reconstruct 3D objects using this 3D GIS and a comparison with the performance of other 3D data models. The proposed model is able to handle complex objects, such as complex buildings and TV towers, which is an essential functionality for building large-scale cyber cities, such as for Hong Kong. The proposed data model proves to be very efficient, particularly in visualization and rendering. The experimental results show which the data volume of the proposed model is compacted and the visualization speed for 3D objects is improved, compared with the existing models.