10 citations found. Retrieving documents...
ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Efficient External-Memory Data Structures and Applications - Arge (1996)   (32 citations)  (Correct)

....segments, important GIS operations involve such line segments in the plane. As an illustration, the computation of 18 new scenes or maps from existing information also called map overlaying is an important GIS operation. Some existing software packages are completely based on this operation [9, 10, 106, 124]. Given two thematic maps, that is, maps with e.g. indications of lakes, roads, or pollution levels, the problem is to compute a new map in which the thematic attributes of each location is a function of the thematic attributes of the corresponding locations in the two input maps. For example, the ....

....to an extra multiplicative factor of B in the I O bound, which is very significant in practice. As mentioned, the red blue line segment intersection problem is of special interest because it is an abstraction of the important map overlay problem, which is the core of several vectorbased GISs [9, 10, 106]. Although a time optimal internal memory algorithm for the general intersection problem exists [37] a number of simpler solutions have been presented for the red blue problem [35, 38, 87, 106] Two of these algorithms [38, 106] are not plane sweep algorithms, but both sort segments of the same ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


On External-Memory MST, SSSP and Multi-way Planar Graph.. - Arge, Brodal, al. (2000)   (Correct)

.... of a massive graph is AT T s 20TB phone call data graph [11] Other examples of massive graphs arise in Geographic Information Systems (GIS) For instance, GIS terrains are often represented using planar graphs and many common GIS problems can be formulated as standard graph problems (Arc Info [4], the most commonly used GIS package, contains functions that correspond to computing depth first, breadth first, and minimum spanning trees, as well as shortest paths and connected components) When working with such massive graphs the I O communication, and not the internal memory computation ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998)   (54 citations)  (Correct)

....New York, USA, 1998 1 Introduction and Motivation Geographic Information Systems (GIS) have generated enormous interest in the commercial and research database communities over the last decade. Several commercial products that manage spatial data are available. These include ESRI s ARC INFO [ARC93] InterGraph s MGE [Int97] and Informix [Ube94] GISs typically store and manage spatial data such as points, lines, poly lines, polygons, and surfaces. Since the amount of data they manage is quite large, GISs are often diskbased systems. An extremely important problem on spatial data is the ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


Efficient External-Memory Data Structures and Applications - Arge (1996)   (32 citations)  (Correct)

....segments, important GIS operations involve such line segments in the plane. As an illustration, the computation of 18 new scenes or maps from existing information also called map overlaying is an important GIS operation. Some existing software packages are completely based on this operation [9, 10, 106, 124]. Given two thematic maps, that is, maps with e.g. indications of lakes, roads, or pollution levels, the problem is to compute a new map in which the thematic attributes of each location is a function of the thematic attributes of the corresponding locations in the two input maps. For example, the ....

....to an extra multiplicative factor of B in the I O bound, which is very significant in practice. As mentioned, the red blue line segment intersection problem is of special interest because it is an abstraction of the important map overlay problem, which is the core of several vectorbased GISs [9, 10, 106]. Although a time optimal internal memory algorithm for the general intersection problem exists [37] a number of simpler solutions have been presented for the red blue problem [35, 38, 87, 106] Two of these algorithms [38, 106] are not plane sweep algorithms, but both sort segments of the same ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998)   (54 citations)  (Correct)

....New York, USA, 1998 1 Introduction and Motivation Geographic Information Systems (GIS) have generated enormous interest in the commercial and research database communities over the last decade. Several commercial products that manage spatial data are available. These include ESRI s ARC INFO [ARC93] InterGraph s MGE [Int97] and Informix [Ube94] GISs typically store and manage spatial data such as points, lines, poly lines, polygons, and surfaces. Since the amount of data they manage is quite large, GISs are often diskbased systems. An extremely important problem on spatial data is the ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al.   (Correct)

....as a problem on a directed acyclic grid graph with edges directed from a vertex to its downslope neighbors. It turns out that many other common GIS problems on grid based terrains correspond to standard, or minor variations of, graph theoretic problems on grid graphs. For example, Arc Info [9], the most commonly used GIS package, contains functions that correspond to computing depth first, breadth first, and minimum spanning trees, as well as shortest paths and connected components on grid graphs. 1.2 Memory model and previous results on I O efficient algorithms We will be working in ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


Selectivity Estimation in Spatial Databases - Acharya, Poosala, Ramaswamy (1999)   (41 citations)  (Correct)

....over the last decade. GISs typically store and manage spatial data such as points, lines, poly lines, polygons, and surfaces and hence are often referred to as spatial databases. Several commercial database systems that manage spatial data are now available. These include ESRI s ARC INFO [ARC93] InterGraph s MGE [Int97] MapInfo [Map98] and Informix [Ube94] Most other leading database vendors Work done while the author was at Bell Labs. Current affiliation is Epiphany Inc. 2300 Geng Road, Suite 200, Palo Alto CA 94303. Appears in the Proceedings of ACM SIGMOD Conference, ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998)   (54 citations)  (Correct)

....jsv cs.duke.edu. 1 Introduction and Motivation Geographic Information Systems (GISs) have generated enormous interest in the commercial and research database communities over the last decade. Several commercial products that manage spatial data are available. These include ESRI s ARC INFO [ARC93] InterGraph s MGE [Int97] and Informix [Ube94] GISs typically store and manage spatial data such as points, lines, poly lines, polygons, and surfaces. Since the amount of data that they manage is quite large, GISs typically tend to be disk based systems. Efficient retrieval of spatial data ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995)   (30 citations)  (Correct)

....to an extra multiplicative factor of DB in the I O bound, which is very significant in practice. As mentioned, the red blue line segment intersection problem is of special interest because it is an abstraction of the important map overlay problem, which is the core of several vector based GISs [2, 3, 22]. Our red blue line segment intersection algorithm is optimal because the external memory lower bound technique of [5] can be applied to the internal memory lower bound of Omega (N log N T ) to get an Omega (n log m n t) I O lower bound on the problem. Although a time optimal ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.


External-Memory Algorithms with Applications in Geographic.. - Arge (1997)   (10 citations)  (Correct)

....a subdivision of the map into regions labeled with the use of a particular region. One of most fundamental operations in many GIS systems is map overlaying the computation of new scenes or maps from a number of existing maps. Some existing software packages are completely based on this operation [10, 11, 75, 87]. Given two thematic maps the problem is to compute a new map in which the thematic attributes of each location is a function of the thematic attributes of the corresponding locations in the two input maps. For example, the input maps could be a map of land utilization and a map of pollution ....

ARC/INFO. Understanding GIS---the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.

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