Is it possible to calculate the complexity of the combined algorithms (TD-TR-SP, TD-SP-TR) provided here:
A new perspective on trajectory compression techniques
In more details, TD-TR-SP algorithm is a combination of TD_TR and TD_SP algorithm. The complexity of TD_TR is $O(n \log n)$ where $n$ is the size of trajectories. The complexity of TD_SP is $O(n^2)$.
Is it possible to obtain the total complexity when combine these algorithms? I am not familiar with Big-$O$ complexities at all.