code: public List<Triangle> triangulate(List<Vector3> points) {
  		init(points.size());
  
  		Set<Vector3> vertices = new TreeSet<Vector3>(new PointComparator());
  
  		bbMin = new Vector3(points.get(0));
  		bbMax = new Vector3(points.get(0));
  
  		//Insert Points
  		for (Vector3 point:points) {
  			this.insertPoint(vertices, point);
  		}
  
  		List<Triangle> triangles = null;
  
  		if (modCount != modCount2 && vertices.size() > 2) {
  			triangles = generateTriangles();
  		}
  
  		return triangles;
  	}
docs: Triangulate given points.
  Note: duplicated points are ignored.
  @param points
  @return list of triangles