code: function getLeftmost (data, start) {
    var node = start,
      leftmost = start
    do {
      if (data[node.i] < data[leftmost.i]) {
        leftmost = node
      }
      node = node.next
    } while (node !== start)
  
    return leftmost
  }
docs: find the leftmost node of a polygon ring