(Enter summary)
Abstract: In the design of algorithms for large-scale applications it is
essential to consider the problem of minimizing I/O communication. Geographical
information systems (GIS) are good examples of such largescale
applications as they frequently handle huge amounts of spatial data. (Update)
Cited by: More
Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep
(Correct)
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica..
(Correct)
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003)
(Correct)
Similar documents (at the sentence level):
74.3%: External-Memory Algorithms for Processing Line Segments.. - Arge, al. (1995)
(Correct)
48.7%: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
32.5%: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1998)
(Correct)
Active bibliography (related documents): More All
0.4: External-Memory Algorithms with Applications in Geographic.. - Arge (1997)
(Correct)
0.4: Optimal Dynamic Interval Management in External Memory - Arge (1996)
(Correct)
0.3: Efficient Algorithms for Line and Curve Segment.. - Boissonnat, Snoeyink (1999)
(Correct)
Similar documents based on text: More All
0.5: On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen
(Correct)
0.5: The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge
(Correct)
0.5: I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995)
(Correct)
Related documents from co-citation: More All
42: External-Memory Computational Geometry
- Goodrich, Tsay et al. - 1993
25: External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
25: Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
BibTeX entry: (Update)
L. Arge, D.E. Vengroff and J.S. Vitter. External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. 3rd Annual European Symposium on Algorithms, LNCS 979, pp. 295-310, 1995. http://citeseer.ist.psu.edu/article/arge95externalmemory.html More
@inproceedings{ arge95externalmemory,
author = "Lars Arge and Darren Erik Vengroff and Jeffrey Scott Vitter",
title = "External-Memory Algorithms for Processing Line Segments in Geographic Information Systems",
booktitle = "Proceedings of the Third European Symposium on Algorithms",
volume = "979",
publisher = "Springer-Verlag",
address = "Corfu, Greece",
pages = "295--310",
year = "1995",
url = "citeseer.ist.psu.edu/article/arge95externalmemory.html" }
Citations (may not include all citations):
284
An introduction to disk drive modeling
- Ruemmler, Wilkes - 1994 ACM DBLP
229
Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
180
Triangulating a simple polygon in linear time (context) - Chazelle - 1990 ACM DBLP
121
External-memory computational geometry
- Goodrich, Tsay et al. - 1993
114
An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1992 ACM DBLP
110
Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
109
inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
107
External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
67
a data structuring technique (context) - Chazelle, Guibas - 1986
60
Algorithms for bichromatic line-segment problems and polyhed.. (context) - Chazelle, Edelsbrunner et al. - 1994
59
Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993 ACM DBLP
48
Triangulating simple polygons and equivalent problems (context) - Fournier, Montuno - 1984 ACM DBLP
37
Large-scale sorting in parallel memories (context) - Nodine, Vitter - 1991
29
Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985 DBLP
27
Reporting and counting intersections between two sets of lin.. (context) - Mairson, Stolfi - 1988
21
Exploiting extensible dbms in integrated geographic informat.. (context) - Haas, Cody - 1991 ACM DBLP
19
simple trapezoid sweep algorithm reporting redblue segment i..
- trapezoid, for et al. - 1994
17
An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
15
Further comparisons of algorithms for geometric intersection..
- Andrews, Snoeyink et al. - 1994
14
A general lower bound on the I/Ocomplexity of comparison-bas..
- Arge, Knudsen et al. - 1993
13
er tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
12
Rectilinear line segment intersection (context) - Vaishnavi, Wood - 1982
4
Counting and reporting redblue segment intersection (context) - Snoeyink, reporting et al. - 1993
4
Understanding GI ARCINFO method (context) - Understanding, ARC et al. - 1993
3
Guest Editor's Introduction in IEEE Comp (context) - Patt, candidate et al. - 1994
3
Geographic information systems (context) - van Kreveld - 1995 ACM DBLP
2
ciency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
2
This article was processed using the L T E X macro package w.. (context) - Vitter, Shriver et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~large/index.html): More
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge
(Correct)
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold (1999)
(Correct)
I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al.
(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