Method And

path_intersection.go:153–155

And is the same as Path.And, but faster if paths are already split. Each resulting path is a single filling path followed by its holes as subpaths.

(qs Paths)

// And is the same as Path.And, but faster if paths are already split. Each resulting path
// is a single filling path followed by its holes as subpaths.
func (ps Paths) And(qs Paths) Paths {
	return bentleyOttmann(ps, qs, opAND, NonZero)
}

// Or returns the boolean path operation of path p OR q, i.e. the union of both. It
// It removes all self-intersections and overlapping areas, orients all filling paths CCW and all