Before revision:  We develop a range of tools for dealing with non-crossing matchings of points in convex position, which enable us to solve the problem of finding bottleneck matchings of points in convex position in O(n^2) time.
After revision:  Illustrating the use of the developed tools, we solve the problem of finding bottleneck matchings of points in convex position in O(n^2) time.