Next Article in Journal
Assessment of Sustainable Livelihood and Geographic Detection of Settlement Sites in Ethnically Contiguous Poverty-Stricken Areas in the Aba Prefecture, China
Previous Article in Journal
Are We in Boswash Yet? A Multi-Source Geodata Approach to Spatially Delimit Urban Corridors
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2018, 7(1), 14; doi:10.3390/ijgi7010014

A Geometric Framework for Detection of Critical Points in a Trajectory Using Convex Hulls

1
School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, North Kargar Street, After Ale-Ahmad Junction, 1439957131 Tehran, Iran
2
Naval Academy Research Institute Lanveoc-Poulmic, BP 600, 29240 Brest Naval, France
*
Author to whom correspondence should be addressed.
Received: 12 October 2017 / Revised: 12 December 2017 / Accepted: 22 December 2017 / Published: 4 January 2018
View Full-Text   |   Download PDF [6303 KB, uploaded 4 January 2018]   |  

Abstract

Large volumes of trajectory-based data require development of appropriate data manipulation mechanisms that will offer efficient computational solutions. In particular, identification of meaningful geometric points of such trajectories is still an open research issue. Detection of these critical points implies to identify self-intersecting, turning and curvature points so that specific geometric characteristics that are worth identifying could be denoted. This research introduces an approach called Trajectory Critical Point detection using Convex Hull (TCP-CH) to identify a minimum number of critical points. The results can be applied to large trajectory data sets in order to reduce storage costs and complexity for further data mining and analysis. The main principles of the TCP-CH algorithm include computing: convex areas, convex hull curvatures, turning points, and intersecting points. The experimental validation applied to Geolife trajectory dataset reveals that the proposed framework can identify most of intersecting points in reasonable computing time. Finally, comparison of the proposed algorithm with other methods, such as turning function shows that our approach performs relatively well when considering the overall detection quality and computing time. View Full-Text
Keywords: urban trajectory; convex hull; self-intersection; curvature area; turning point urban trajectory; convex hull; self-intersection; curvature area; turning point
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Hosseinpoor Milaghardan, A.; Ali Abbaspour, R.; Claramunt, C. A Geometric Framework for Detection of Critical Points in a Trajectory Using Convex Hulls. ISPRS Int. J. Geo-Inf. 2018, 7, 14.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top