Y-J. Chiang: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. These Proceedings. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge Self-citation (Algorithms) (Correct)
....orthogonal segment intersection, the batched range searching, and the isothetic rectangle intersection problems in the optimal number of I O operations. We can solve these problems with exactly the same plane sweep algorithms as are used in internal memory. Optimal and efficient in practice [6] algorithms for the three problems are also developed in [8] but as noted earlier, these algorithms are very I O specific. A note should also be made on the fact that the search operations are batched. Batched here means that we will not immediately get the result of a search operation. ....
Y-J. Chiang: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. These Proceedings.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC