code: public Triangle find(Vector3 p) {
  
  		// If triangulation has a spatial index try to use it as the starting triangle
  		Triangle searchTriangle = startTriangle;
  		/*if(gridIndex != null) {
  			Triangle indexTriangle = gridIndex.findCellTriangleOf(p);
  			if(indexTriangle != null)
  				searchTriangle = indexTriangle;
  		}*/
  
  		// Search for the point's triangle starting from searchTriangle
  		return find(searchTriangle, p);
  	}
docs: finds the triangle the query point falls in, note if out-side of this
  triangulation a half plane triangle will be returned (see contains), the
  search has expected time of O(n^0.5), and it starts form a fixed triangle
  (this.startTriangle),
  
  @param p
  query point
  @return the triangle that point p is in.