Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorKreveld, prof. dr. M.J. van
dc.contributor.advisorLöffler, dr. M.
dc.contributor.authorHunnik, R.R. van
dc.date.accessioned2017-03-22T18:02:12Z
dc.date.available2017-03-22T18:02:12Z
dc.date.issued2017
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/25654
dc.description.abstractIn this study we compare ten simplification algorithms consisting of both line and trajectory simplification algorithms. Namely, Uniform Sampling, Douglas-Peucker, Visvalingam-Whyatt, Imai-Iri, TD-TR, SQUISH-E(μ), STTrace, OPW-TR, OPW-SP, and a newly introduced algorithm VW-TS. This newly introduced algorithm is an adaptation of the Visvalingam-Whyatt algorithm that uses Time-Space. This comparison is performed using three distinct real world datasets. Also, five error metrics are described and used to compare the simplifications’ performance. These five error metrics are: Spatial Distance, Temporal Distance, Speed Deviation, Heading Deviation, and Acceleration Deviation. TD-TR, VW-TS, and SQUISH-E(μ) prove to have the lowest error across all but one error metric. On the Acceleration Deviation metric, OPW-SP gives the lowest error with a significant margin.
dc.description.sponsorshipUtrecht University
dc.format.extent3200142
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleExtensive Comparison of Trajectory Simplification Algorithms
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsTrajectory Simplification, Trajectory, Simplification, Line simplification, Line
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record