A new algorithm for computing Boolean operations on polygons

Francisco Martínez

doi:10.1016/j.cageo.2008.08.009

2009-06-01

PRE

Francisco Martínez *

Antonio J. Rueda

Francisco R. Feito

DOI：10.1016/j.cageo.2008.08.009

原文链接

原文求助

摘要

En 中文

This paper presents a new algorithm for computing Boolean operations on polygons. These kind of operations are frequently used in the geosciences in order to get spatial information from spatial data modeled as polygons. The presented algorithm is simple and easy to understand and implement. Let n be the total number of edges of all the polygons involved in a Boolean operation and k be the number of intersections of all the polygon edges. Our algorithm computes the Boolean operation in time O((n + k) log(n)). Finally, the proposed algorithm works with concave polygons with holes, and with regions composed of polygon sets. Furthermore, it can be easily adapted to work with self-intersecting polygons. (C) 2008 Elsevier Ltd. All rights reserved.

Keyword:

Polygon clipping

Boolean operations polygons

Polygon overlay