Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR .
Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively.
Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull.
Time complexity:
T(n) = 2T(n/2) + O(n)
= O(n log n)
The following sections profile many of the vendors in the NFV market. The individual profiles were created
through a collaborative effort between SDNCentral’s Research Team and the Vendor’s product experts.
SDNCentral worked under the assumption the information provided by the vendors was factual, auditing the
submissions only to remove unverifiable claims and hyperbole. Extended profiles can be viewed online.
While every attempt has been made to validate the capabilities listed in the profiles, SDNCentral advises end
users to verify the veracity of each claim for themselves in their actual deployment environments. SDNCentral
cannot be held liable for unexpected operations, damages or incorrect operation due to any inaccuracies listed
here. SDNCentral welcomes feedback and additional information from end users based on their real-world
experiences with the products and technologies listed. The SDNCentral research team can be reached at
