Method Not

path_intersection.go:204–206

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

(qs Paths)

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

// Div returns the boolean path operation of path p DIV q, i.e. p divided by q.
// It removes all self-intersections and overlapping areas, orients all filling paths CCW and all