Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, J. Vitter  Home/Search
Context Related
| jhu.edu/~goodrich/cgc/pubs/ecg.ps Cached: PS.gz PS PDF DjVu Image Update Help From: jhu.edu/~goodrich/cgc/pub...index (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 efficient algorithms for computational geometry problems that are too large to be solved in internal memory, and we use these techniques to develop optimal and practical algorithms for a number of important largescale problems. We discuss our algorithms primarily in the contex't of single processor/single disk machines, a domain in which they are not only the first known optimal results but also of tremendous practical value. Our methods also... (Update)
Context of citations to this paper: More
...of I Os needed to answer a query. While several theoretically I O e#cient planar point location structures have been developed, e.g. [17, 1, 8], they are all relatively complicated and consequently none of them have been implemented. Based on a # Supported in part by the...
...computer. New algorithmic techniques and analysis tools have been developed to address this problem, e.g. for geometric algorithms [17 19] and scientific visualization [20, 21] In most terrain visualization systems [2 4, 8, 22 26] the external memory component is...
Cited by: More
Validity Information Retrieval for Spatio-Temporal - Queries Theoretical Performance (Correct)
Out-Of-Core Algorithms for Scientific - Visualization And Computer (Correct)
Distribution Sweeping on Clustered Machines with.. - Frank Dehne School (Correct)
Similar documents (at the sentence level):
47.0%: External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
45.4%: External-Memory Computational Geometry (Preliminary.. - Goodrich, Tsay.. (Correct)
Active bibliography (related documents): More All
0.5: Minimizing the Input/Output Bottleneck - Nodine (1992) (Correct)
0.5: Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992) (Correct)
0.3: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
Similar documents based on text: More All
0.5: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.5: I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (Correct)
0.5: External-Memory Graph Algorithms - Chiang, Goodrich, Grove, Tamassia.. (1995) (Correct)
Related documents from co-citation: More All
45: External-memory graph algorithms - Chiang, Goodrich et al. - 1995
44: Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
34: External-Memory Algorithms for Processing Line Segments in Geographic Informatio.. - Arge, Vengroff et al. - 1995
BibTeX entry: (Update)
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. http://citeseer.nj.nec.com/goodrich93externalmemory.html More
@inproceedings{ goodrich93externalmemory,
author = "Michael T. Goodrich and Jyh-Jong Tsay and Darren E. Vengroff and Jeffrey Scott Vitter",
title = "External-Memory Computational Geometry",
booktitle = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science",
pages = "714--723",
year = "1993",
url = "citeseer.nj.nec.com/goodrich93externalmemory.html" }
Citations (may not include all citations):276 Con- straint query languages - Kanellakis, Kuper et al. - 1990
223 Primitives for the manip- ulation of general subdivisions an.. (context) - Guibas, Stolfi - 1985
159 Vol- ume 2: Seminumerical Algorithms (context) - Knuth, of et al. - 1973
139 A case for redundant arrays of inexpensive disks (RAID (context) - Patterson, Gibson et al. - 1988
103 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
102 Readings in Object- Oriented Database Systems (context) - Zdonik, Maier - 1990
95 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. - 1993
95 Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
70 A Model for Hierarchical Memory (context) - Aggarwal, Alpern et al. - 1987
70 Hierarchi- cal Memory with Block Transfer (context) - Aggarwal, Chandra et al. - 1987
62 The ubiquitous B-tree (context) - Comer - 1979
61 An efficient algorithm for determining the convex hull of a .. (context) - Graham - 1972
51 Deterministic distribu- tion sort in shared and distributed .. (context) - Nodine, Vitter - 1993
51 Coding Techniques for Handling Fail- ures in Large Disk Arra.. - Gibson, Hellerstein et al. - 1988
50 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1986
50 Convex hulls of finite sets of points in two and three dimen.. (context) - Preparata, Hong - 1977
37 Probabilistic recurrence relations (context) - Karp - 1991
28 Organization of large ordered indexes (context) - Bayer, McCreight - 1972
19 Fractional Cascading: I. A Data Structuring Technique (context) - Chazelle, Guibas - 1986
17 An Intellegent Information Fusion System for Handling the Ar.. (context) - Cromp - 1993
17 Optimal parallel randomized algo- rithms for three-dimension.. (context) - Reif, Sen - 1992
15 The TWA Reservation System (context) - Gifford, Spector - 1984
11 Efficient memory access in large-scale computation (context) - Tamassia, Vitter et al. - 1991
10 the Parallel- Decomposability of Geometric Problems (context) - Atallah, Tsay - 1992
8 Optimal Cooperative Search in Fractional Cascaded Data Struc.. - Tamassia, Vitter - 1990
5 Hysterical B-trees (context) - Maier, Salveter - 1981
5 Disk Array Mass Storage Systems: The New Opportunity (context) - Jilke - 1986
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
4 Fractional Cascading: II. Applications (context) - Chazelle, Guibas - 1986
3 Store More, Spend Less: MidRange Options Around (context) - Maginnis - 1987
2 Geometric partioning made easier, even in parallel (context) - Goodrich - 1993
1 atial Data Structures: Computer Graphics (context) - Samet, of - 1989
1 The Design and Analysis of 5)atial Data Structures (context) - Samet - 1989
1 The Uni- forin Melnory Hierarchy Model of Computation (context) - Alpern, Carter et al. - 1990
1 The input/output coin- plexity of sorting and related proble.. (context) - Aggarwal, Vitter - 1988
1 Optimal disk I/O with parallel block transfer (context) - Vitter, Shriver - 1990
1 Computational Ge- ometlT: An Introduction (context) - Preparata, Shamos - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.jhu.edu/~goodrich/cgc/pubs/index.html): More
Efficient Approximation and Optimization Algorithms for.. - Duncan, Goodrich, al. (1997) (Correct)
Randomized Fully-Scalable BSP Techniques for Multi-Searching and .. - Goodrich (1997) (Correct)
Communication-Efficient Parallel Sorting - Goodrich (1996) (Correct)
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