A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification (Q5372894): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/tip/ChenXF12, #quickstatements; #temporary_batch_1739530294150 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tip.2012.2186146 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018947218 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tip/ChenXF12 / rank | |||
Normal rank | |||
Latest revision as of 11:55, 14 February 2025
scientific article; zbMATH DE number 6800014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification |
scientific article; zbMATH DE number 6800014 |
Statements
A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification (English)
0 references
27 October 2017
0 references
