External-Memory Computational Geometry (1993)  (Make Corrections)  (98 citations)
Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter
Proceedings of the 34th Annual Symposium on Foundations of Computer Science

  Home/Search   Context   Related
 
View or download:
mpisb.mpg.de/~crause...GTV93.ecg.ps.gz
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  mpisb.mpg.de/~crauser/papers (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  
(Enter summary)

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. We use these techniques to develop optimal and practical algorithms for a number of important largescale problems. We discuss our algorithms primarily in the context 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):
68.0%:   External-Memory Computational Geometry (Preliminary.. - Goodrich, Tsay..   (Correct)
44.2%:   External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Minimizing the Input/Output Bottleneck - Nodine (1992)   (Correct)
0.6:   Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992)   (Correct)
0.3:   Fast Randomized Parallel Methods for Planar Convex Hull.. - Mujtaba Ghouse (1991)   (Correct)

Similar documents based on text:   More   All
0.5:   Optimal Cooperative Search In Fractional Cascaded Data.. - Tamassia, Vitter (1995)   (Correct)
0.3:   External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995)   (Correct)
0.1:   TPIE - User Manual and Reference - Arge, Barve, Hutchinson, Procopiuc.. (1999)   (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/article/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/article/goodrich93externalmemory.html" }
Citations (may not include all citations):
1114   Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985    
540   The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
276   Constraint Query Languages - Kanellakis, Kuper et al. - 1990
223   Primitives for the Manipulation of General Subdivisions and .. (context) - Guibas, Stolfi - 1985
166   Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
159   Volume 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   Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
95   Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. - 1993
85   Algorithms for Parallel Memory I: Two-Level Memories - Vitter, Shriver - 1990
70   A Model for Hierarchical Memory (context) - Aggarwal, Alpern et al. - 1987
70   Hierarchical 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 Distribution Sort in Shared and Distributed Me.. (context) - Nodine, Vitter - 1993
51   Coding Techniques for Handling Failures in Large Disk Arrays - Gibson, Hellerstein et al. - 1988
50   Convex Hulls of Finite Sets of Points in Two and Three Dimen.. (context) - Preparata, Hong - 1977
44   The Uniform Memory Hierarchy Model of Computation - Alpern, Carter et al. - 1990
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 Algorithms for Three-Dimensional.. (context) - Reif, Sen - 1992
16   Algorithms for Parallel Memory II: Hierarchical Multilevel M.. - Vitter, Shriver - 1990
15   The TWA Reservation System (context) - Gifford, Spector - 1984
12   The Input/Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
11   Efficient Memory Access in Large-Scale Computation (context) - Tamassia, Vitter et al.
11   The Ultimate Planar Convex Hull Algorithm (context) - Kirkpatrick, Seidel - 1986
10   the ParallelDecomposability 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   Fractional Cascading: II. Applications (context) - Chazelle, Guibas - 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
3   Store More, Spend Less: MidRange Options Around (context) - Maginnis - 1987
2   Geometric Partioning Made Easier, Even in Parallel (context) - Goodrich - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.mpi-sb.mpg.de/~crauser/papers.html):   More
Optimal Dynamic Interval Management in External Memory - Arge, Vitter (1996)   (Correct)
Blocking for External Graph Searching - Nodine (1996)   (Correct)
Randomized External-Memory Algorithms for Some.. - Crauser, Ferragina, .. (1998)   (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