US 2026/0268599 A1 · PARALLEL COMPUTATION OF BOOLEAN LOGIC OPERATIONS FOR MULTI-DIMENSIONAL GEOMETRIES

Abstract

In various examples, systems and methods are disclosed relating to implementing parallel computation of Boolean logic operations between 2-D geometric polygon sets. A system can identify a plurality of first edges of a first polygon and a plurality of second edges of a second polygon. The system can generate, based at least on a Boolean operation for the first polygon and the second polygon, a set of intersection points corresponding to intersections between at least one first edge of the plurality of first edges and at least one second edge of the plurality of second edges. The system can generate a directed graph data structure for the Boolean operation using the set of intersection points, and generate an output polygon based at least on the directed graph data structure.

Claims20

Dependent claims

One or more processors comprising:

one or more circuits to:
identify a plurality of first edges of a first polygon and a plurality of second edges of a second polygon;
generate, based at least on a Boolean operation for the first polygon and the second polygon, a set of intersection points corresponding to intersections between at least one first edge of the plurality of first edges and at least one second edge of the plurality of second edges;
generate a directed graph data structure for the Boolean operation using the set of intersection points;
and
generate an output polygon based at least on the directed graph data structure.

3 more elements

Dependencies are inferred from the claim text.

Parallel computation of boolean logic operations for multi-dimensional geometries

Life of this patent

Parallel computation of boolean logic operations for multi-dimensional geometries

Life of this patent

Abstract

Claims20