Directory / detect.halowerk.com
detect.halowerk.com/v1/F-TD2000-GEO-INDUSTRY-B007/convex-polygon-visibility-graph-euclidean-shortest working
https://detect.halowerk.com/v1/F-TD2000-GEO-INDUSTRY-B007/convex-polygon-visibility-graph-euclidean-shortest-route
Before you pay
- Advice
ok- Protocol
- x402 · http · POST
- Asks for
- 0.003 USDC on base
- Catalogue says
- 0.003 USDC
- Pays to
0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E- Last check
- 18 min ago · 14 ms · HTTP 402
- Detail
- 402 with valid terms
Reliability
- Uptime 24 h
- 100.0%
- Uptime 7 days
- 100.0% (1 checks)
- Paid calls 30 d
- 1 from 1 payers (x402 Bazaar)
- Listed by
- x402-bazaar
- First seen
- 2026-11-05 22:12 UTC
Description (from the catalogue, unverified)
Compute the shortest boundary-permitted route around a supplied bounded polygon model.
Signed history
No signed statements yet: status changes, daily summaries and live checks appear here.
Verify any statement offline: how.
For agents and owners
JSON: https://alalanet.com/v1/services/jdrpxiwav3ymuovf
Badge:
<a href="https://alalanet.com/s/jdrpxiwav3ymuovf"><img src="https://alalanet.com/badge/jdrpxiwav3ymuovf" alt="alalanet status"></a>Own this service? Get verified. Do not want it checked? See the prober page.