Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Weighted alpha shapes
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Computing isochrones in multi-modal, schedule-based transport networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Continuous Intersection Joins Over Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
What is the region occupied by a set of points?
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
ISOGA: a system for geographical reachability analysis
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Isochrones, traffic and DEMOgraphics
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Hi-index | 0.00 |
Isochrones are generally defined as the set of all space points from which a query point can be reached in a given timespan, and they are used in urban planning to conduct reachability and coverage analyzes in a city. In a spatial network representing the street network, an isochrone is represented as a subgraph of the street network. Such a network representation is not always sufficient to determine all objects within an isochrone, since objects are not only on the network but might be in the immediate vicinity of links (e.g., houses along a street). Thus, the spatial area covered by an isochrone needs to be considered. In this paper we present two algorithms for determining all objects that are within an isochrone. The main idea is to first transform an isochrone network into an isochrone area, which is then intersected with the objects. The first approach constructs a spatial buffer around each edge in the isochrone network, yielding an area that might contain holes. The second approach creates a single area that is delimited by a polygon composed of the outermost edges of the isochrone network. In an empirical evaluation using real-world data we compare the two solutions with a precise yet expensive baseline algorithm. The results demonstrate the efficiency and high accuracy of our solutions.