Loading...
Please wait, while we are loading the content...
Similar Documents
Analyzing bounding boxes for object intersection subhash suri.
| Content Provider | CiteSeerX |
|---|---|
| Author | Hubbard, Philip M. Hughes, John F. |
| Abstract | Heuristics that exploit bounding boxes are common in algorithms for rendering, modeling, and animation. While experience has shown that bounding boxes improve the performance of these algorithms in practice, the previous theoretical analysis has concluded that bounding boxes perform poorly in the worst case. This paper reconciles this discrepancy by analyzing intersections among n geometric objects in terms of two parameters: �, an upper bound on the aspect ratio or elongatedness of each object; and �, an upper bound on the scale factor or size disparity between the largest and smallest objects. Letting K o and K b be the number of intersecting object pairs and bounding box pairs, respectively, we analyze a ratio measure of the bounding boxes ’ efficiency, � � K b � �n � Ko�. The analysis proves that � � O����log 2 � � and � �������. One important consequence is that if � and � are small constants (as is often the case in practice), then K b � O�K o � � O�n�, so an algorithm that uses bounding boxes has time complexity proportional to the number of actual object intersections. This theoretical result validates the efficiency that bounding boxes have demonstrated in practice. Another consequence of our analysis is a proof of the output-sensitivity of an algorithm for reporting all |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Object Intersection Subhash Suri Bounding Box Upper Bound Geometric Object Box Pair Size Disparity Smallest Object Small Constant Important Consequence Scale Factor Previous Theoretical Analysis Theoretical Result Object Pair Ratio Measure Actual Object Intersection Bounding Box Efficiency Time Complexity Proportional Aspect Ratio |
| Content Type | Text |
| Resource Type | Article |
