HALOWERKDatenvertragswerk
exact minimum width strip audit
For1..16 supplied planar integer points with coordinates between-100 and100, returns reduced exact minimum squared distance between enclosing parallel lines, every optimal canonical primitive normal and both support lines with every original supportpoint index. One unique point location has zero width in all directions, represented explicitly. Collinear distinctpoints have one zero-width direction. Canonical normals have nx>0 or nx=0,ny>0 and are ordered by nx,ny. Claimed widthfraction and.
POST https://datenvertrag.halowerk.com/v1/exact-minimum-width-strip-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| points | array | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"points": {
"type": "array",
"minItems": 1,
"maxItems": 16,
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"x": {
"type": "integer",
"minimum": -100,
"maximum": 100
},
"y": {
"type": "integer",
"minimum": -100,
"maximum": 100
}
},
"required": [
"x",
"y"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"minimum_width_squared": {
"type": "object",
"properties": {
"numerator": {
"type": "integer",
"minimum": 0,
"maximum": 6400000000
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 80000
}
},
"required": [
"numerator",
"denominator"
],
"additionalProperties": false
},
"normals": {
"type": "array",
"maxItems": 120,
"items": {
"type": "object",
"properties": {
"nx": {
"type": "integer",
"minimum": 0,
"maximum": 200
},
"ny": {
"type": "integer",
"minimum": -200,
"maximum": 200
}
},
"required": [
"nx",
"ny"
],
"additionalProperties": false
}
},
"all_directions": {
"type": "boolean"
}
},
"required": [
"minimum_width_squared",
"normals",
"all_directions"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"points",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"points": [
{
"x": 0,
"y": 0
},
{
"x": 3,
"y": 0
},
{
"x": 0,
"y": 4
}
],
"claimed": {
"minimum_width_squared": {
"numerator": 144,
"denominator": 25
},
"normals": [
{
"nx": 4,
"ny": 3
}
],
"all_directions": false
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden