Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter  Home/Search
Context
Related
| duke.edu/~jsv/Papers/GTV93.ecg.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: duke.edu/~jsv/Papers/cat...node19 (more) Homepages: M.Goodrich [2] [3] J.Tsay [2] D.Vengroff J.Vitter [2] HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we give new techniques for designing efficiet algorithms for computatioal geometry problems that are too lawe to be solved i iteral memory. We use these techiques to develop optimal ad practical algorithms for a umber of importat lawescale problems. We discuss our algorithms primarily i the cotext of sigle processor/sigle disk machies, a domai i which they are ot oly the first kow optimal results but also of tremedous practical value. Our methods also produce the first kow optimal ... (Update)
Similar documents (at the sentence level):
70.9%: External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
Active bibliography (related documents): More All
0.5: Minimizing the Input/Output Bottleneck - Nodine (1992) (Correct)
0.2: Fast Randomized Parallel Methods for Planar Convex Hull.. - Mujtaba Ghouse (1991) (Correct)
0.2: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
Similar documents based on text: More All
0.5: Optimal Cooperative Search In Fractional Cascaded Data.. - Tamassia, Vitter (1995) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
BibTeX entry: (Update)
@misc{ goodrich-externalmemory,
author = "Michael T. Goodrich and Jyh-Jong Tsay and Darren Erik Vengroff and Jeffrey
Scott Vitter",
title = "External-Memory Computational Geometry (Preliminary Version)",
url = "citeseer.nj.nec.com/519514.html" }
Citations (may not include all citations):534 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
275 Constraint Query Languages - Kanellakis, Kuper et al. - 1990
219 Primitives for the Ma- nipulation of General Subdivisions an.. (context) - Guibas, Stolfi - 1985
163 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
158 Volume 2: Seminumerical Algorithms (context) - Knuth, of et al. - 1973
136 A Case for Redundant Arrays of Inexpensive Disks (RAID (context) - Patterson, Gibson et al. - 1988
102 Readings in Object-Oriented Database Systems (context) - Zdonik, Maier - 1990
100 Making Data Structures Persistent (context) - Driscoll, Sarnak et al. - 1989
62 The Ubiquitous B-tree (context) - Comer - 1979
61 An Efficient Algorithm for Deter- mining the Convex Hull of .. (context) - Graham - 1972
61 The Input/Output Complexity of Sorting and Related Problelns (context) - Aggarval, Vitter - 1988
51 Coding Techniques for Handling Failures in Large Disk Arrays - Gibson, Hellerstein et al. - 1988
49 The Ultimate Pla- nar Convex Hull Algorithm (context) - Kirkpatrick, Seidel - 1986
37 Probabilistic Recurrence Relations (context) - Karp - 1991
27 Organization of Large Ordered Indexes (context) - Bayer, McCreight - 1972
19 Fractional Cascading: I. A Data Structuring Technique (context) - Chazelle, Guibas - 1986
17 Optimal Parallel Random- ized Algorithms for Three-Dimension.. (context) - Reif, Sen - 1992
17 An Intellegent Information Fusion System for Handling the Ar.. (context) - Cromp - 1993
16 Algorithms for Parallel Memory II: Hierarchical Multilevel M.. - Vitter, Shriver - 1990
15 The TWA Reservation System (context) - Gifford, Spector - 1984
11 Efficient Memory Access in Large-Scale Computation (context) - Tamassia, Vitter et al.
8 Optimal Coopera- tive Search in Fractional Cascaded Data Str.. - Tamassia, Vitter - 1990
5 Disk Array Mass Storage Systems: The New Opportunity (context) - Jilke - 1986
5 Hysterical B-trees (context) - Maier, Salveter - 1981
4 Massive Information Storage, Management, and Use (NSF Instit.. (context) - California, Berkeley - 1989
4 Constructing the Convex Hull of a Partially Sorted Set of Po.. (context) - Goodrich - 1993
3 Store More, Spend Less: MidRange Options Around (context) - Maginnis - 1987
1 A Model for Hierarchical Mentory (context) - Aggarval, Alpern et al. - 1987
1 Fundamentals of Spa- tim Information Systems (context) - Laurini, Thompson - 1992
1 Deterministic Dis- tribution Sort in Shared and Distributed .. (context) - Nodine, Vitter - 1993
1 Geometric Partioning Made Eas- ier, Even in Parallel (context) - Goodrich - 1993
1 Indexing for Data Models vith Constraints and Classes (context) - Kanellakis, Ramaswamy et al. - 1993
1 the Parallel- Decomposability of Geometric Problelns (context) - Atallah, Tsay - 1992
1 Convex Hulls of Finite Sets of Points in Tvo and Three Dimen.. (context) - Preparata, Hong - 1977
1 The Uniforln Melnory Hierarchy Model of Computation (context) - Alpern, Carter et al. - 1990
1 Hierarchi- cal Mentory vith Block Transfer (context) - Aggarval, Chandra et al. - 1987
1 Uomputational Geometry: An Introduction (context) - Preparata, Shamos - 1985
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute