M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In IEEE Foundations of Comp. Sci., pages 714--723, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Cache Oblivious Distribution Sweeping - Brodal, Fagerberg (2002) (2 citations) (Correct)
....simplicity. In Section 3 we develop cache oblivious algorithms based on Lazy Funnelsort for a sequence of problems in computational geometry. Common to these problems is that there exist external memory algorithms for these problems based on the distribution sweeping approach of Goodrich et al. [14]. Goodrich et al. introduced distribution sweeping as a general approach for developing external memory algorithms for problems which in internal memory can be solved by a divide and conquer algorithm based on a plane sweep. Through a sequence of examples they demonstrated the validity of their ....
....if the distribution sweeping approach can be adapted to the cache oblivious model, and answer this in the a#rmative by developing optimal cache oblivious algorithms for each of the above mentioned problems. Theorem 1 summarizes our results. These bounds are known to be optimal in the I O model [14] and therefore are also optimal in the cache oblivious model. Theorem 1 In the cache oblivious model the 3D maxima problem on a set of points, computing the measure of a set of axis parallel rectangles, the all nearest neighbors problem, and computing the visibility of a set of non intersecting ....
M. T. Goodrich, J.-J. Tsay, D. E. Vengro#, and J. S. Vitter. Externalmemory computational geometry. In Proc. 34th Ann. Symp. on Foundations of Computer Science, pages 714--723, 1993.
Validity Information Retrieval for Spatio-Temporal.. - Tao, Mamoulis, Papadias (2003) (Correct)
....version of the (simplified) external range tree, where a new tree is created at the xcoordinates where two dual lines cross each other. Towards this, the first step is to obtain the intersection points of all pairs of dual lines, using an I O optimal algorithm for line arrangement computation [GTVV93]. Then the second step constructs the persistent tree in the ascending order of the intersections x coordinates. Since there are totally O(N ) intersections, the space occupied by the persistent tree is B)log B (N B) loglog B (N B) and its construction incurs O( N B)log B (N B) I Os. ....
....points (p i , p j ) defines an event (based on their arrival time) if p ix p jx and the speed of p is larger than that of p j . It is easy to see that the number of all events is bounded by O(N ) and they can be obtained using an algorithm similar to the line arrangement computation given in [GTVV93]. Theorem 3.6: Given a dataset S of N moving 2D points (with arbitrary velocity) we can pre process S into a set of aggregate B trees that consume O( N B)log B (N B) space and can be constructed in O( N B)log B (N B) expected I Os, such that a static validity RS query q (with arbitrary ....
Goodrich, M., Tsay, J., Vengroff, D., Vitter, J. External Memory Computational Geometry. IEEE FOCS, 1993.
Out-of-Core Algorithms for Scientific Visualization and Computer.. - Silva (2002) (2 citations) (Correct)
....and analyzed under the model of [3] see the classic book of Knuth [57] in 1973. Early work on external memory algorithms, including Aggarwal and Vitter [3] and other follow up results, concentrated largely on problems such as sorting, matrix multiplication, and FFT. Later, Goodrich et al. [47] developed I O efficient algorithms for a collection of problems in computational geometry, and Chiang et al. 17] gave I Oefficient techniques for a wide range of computational graph problems. These papers also proposed some fundamental paradigms for external memory geometric and graph ....
....By taking k = M B, we get the bound of O( I O s, which is optimal [3] Note the technique of using a 1 block buffer in main memory for each sub list that is larger than main memory in the above merging step. This has lead to the distribution sweep algorithm developed in Goodrich et al. [47] and implemented and experimented in Chiang [15] for the 2D orthogonal segment intersection problem, as well as the general scan and distribute paradigm developed by Chiang and Silva [18] and Chiang et al. 20] to build the I O interval tree [6] used in [18] and the binary blocked I O interval ....
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-Memory Computational Geometry. IEEE Foundations of Comp. Sci., 714--723. 1993.
Unknown - External-Memory Graph Algorithms Self-citation (Goodrich Vengroff Vitter) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In IEEE Foundations of Comp. Sci., pages 714--723, 1993.
Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In IEEE Foundations of Comp. Sci., pages 714--723, 1993.
Algorithms for Processing K-closest-pair Queries.. - Corral.. (2004) (Correct)
No context found.
M.T. Goodrich, J.J. Tsay, D.E. Vengro#, J.S. Vitter, External-memory computational geometry, in: Proceedings 34th FOCS Conference, 1993, pp. 714--723.
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714--723, 1993.
Compact Representations Of Simplicial - Meshes In Two (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengro , and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714-723, Nov. 1993.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714--723, 1993.
Incremental Constructions con BRIO - Amenta, Choi, Rote (2003) (3 citations) (Correct)
No context found.
Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter J. S. External-Memory Computational Geometry, In Proc. 34th Foundations of Computer Science (FOCS) (1993), pp. 714--723.
Extending LEDA to Secondary Memory - Andreas Crauser And (1999) (Correct)
No context found.
M. Goodrich, J.-J. Tsay, D. Vengro , and J. Vitter. External-memory computational geometry. In FOCS, pages 714-723, 1993.
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714--723, Nov. 1993.
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengro#, and J. S. Vitter. External-memory computational geometry. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., 714--723, 1993.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714--723, 1993.
Indexing Constraint Databases by Using a Dual Representation - Bertino Catania.. (1999) (1 citation) (Correct)
No context found.
M. Goodrich, J.-J. Tsay, D. Vengroff, and J. Vitter. ExternalMemory Computational Geometry. In Proc. of Found. of Computer Science Conf. (FOCS), pages 714--723, 1993.
Incremental Constructions con BRIO - Amenta, Choi, Rote (2003) (3 citations) (Correct)
No context found.
Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter J. S. External-Memory Computational Geometry, In Proc. 34th Foundations of Computer Science (FOCS) (1993), pp. 714--723.
Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002) (2 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symp. on Foundations of Computer Science, pages 714--723, 1993.
Hierarchical Indexing for Out-of-Core Access to.. - Pascucci, Frank (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS '93), Palo Alto, CA, November 1993.
Algorithms for processing K-closest-pair queries.. - Corral.. (2004) (Correct)
No context found.
M.T. Goodrich, J.J. Tsay, D.E. Vengro#, J.S. Vitter, External-memory computational geometry, in: Proceedings 34th FOCS Conference, 1993, pp. 714--723.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714--723, 1993.
Compact Representations of Simplicial Meshes in Two .. - Blandford.. (2003) (1 citation) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengro , and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714-723, Nov. 1993.
Space-Efficient Geometric Divide-and-Conquer Algorithms - Bose, Maheshwari, Morin, .. (2004) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengro#, and J. S. Vitter. External-memory computational geometry. FOCS, pp. 714--723, 1993.
Cache Oblivious Distribution Sweeping - Brodal, Fagerberg (2002) (2 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengro#, and J. S. Vitter. External-memory computational geometry. In Proc. 34th Ann. Symp. on Foundations of Computer Science, pages 714--723, 1993.
Towards a Theory of Cache-Efficient Algorithms - Sen, Chatterjee (1999) (13 citations) (Correct)
No context found.
M. Goodrich, J. Tsay, D. Vengroff, and J. Vitter. External memory computational geometry. In Proceeding of IEEE Foundations of Computer Science, pages 714--723, 1993.
Out-of-Core Algorithms for Scientific Visualization.. - Silva, Chiang.. (2002) (2 citations) (Correct)
No context found.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-Memory Computational Geometry. IEEE Foundations of Comp. Sci., 714--723. 1993.
First 50 documents Next 50
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