Corrected LOG M algorithm to divide in half based on the number of edges rounded up to the nearest power of two, instead of always dividing based on the number of edges of a complete graph from the same number of vertices. This mean less tracks may be required for incomplete graphs.

Also changed the way upper and lower track bend points, so that they have the same x value as their last bend point. This results in a graph with lesser accute bends.