An Efficient Algorithm for Finding the Union, Intersection and Differences of Spatial Domains

摘要

Information is often aggregated over two dimensional spatial domains. The result is a set of domains with specified properties. In many types of analysis, set theoretic functions of the domains are of particular interest. The paper presents a single algorithm for deriving the union, intersection, and differences of sets of spatial domains, the domains defined as closed sets of line segments. The algorithms may be easily structured to allow sets of operations. (Author)