Rectangle function ( ) { return new Rectangle ( x , y , x + Math . ulp ( x ) , y + Math . ulp ( y ) ) ; }
returns the minimal bounding rectangle of this point . this method returns the smallest rectangle that contains this point . for consistency with other methods such as rectangle #isintersected shape , the rectangle can not have a zero width or height . thus , we use the method math #ulp double to compute the smallest non-zero rectangle thatcontains this point . in other words , for a point p the following statement should return true . p.getmbr . isintersected p ; concode_field_sep double x concode_elem_sep double y concode_field_sep void set concode_elem_sep int compareTo concode_elem_sep int compareTo concode_elem_sep void draw concode_elem_sep void draw concode_elem_sep double distanceTo concode_elem_sep double distanceTo concode_elem_sep Shape getIntersection concode_elem_sep void readFields concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep Point clone concode_elem_sep void fromText concode_elem_sep String toString concode_elem_sep void write concode_elem_sep Text toText concode_elem_sep boolean isIntersected