📄 rect.html
字号:
<DD>return the minimum bounding rectangle of this rectangle and the passed rectangle.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="getResultingMBR(rtree.Rect, rtree.Rect)"><!-- --></A><H3>
getResultingMBR</H3>
<PRE>
public static <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> <B>getResultingMBR</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> source, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> dest) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Overloaded type of the previous function - but static
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="getResultingMBR(rtree.Rect[])"><!-- --></A><H3>
getResultingMBR</H3>
<PRE>
public static <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> <B>getResultingMBR</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>[] rects) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Another overloaded version - but static
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="getResultingMBR(rtree.Rect[], rtree.Rect)"><!-- --></A><H3>
getResultingMBR</H3>
<PRE>
public static <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> <B>getResultingMBR</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>[] rects, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Another overloaded version - but static
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="contains(rtree.Rect)"><!-- --></A><H3>
contains</H3>
<PRE>
public boolean <B>contains</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Checks if this rectangle contains 'rect'. <br>Checks the two minimal conditions from 'contains' matrix(Egenhofer.) <br>Correct for Point as well.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="encloses(rtree.Rect)"><!-- --></A><H3>
encloses</H3>
<PRE>
public boolean <B>encloses</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>The difference betn. this method and <code>contains</code> is that this method returns true even if the <code>covers</code> condition if true.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Returns:</B><DD>true if this rectangle completely encloses 'rect'.<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="containedBy(rtree.Rect)"><!-- --></A><H3>
containedBy</H3>
<PRE>
public boolean <B>containedBy</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Check if this rectangle is contained by 'rect'
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="overlaps(rtree.Rect)"><!-- --></A><H3>
overlaps</H3>
<PRE>
public boolean <B>overlaps</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>This method also gives whether one point is over another, if you do not want that much precision then comment the line.This will improve performance.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Returns:</B><DD>true if both the rectangle overlap/intresect else false. <br><b>Note:-</b>This method is not precisely according to Egenhofer.<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="disjoint(rtree.Rect)"><!-- --></A><H3>
disjoint</H3>
<PRE>
public boolean <B>disjoint</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Saperate or not(Egenhofer). <br>To check if two rectangles intersect in any way then call '!disjoint()'.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="meet(rtree.Rect)"><!-- --></A><H3>
meet</H3>
<PRE>
public boolean <B>meet</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Checks if both the rectangles meet or not.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="covers(rtree.Rect)"><!-- --></A><H3>
covers</H3>
<PRE>
public boolean <B>covers</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Checks if this rectangle contains 'rect'. This method is incomplete. It can be finished if required.(Depends on query requirements) <pre> --------------- | | | |------| | |'rect'| | |------| | | --------------- </pre>
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="equals(rtree.Rect)"><!-- --></A><H3>
equals</H3>
<PRE>
public boolean <B>equals</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect) throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD>Checks if this rectangle is equal to 'rect'
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Throws:</B><DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>
<A NAME="toString()"><!-- --></A><H3>
toString</H3>
<PRE>
public java.lang.String <B>toString</B>()</PRE>
<DL>
<DD><DL>
</DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>
<A NAME="minDist(rtree.Point, rtree.Rect)"><!-- --></A><H3>
minDist</H3>
<PRE>
public static long <B>minDist</B>(<A HREF="../rtree/Point.html" title="class in rtree">Point</A> p, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</PRE>
<DL>
<DD>Calculate the Euclidean distance between the point and the MBR. To calculate the distance(MINDIST) betn. a Point and Rectangle in n dimension. In our case we consider only 2 dimensions. <br><b>Note:-</b> The distance is the square of the actual distance. To find the actual distance, square root the returned value.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>
<A NAME="minMaxDist(rtree.Point, rtree.Rect)"><!-- --></A><H3>
minMaxDist</H3>
<PRE>
public static int <B>minMaxDist</B>(<A HREF="../rtree/Point.html" title="class in rtree">Point</A> p, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</PRE>
<DL>
<DD>To find the minimum of the maximum distances from a point to a Rectangle <b>(Not implemeneted yet).</b> For further details see Roussopoulos. If we apply Cheung then it will not be used.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>
<A NAME="intersection(rtree.Rect)"><!-- --></A><H3>
intersection</H3>
<PRE>
public <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> <B>intersection</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</PRE>
<DL>
<DD>Will return the intersection of the <code>this</code> and <code>rect</code>.
<P>
<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>rect</CODE> - The other <code>Rect</code></DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<HR>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A><A HREF="#skip-navbar_bottom" title="Skip navigation links"></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=3 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/Rect.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../rtree/ReadNode.html" title="class in rtree"><B>PREV CLASS</B></A>
<A HREF="../rtree/RTree.html" title="class in rtree"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../index.html" target="_top"><B>FRAMES</B></A>
<A HREF="Rect.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
SUMMARY: NESTED | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A><!-- ======== END OF BOTTOM NAVBAR ======= -->
<HR>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -