Calculating the Area of Overlaid Polygons Without Constructing the Overlay

An algorithm and implementation for calculating the areas of overlaid polygons without calculating the overlay itself, is presented. Overprop is useful when the sole purpose of overlaying two maps is to find some mass property of the resulting polygons, or for an areal interpolation of data from one map to the other. Finding the areas of all the output polygons is both simpler and more robust than finding the polygons themselves. Overprop works from a reduced representation of each map as a set of "half-edges"; with no global topology. It uses the uniform grid to find edge intersections. The method is not statistical, but is exact within the arithmetic precision of the machine. It is well-suited to a parallel machine, and could be extended to overlaying more than two maps simultaneously, and to determining other properties of the output polygons, such as perimeter or center of mass. Overprop has been implemented as a C program, and is very fast. The execution time on a Sun Sparcstation 10/30 to combine US...

[1]  D. Knuth.  Surreal numbers : how two ex-students turned on to pure mathematics and found total happiness : a mathematical novelette , 1974 .

[2]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[3]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[4]  Jose Armando Guevara.  A framework for the analysis of geographic information system procedures: the polygon overlay problem, computational complexity and polyline intersection , 1983 .

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[7]  Wm. Randolph Franklin.  Problems with raster graphics algorithms , 1986 .

[8]  W. Randolph Franklin.  Polygon properties calculated from the vertex neighborhoods , 1987, SCG '87.

[9]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[10]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[11]  The Analogue to Digital Revolution: A View From an Unreconstructed Geographer , 1988 .

[12]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[13]  Roberto Tamassia,et al.  Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..

[14]  Pankaj K. Agarwal.  Geometric Partitioning and its Applications , 1990, Discrete and Computational Geometry.

[15]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  W. Randolph Franklin,et al.  A logic programming approach to cartographic map overlay , 1990, Comput. Intell..

[17]  A. James Stewart.  Robust Point Location in Approximate Polygons , 1991 .

[18]  Roberto Tamassia,et al.  An Incremental Reconstruction Method for Dynamic Planar Point Location , 1991, Inf. Process. Lett..

[19]  Daniel F. Wagner.  Development and proof-of-concept of a comprehensive performance evaluation methodology for geographic information systems , 1992 .

[20]  Mohan S. Kankanhalli,et al.  Volumes From Overlaying 3-D Triangulations in Parallel , 1993, SSD.