Method Div

path_intersection.go:215–217

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 holes CW, and tries to separate paths as much as possible. Paths are grouped by the filling/outer ring followed by the correspon

(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) Div(q *Path) *Path {
	return bentleyOttmann(p.Split(), q.Split(), opDIV, NonZero).Merge()
}

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