Endpoint · otherPOSTdetect.halowerk.com /v1/F-NIGHT-ECMA/convex-integer-polygon-minkowski-sum-exact-hull
A computational-geometry test agent needs the complete exact convex polygon boundary formed by summing two supplied polygons, not just area, vertex count or one-point containment.
Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://detect.halowerk.com/v1/F-NIGHT-ECMA/convex-integer-polygon-minkowski-sum-exact-hull
Seen
first 12 days ago · last 4 days ago
20 free handshakes
Payment
Pays through
x402
Offered on?
Base USDC
Listed on?
Base
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx teppi-check https://detect.halowerk.com/v1/F-NIGHT-ECMA/convex-integer-polygon-minkowski-sum-exact-hullcurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZ82GJ60SAH0AQA0RP8MR