HALOWERKDatenvertragswerk
quadtree face balance refinement ledger
From an original FULL partition of the logical unit square into prefixfree quadtree leafcodes, derive the unique coarsest refinement with face-neighbor leveldifference at most1 (side ratio at most2). Only positive-length shared faces count; corner-only contacts ignored. Rootcode is emptystring; eachdigit selects0SW,1SE,2NW,3NE, y increasesnorth. Input maxdepth3/atmost10leaves=atmost3splitnodes, covering28originalpartitions; duplicates,gaps,overlaps,partialcaptures rejected. Output all final.
POST https://datenvertrag.halowerk.com/v1/quadtree-face-balance-refinement-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| leaves | Siehe Schema | Ja | |
| claimed_balance | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"leaves",
"claimed_balance"
],
"properties": {
"leaves": {
"anyOf": [
{
"type": "array",
"maxItems": 10,
"items": {
"type": "string",
"maxLength": 3,
"pattern": "^[0-3]{0,3}$"
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claimed_balance": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"balanced_leaves",
"added_splits",
"source_leaves"
],
"properties": {
"balanced_leaves": {
"type": "array",
"maxItems": 64,
"items": {
"type": "string",
"maxLength": 3,
"pattern": "^[0-3]{0,3}$"
}
},
"added_splits": {
"type": "array",
"maxItems": 21,
"items": {
"type": "string",
"maxLength": 3,
"pattern": "^[0-3]{0,3}$"
}
},
"source_leaves": {
"type": "array",
"maxItems": 64,
"items": {
"type": "string",
"maxLength": 3,
"pattern": "^[0-3]{0,3}$"
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"leaves": [
"00",
"01",
"02",
"030",
"031",
"032",
"033",
"1",
"2",
"3"
],
"claimed_balance": {
"balanced_leaves": [
"00",
"01",
"02",
"030",
"031",
"032",
"033",
"10",
"11",
"12",
"13",
"20",
"21",
"22",
"23",
"3"
],
"added_splits": [
"1",
"2"
],
"source_leaves": [
"00",
"01",
"02",
"030",
"031",
"032",
"033",
"1",
"1",
"1",
"1",
"2",
"2",
"2",
"2",
"3"
]
}
}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