Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours