Method And

path_intersection.go:147–149

And returns the boolean path operation of path p AND q, i.e. the intersection of both. It removes all self-intersections and overlapping areas, orients all filling paths CCW and all holes CW, and tries to separate paths as much as possible. Paths are grouped by the filling/outer ring followed by the

(q *Path)

// flat. Path q is implicitly closed. It runs in O((n + k) log n), with n the number of segments,
// and k the number of intersections.
func (p *Path) And(q *Path) *Path {
	return bentleyOttmann(p.Split(), q.Split(), opAND, NonZero).Merge()
}

// 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.