rem: poly.reflexVertices.each(function(node) {   if (node.data != mainNode.prev.data && node.data != mainNode.next.data) { if (trig.contains(node.data) || trig.hasEdgeContaining(node.data)) { success = false; } } }); 
add: this.vertices.each(function(node) { points.push(plane.pointClosestTo(node.data)); }); 
context:         poly.reflexVertices.each(function(node) {          // Don't test points belonging to this triangle. node won't be          // equal to convexNode as node is reflex and vertex is convex.          if (node.data != mainNode.prev.data && node.data != mainNode.next.data) {            if (trig.contains(node.data) || trig.hasEdgeContaining(node.data)) { success = false; }          }        });
meta: 3877	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/3877/88af0516a961fea263ffc0d016435fdbb11d55cf/polygon.js/buggy/src/polygon.js