P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....called batched construction of persistent B trees and batched filtering are also discussed, and external memory algorithms for convex hull construction in 15 two and three dimensions are developed using the distribution paradigm. Some external computational geometry results are also reported in [62, 137]. In [GIS] we design efficient I O algorithms for a large number of problems involving line segments in the plane by combining the ideas of distribution sweeping, batched filtering, buffer trees and a new technique, which can be regarded as an external memory version of fractional cascading . Most ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....algorithms, and apply these techniques to a wide variety of specific problems. For geometric problems, Goodrich et al. 20] study a number of problems in computational geometry and develop several paradigms for I O optimal geometric computations. Further results in this area have been obtained in [17, 32]. Also, Kanellakis et al. 21] and Ramaswamy and Subramanian [26, 27] give efficient data structures for performing range searching in external memory. Very recently, a new data structure called buffer tree and its applications are given in [2, 3] and an external memory version of the directed ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....called batched construction of persistent B trees and batched filtering are also discussed, and external memory algorithms for convex hull construction in 15 two and three dimensions are developed using the distribution paradigm. Some external computational geometry results are also reported in [62, 137]. In [GIS] we design e#cient I O algorithms for a large number of problems involving line segments in the plane by combining the ideas of distribution sweeping, batched filtering, bu#er trees and a new technique, which can be regarded as an external memory version of fractional cascading . Most of ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....recently, external memory research has moved towards solving problems that are not as directly related to the permutation problem. For example Goodrich, Tsay, Vengroff, and Vitter study a number of problems in computational geometry [12] Further results in this area have recently been obtained in [10, 27]. There has also been some work on selected graph problems, including the investigations by Ullman and Yannakakis [23] on problems involving transitive closure computations. This work, however, restricts its attention to problem instances where the set of vertices fits into main memory but the set ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....problem of manipulating ordered binary decision diagrams in external memory. For geometric problems, Goodrich et al. 24] study a number of problems in computational geometry and develop several paradigms for I O optimal geometric computations. Further results in this area have been obtained in [20, 39]. Also, Kanellakis et al. 25] and Ramaswamy and Subramanian [31, 34] give efficient data structures for performing range searching in external memory. Concurrent to the work in this paper, a new data structure called buffer tree and its applications are given in [2, 5] and an external memory ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....algorithm for a number of problems. In [53] two techniques called batched construction of persistent B trees and batched filtering are also discussed. In [18] some results from [53, 12] are extended and generalized, and some external memory computational geometry results are also reported in [49, 99]. In [19] efficient I O algorithms for a large number of problems involving line segments in the plane are designed by combining the ideas of distribution sweeping, batched filtering, buffer trees and a new technique, which can be regarded as an external memory version of fractional cascading ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

....research has moved towards solving geometric and graph problems. For geometric problems, Goodrich et al. 60] study a number of problems in computational geometry and develop several paradigms for I O optimal geometric computations. Further results in this area have been obtained in [51, 125]. Also, Kanellakis et al. 65] and Ramaswamy and Subramanian [98, 106] give efficient data structures for performing range searching in external memory. Very recently, a new data structure called buffer tree and its applications are given in [5, 6] and an external memory version of the directed ....

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

No context found.

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

No context found.

P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117--127, 1994.

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