Geographic Information Systems

  title={Geographic Information Systems},
  author={Bernhard Seeger and Peter Widmayer},
  booktitle={Handbook of Data Structures and Applications},
The power of a GIS comes from the ability to relate different information in a spatial context and to reach a conclusion about this relationship. Most of the information we have about our world contains a location reference, placing that information at some point on the globe. When rainfall information is collected, it is important to know where the rainfall is located. This is done by using a location reference system, such as longitude and latitude, and perhaps elevation. Comparing the… 


Map labeling and its generalizations
A bicriteria version of the map-labeling problem is formulated and polynomial-time approximation schemes for a number of such problems are provided.
An Algorithm for Locating Candidate Labeling Boxes Within a Polygon
An algorithm is presented that circumvents both of these problems, by computing a number of horizontal candidate labeling rectangles within a polygon from which a suitable selection can be made or from which one may conclude that the text label does not fit the polygon.
Positioning Names on Maps
Prof. Dr. Eduard Imhof, dean of European cartographers, has been an astute student of the esthetic-scientific characteristics of the cartographic method. In this paper published 13 years ago, he
Finding Rectangle Intersections by Divide-and-Conquer
The results show that divide-and-conquer can be used in place of line sweep, without additional asymptotic cost, for some geometrical problems.
A packing problem with applications to lettering of maps
The following packing problem arises in connection with lettering of maps: Given n distinct points pl, p2, . . . . pn in the plane, determine the supremum uoPi of all reals U, such that there are n
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
This paper investigates the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane and describes an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found.
Algorithms for Reporting and Counting Geometric Intersections
Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Positioning names on maps. The American Cartographer
  • Positioning names on maps. The American Cartographer
  • 1975
Approximate map labeling is in (n logn)
  • Inform. Process. Lett
  • 1994