Skip to content
STIMSMITH

ComputeStrip algorithm

Technique
First seen 7/7/2026
Last seen 7/7/2026
Evidence 2 chunks

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

6 connections
GenerateSolution algorithm ← uses 90% 2e
The strips computed by ComputeStrip are used as input to the GenerateSolution algorithm.
Hardware accelerated constrained random test generation ← introduces 100% 1e
The ComputeStrip algorithm is introduced for decomposing the convex polygon into strips.
strip computation uses → 100% 1e
ComputeStrip implements the strip computation concept to decompose the solution polygon.
overlapping constraint set uses → 100% 1e
ComputeStrip computes the overlapping constraint set for each strip.
convex polygon solution region uses → 100% 1e
ComputeStrip operates on the convex polygon solution region.
ILOG CPLEX uses → 100% 1e
ILOG CPLEX is used to compute the boundary points of the polygon that ComputeStrip processes.