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 This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: jhu.edu/~goodrich/cgc/pub...index (more) (Enter author homepages) |
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)
Cited by: More
Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep (Correct)
Algorithms for Processing K-closest-pair Queries.. - Corral.. (2004) (Correct)
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. (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.4: 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
47: 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.ist.psu.edu/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.ist.psu.edu/goodrich93externalmemory.html" }
Citations (may not include all citations):315 Con- straint query languages - Kanellakis, Kuper et al. - 1990
257 Primitives for the manip- ulation of general subdivisions an.. (context) - Guibas, Stolfi - 1985
216 Vol- ume 2: Seminumerical Algorithms (context) - Knuth, of et al. - 1973
158 A case for redundant arrays of inexpensive disks (RAID (context) - Patterson, Gibson et al. - 1988
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989 ACM DBLP
111 Readings in Object- Oriented Database Systems (context) - Zdonik, Maier - 1990
110 Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
103 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. - 1993 ACM DBLP
82 A Model for Hierarchical Memory (context) - Aggarwal, Alpern et al. - 1987 ACM DBLP
82 Hierarchi- cal Memory with Block Transfer (context) - Aggarwal, Chandra et al. - 1987
68 The ubiquitous B-tree (context) - Comer - 1979 DBLP
68 An efficient algorithm for determining the convex hull of a .. (context) - Graham - 1972 DBLP
64 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1986 ACM
59 Coding Techniques for Handling Fail- ures in Large Disk Arra.. - Gibson, Hellerstein et al. - 1988
59 Deterministic distribu- tion sort in shared and distributed .. (context) - Nodine, Vitter - 1993
53 Convex hulls of finite sets of points in two and three dimen.. (context) - Preparata, Hong - 1977 ACM
40 Probabilistic recurrence relations (context) - Karp - 1991 ACM DBLP
31 Organization of large ordered indexes (context) - Bayer, McCreight - 1972
20 Fractional Cascading: I. A Data Structuring Technique (context) - Chazelle, Guibas - 1986 DBLP
18 Optimal parallel randomized algo- rithms for three-dimension.. (context) - Reif, Sen - 1992
17 the Parallel- Decomposability of Geometric Problems (context) - Atallah, Tsay - 1992
17 An Intellegent Information Fusion System for Handling the Ar.. (context) - Cromp - 1993
15 The TWA Reservation System (context) - Gifford, Spector - 1984 ACM DBLP
11 Efficient memory access in large-scale computation (context) - Tamassia, Vitter et al. - 1991 DBLP
9 Optimal Cooperative Search in Fractional Cascaded Data Struc.. - Tamassia, Vitter - 1990 ACM DBLP
6 Fractional Cascading: II. Applications (context) - Chazelle, Guibas - 1986 DBLP
5 Disk Array Mass Storage Systems: The New Opportunity (context) - Jilke - 1986
5 Hysterical B-trees (context) - Maier, Salveter - 1981 DBLP
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 ACM DBLP
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 ACM
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.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC