# Convex Polygon Visibility Graph Euclidean Shortest Route

> Convex Polygon Visibility Graph Euclidean Shortest Route is a paid API for AI agents from detect.halowerk.com, paid per call via x402, $0.003/call, status unknown (last checked 2026-11-04).

Computes the shortest obstacle-avoiding Euclidean path between two points in a 2D bounded space with up to 4 convex polygon obstacles using a visibility graph algorithm.

## Facts

- Endpoint: POST https://detect.halowerk.com/v1/F-TD2000-GEO-INDUSTRY-B007/convex-polygon-visibility-graph-euclidean-shortest-route?utm_source=zero.xyz
- Price: $0.003/call
- Payment: x402
- Status: unknown
- Last checked: 2026-11-04
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/convex-polygon-visibility-graph-euclidean-shortest-route-71ec3421
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_6JwX83rzwRb0kFWoajEXp

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

## How to call it through Zero

Zero handles the 402 payment challenge and records the run. With the Zero CLI installed (`npm i -g @zeroxyz/cli`):

```sh
zero fetch --capability convex-polygon-visibility-graph-euclidean-shortest-route-71ec3421 -d '<json body>'
```

Example prompt: Find the shortest path from point (10, 20) to point (800, 750) in a 2D space with two rectangular obstacles: one with corners at (100,100), (200,100), (200,300), (100,300) and another at (400,400), (600,400), (600,600), (400,600) — give me the waypoints I need to follow to get around them.

## When to prefer this

Use this endpoint when you need an exact Euclidean shortest path around up to 4 convex polygon obstacles in a bounded 2D integer coordinate space (−1000 to 1000). It is ideal for 2D robotics motion planning, game AI pathfinding, warehouse routing, or any scenario where analytically optimal obstacle-avoiding paths are needed rather than approximate grid-based or probabilistic methods.

## Known failure modes

- Invalid coordinate values outside -1000 to 1000 range
- Polygon with fewer than 3 or more than 8 vertices rejected
- More than 4 obstacle polygons provided
- Start or goal point inside an obstacle polygon
- Malformed claim field in visibility artifact
- Missing required fields (start, goal, obstacles)

## How this service works

Compute the shortest boundary-permitted route around a supplied bounded polygon model.

## Output

Returns the shortest Euclidean path as an ordered sequence of 2D waypoints that navigates from start to goal while respecting all polygon obstacle boundaries, computed via a visibility graph over the obstacle vertices.

## Request schema (JSON Schema)

```json
{
 "type": "object",
 "properties": {
  "artifact": {
   "type": "object",
   "required": [
    "visibility"
   ],
   "properties": {
    "visibility": {
     "type": "object",
     "required": [
      "data",
      "claim"
     ],
     "properties": {
      "data": {
       "type": "object",
       "required": [
        "start",
        "goal",
        "obstacles"
       ],
       "properties": {
        "goal": {
         "type": "array",
         "items": {
          "type": "integer",
          "maximum": 1000,
          "minimum": -1000
         },
         "maxItems": 2,
         "minItems": 2
        },
        "start": {
         "type": "array",
         "items": {
          "type": "integer",
          "maximum": 1000,
          "minimum": -1000
         },
         "maxItems": 2,
         "minItems": 2
        },
        "obstacles": {
         "type": "array",
         "items": {
          "type": "array",
          "items": {
           "type": "array",
           "items": {
            "type": "integer",
            "maximum": 1000,
            "minimum": -1000
           },
           "maxItems": 2,
           "minItems": 2
          },
          "maxItems": 8,
          "minItems": 3
         },
         "maxItems": 4,
         "minItems": 0
        }
       },
       "additionalProperties": false
      },
      "claim": {}
     },
     "additionalProperties": false
    }
   },
   "additionalProperties": false
  }
 }
}
```

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/convex-polygon-visibility-graph-euclidean-shortest-route-71ec3421/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from detect.halowerk.com](https://www.zero.xyz/host/detect.halowerk.com/llms.txt)