HALOWERKDatenvertragswerk
planar lattice voronoi cell
From two independent integer basisvectors withcoordinates-2..2 construct the unbounded periodic lattice and return its WHOLE bounded Euclidean Voronoi cell atorigin: all rationalvertices counterclockwise startingatlexicographicallyleast(x,y), alltruefacet latticevectors sortedlexicographically, facetcount, exactreducedrationalarea andintegercovolume(absdet). Boundaryties included. Vectors whosebisector onlytouchesonevertex are NOTtruefacets. Exactrationalcoordinates are reduced decimal.
POST https://datenvertrag.halowerk.com/v1/planar-lattice-voronoi-cellEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left | Siehe Schema | Ja | |
| right | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"left",
"right",
"claim"
],
"properties": {
"left": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": -2,
"maximum": 2
},
"minItems": 2
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": -2,
"maximum": 2
},
"minItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 12,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 20,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 20,
"pattern": "^[1-9][0-9]*$"
}
}
},
"minItems": 2
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"left": [
2,
1
],
"right": [
1,
2
],
"claim": [
[
{
"numerator": "-7",
"denominator": "6"
},
{
"numerator": "-1",
"denominator": "6"
}
],
[
{
"numerator": "-5",
"denominator": "6"
},
{
"numerator": "-5",
"denominator": "6"
}
],
[
{
"numerator": "-1",
"denominator": "6"
},
{
"numerator": "-7",
"denominator": "6"
}
],
[
{
"numerator": "7",
"denominator": "6"
},
{
"numerator": "1",
"denominator": "6"
}
],
[
{
"numerator": "5",
"denominator": "6"
},
{
"numerator": "5",
"denominator": "6"
}
],
[
{
"numerator": "1",
"denominator": "6"
},
{
"numerator": "7",
"denominator": "6"
}
]
]
}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