A new algorithm for computing Boolean operations on polygons

Authors:
Francisco Martínez;Antonio Jesús Rueda;Francisco Ramón Feito
Affiliations:
Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain;Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain;Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain
Venue:
Computers & Geosciences
Year:
2009

Citing 9
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Computer graphics: principles and practice (2nd ed.)

Computer graphics: principles and practice (2nd ed.)
A generic solution to polygon clipping

Communications of the ACM
Efficient clipping of arbitrary polygons

ACM Transactions on Graphics (TOG)
An analysis and algorithm for polygon clipping

Communications of the ACM
Reentrant polygon clipping

Communications of the ACM
Polygon comparison using a graph representation

SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Geometric Tools for Computer Graphics

Geometric Tools for Computer Graphics
An algorithm for polygon clipping, and for determining polygon intersections and unions

Computers & Geosciences

Collision free region determination by modified polygonal Boolean operations

Computer-Aided Design
A simple algorithm for Boolean operations on polygons

Advances in Engineering Software
A procedure for computing the symmetric difference of regions defined by polygonal curves

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.