{"uid":"cap_6JwX83rzwRb0kFWoajEXp","slug":"convex-polygon-visibility-graph-euclidean-shortest-route-71ec3421","name":"Convex Polygon Visibility Graph Euclidean Shortest Route","description":"Compute the shortest boundary-permitted route around a supplied bounded polygon model.","url":"https://detect.halowerk.com/v1/F-TD2000-GEO-INDUSTRY-B007/convex-polygon-visibility-graph-euclidean-shortest-route?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"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}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.003","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.003/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.003","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.003","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_hhlvCdWAjFFszevCLrkf2","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.003","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"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.","exampleAgentPrompt":"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.","exampleUseCases":[{"title":"Robot arm collision-free routing","prompt":"Plan the shortest path for a robot moving from position (0, 0) to (900, 900) in a workspace with three rectangular obstacle zones: corners at (150,150),(250,150),(250,350),(150,350), at (400,200),(550,200),(550,400),(400,400), and at (600,600),(800,600),(800,800),(600,800) — what waypoints should it follow?"},{"title":"Game NPC pathfinding around walls","prompt":"My game character needs to get from (50, 50) to (950, 950) on a 2D map with four polygon wall obstacles defined by vertices (200,200),(300,200),(300,400),(200,400) and (500,100),(600,100),(600,300),(500,300) and (100,600),(250,600),(250,750),(100,750) and (700,500),(850,500),(850,700),(700,700) — what's the shortest route around all of them?"},{"title":"Warehouse autonomous vehicle routing","prompt":"Calculate the shortest obstacle-avoiding path for an autonomous cart going from start position (-500, -500) to goal position (500, 500) with two polygon shelf obstacles at corners (-200,-300),(-100,-300),(-100,100),(-200,100) and (100,-100),(300,-100),(300,200),(100,200) in the warehouse grid."}],"resultDescription":"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.","failureModes":["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)"],"whenToPreferThis":"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.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-11-04T06:40:37.661Z","isFirstParty":false,"canonicalSlug":"convex-polygon-visibility-graph-euclidean-shortest-route-71ec3421"}