1.

Boolean Set Operations: How Can I Compute Them?

Answer»

The PACKAGE Regularized Boolean Set-Operation CONSISTS of the implementation of Boolean set-operations on POINT sets bounded by weakly x-monotone curves in 2-dimensional Euclidean space. In particular, it contains the implementation of regularized Boolean set-operations, intersection predicates, and point containment predicates.

Ordinary Boolean set-operations that operate on (linear) polygons, which distinguish between the interior and the boundary of a polygon, are supported by the Planar Neff Polyhedra package.

For INTERSECTIONS of the interiors of polygons also REFER to the polygon intersection demo program, which is also available in the demo directory of the CGAL distribution.

The package Regularized Boolean Set-Operation consists of the implementation of Boolean set-operations on point sets bounded by weakly x-monotone curves in 2-dimensional Euclidean space. In particular, it contains the implementation of regularized Boolean set-operations, intersection predicates, and point containment predicates.

Ordinary Boolean set-operations that operate on (linear) polygons, which distinguish between the interior and the boundary of a polygon, are supported by the Planar Neff Polyhedra package.

For intersections of the interiors of polygons also refer to the polygon intersection demo program, which is also available in the demo directory of the CGAL distribution.



Discussion

No Comment Found