114115116117118119120121122123124
Triangle tr = new Triangle(node.prev.value, node.value, node.next.value); DoublyLinkedCyclicList<Point>.Node cur = vertices.head(); do { if (tr.pointInside(cur.value)) return false; cur = cur.next; } while(cur != vertices.head()); return true; }
7475767778798081828384
isEar = Point.isLeftTurn(l, v, r) ^ isClockwise; if (isEar) { // Further analysis required for (int i = 0; i < p.size(); i++) { if (tr.pointInside(p.get(i))) { isEar = false; break; } } }