raygeo.geo.algo.nest2d.collision

Collision detection for nesting algorithms.

Provides overlap checks with bounding-box, convex hull, and detailed polygon intersection, including hierarchical variants for performance.

Functions

any_overlap()

any_overlap(
    candidate: types.Polygon,
    placed: Sequence[types.Polygon],
    min_area: float = 1,
) -> bool

Check if a candidate polygon overlaps any placed polygon.

Parameter	Type	Description
candidate	types.Polygon	Candidate polygon.
placed	Sequence[types.Polygon]	List of already-placed polygons.
min_area	float = 1	Minimum overlap area to consider (in clipper coords).
Returns	bool	True if any overlap detected.
Complexity		O(n * m) where n = candidate vertices, m = placed polygon vertices.

any_overlap_hierarchical()

any_overlap_hierarchical(
    candidate_polys: Sequence[numpy.ndarray],
    candidate_hulls: Sequence[numpy.ndarray],
    placed_polys_groups: Sequence[Sequence[numpy.ndarray]],
    placed_hulls_groups: Sequence[Sequence[numpy.ndarray]],
    min_area: float = 1,
) -> bool

Hierarchical overlap: bbox -> hull -> detailed polygon.

Parameter	Type	Description
candidate_polys	Sequence[numpy.ndarray]	Candidate polygons to check.
candidate_hulls	Sequence[numpy.ndarray]	Convex hulls of candidate polygons.
placed_polys_groups	Sequence[Sequence[numpy.ndarray]]	Groups of already-placed polygons.
placed_hulls_groups	Sequence[Sequence[numpy.ndarray]]	Convex hulls of placed groups.
min_area	float = 1	Minimum overlap area (clipper coords).
Returns	bool	True if any overlap detected.
Complexity		O(n * m) with bbox/hull early-exit acceleration.

any_overlap_hierarchical_grid()

any_overlap_hierarchical_grid(
    candidate_polys: Sequence[numpy.ndarray],
    candidate_hulls: Sequence[numpy.ndarray],
    placed_polys_groups: Sequence[Sequence[numpy.ndarray]],
    placed_hulls_groups: Sequence[Sequence[numpy.ndarray]],
    spatial_grid: spatial_grid2d.SpatialGrid,
    candidate_bbox: tuple[float, float, float, float],
    min_area: float = 1,
) -> bool

Parameter	Type	Description
candidate_polys	Sequence[numpy.ndarray]
candidate_hulls	Sequence[numpy.ndarray]
placed_polys_groups	Sequence[Sequence[numpy.ndarray]]
placed_hulls_groups	Sequence[Sequence[numpy.ndarray]]
spatial_grid	spatial_grid2d.SpatialGrid	SpatialGrid for fast neighbor lookup.
candidate_bbox	tuple[float, float, float, float]
min_area	float = 1
Returns	bool
Complexity		O(n * m / k) where k = grid cell density factor.

is_contained()

is_contained(inner: Sequence[types.Polygon], outer: types.Polygon) -> bool

Check if inner polygons are fully contained within outer polygon.

Parameter	Type	Description
inner	Sequence[types.Polygon]	List of polygons to check.
outer	types.Polygon	Outer polygon.
Returns	bool	True if all inner polygons are inside outer.
Complexity		O(n * m) where n = inner polygons, m = outer polygon vertices.