(original) (raw)

{"entities":{"Q2835805":{"pageid":2716045,"ns":0,"title":"Q2835805","lastrevid":2261194036,"modified":"2024-10-15T23:38:46Z","type":"item","id":"Q2835805","labels":{"fr":{"language":"fr","value":"algorithme de Lloyd-Max"},"en":{"language":"en","value":"Lloyd's algorithm"},"ur":{"language":"ur","value":"\u0644\u0627\u0626\u06cc\u0688 \u0627\u0644\u062e\u0648\u0627\u0631\u0632\u0645"},"uk":{"language":"uk","value":"\u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u041b\u043b\u043e\u0439\u0434\u0430"},"zh-hant":{"language":"zh-hant","value":"Lloyd\u6f14\u7b97\u6cd5"},"zh-cn":{"language":"zh-cn","value":"Lloyd\u7b97\u6cd5"},"he":{"language":"he","value":"\u05d0\u05dc\u05d2\u05d5\u05e8\u05d9\u05ea\u05dd \u05dc\u05d5\u05d9\u05d3-\u05de\u05e7\u05e1"},"hu":{"language":"hu","value":"Lloyd-algoritmus"},"ko":{"language":"ko","value":"\ub85c\uc774\ub4dc\uc758 \uc54c\uace0\ub9ac\uc998"},"et":{"language":"et","value":"Lloydi algoritm"},"zh-hans":{"language":"zh-hans","value":"Lloyd\u7b97\u6cd5"},"eo":{"language":"eo","value":"algoritmo de Lloyd"},"zh":{"language":"zh","value":"Lloyd\u7b97\u6cd5"},"fi":{"language":"fi","value":"Lloydin algoritmi"},"it":{"language":"it","value":"algoritmo di Lloyd"}},"descriptions":{"en":{"language":"en","value":"method for creating geometric centroidal tessellations from points"},"it":{"language":"it","value":"algoritmo di clustering"}},"aliases":{"fr":[{"language":"fr","value":"Algorithme de lloyd-max"},{"language":"fr","value":"Algorithme De Lloyd-Max"}],"ur":[{"language":"ur","value":"Lloyd's algorithm"}],"zh-hans":[{"language":"zh-hans","value":"\u52de\u57c3\u5fb7\u7b97\u6cd5"}],"zh-hant":[{"language":"zh-hant","value":"\u52de\u57c3\u5fb7\u6f14\u7b97\u6cd5"}],"zh":[{"language":"zh","value":"\u52de\u57c3\u5fb7\u7b97\u6cd5"}],"en":[{"language":"en","value":"Voronoi iteration"}]},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"b5f5ce0c51fcd2a30f891b0b76482ab8252ed329","datavalue":{"value":{"entity-type":"item","numeric-id":8366,"id":"Q8366"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2835805$E093A8F9-CC77-4158-BF06-AF0DEB8BEC09","rank":"normal"}],"P3417":[{"mainsnak":{"snaktype":"value","property":"P3417","hash":"f4ba038fdc6bd067ff30f3b64bd18c5e5b01cebf","datavalue":{"value":"Lloyds-Algorithm","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2835805$789A67F7-F6E8-4B3D-996A-C86D6113F4C6","rank":"normal","references":[{"hash":"3b0a5bb3c1f955edce73740124f7d935698092ad","snaks":{"P248":[{"snaktype":"value","property":"P248","hash":"3ac9682e789a3a3791d4fd088b265ea03abef101","datavalue":{"value":{"entity-type":"item","numeric-id":51711,"id":"Q51711"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"snaks-order":["P248"]}]}],"P6366":[{"mainsnak":{"snaktype":"value","property":"P6366","hash":"c4547c5f7ebd218d1cb3c0de002e2a38dd53b536","datavalue":{"value":"37324513","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2835805$49342D4A-A9B3-42E6-AAD8-C6056A16BE0A","rank":"normal"}],"P646":[{"mainsnak":{"snaktype":"value","property":"P646","hash":"369a5c6142be397560bcd575c602ce16310562d6","datavalue":{"value":"/m/07rd1w","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2835805$45598D50-4A15-4730-A87A-658A9A32E2C2","rank":"normal"}],"P373":[{"mainsnak":{"snaktype":"value","property":"P373","hash":"fa40d0cb896cbc98e00f0ca8eb8dc3b64ed2c227","datavalue":{"value":"Lloyd's algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2835805$42f79010-a86a-44ad-a21a-1c46c815b552","rank":"normal"}],"P10376":[{"mainsnak":{"snaktype":"value","property":"P10376","hash":"b27e27a23a436520eb4016b964f1e0fd56966db9","datavalue":{"value":"computer-science/lloyd-algorithm","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2835805$20d19702-4b42-6987-7cb9-5976133b8489","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P10376","hash":"13a41c2ca08abfa28a9136ecabcc9a3d6931ffbe","datavalue":{"value":"engineering/lloyd-algorithm","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2835805$75277bdf-4265-4fc9-4597-5d73dfde1d4b","rank":"normal"}]},"sitelinks":{"commonswiki":{"site":"commonswiki","title":"Category:Lloyd's algorithm","badges":[],"url":"https://commons.wikimedia.org/wiki/Category:Lloyd%27s\_algorithm"},"enwiki":{"site":"enwiki","title":"Lloyd's algorithm","badges":[],"url":"https://en.wikipedia.org/wiki/Lloyd%27s\_algorithm"},"etwiki":{"site":"etwiki","title":"Lloydi algoritm","badges":[],"url":"https://et.wikipedia.org/wiki/Lloydi\_algoritm"},"frwiki":{"site":"frwiki","title":"Algorithme de Lloyd-Max","badges":[],"url":"https://fr.wikipedia.org/wiki/Algorithme\_de\_Lloyd-Max"},"hewiki":{"site":"hewiki","title":"\\u05d0\\u05dc\\u05d2\\u05d5\\u05e8\\u05d9\\u05ea\\u05dd \u05dc\u05d5\u05d9\u05d3-\u05de\u05e7\u05e1","badges":[],"url":"https://he.wikipedia.org/wiki/%D7%90%D7%9C%D7%92%D7%95%D7%A8%D7%99%D7%AA%D7%9D\_%D7%9C%D7%95%D7%99%D7%93-%D7%9E%D7%A7%D7%A1"},"itwiki":{"site":"itwiki","title":"Algoritmo di Lloyd","badges":[],"url":"https://it.wikipedia.org/wiki/Algoritmo\_di\_Lloyd"},"ukwiki":{"site":"ukwiki","title":"\\u0410\\u043b\\u0433\\u043e\\u0440\\u0438\\u0442\\u043c \u041b\u043b\u043e\u0439\u0434\u0430","badges":[],"url":"https://uk.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC\_%D0%9B%D0%BB%D0%BE%D0%B9%D0%B4%D0%B0"},"urwiki":{"site":"urwiki","title":"\\u0644\\u0627\\u0626\\u06cc\\u0688 \u0627\u0644\u062e\u0648\u0627\u0631\u0632\u0645","badges":[],"url":"https://ur.wikipedia.org/wiki/%D9%84%D8%A7%D8%A6%DB%8C%DA%88\_%D8%A7%D9%84%D8%AE%D9%88%D8%A7%D8%B1%D8%B2%D9%85"}}}}}