{"entities":{"Q6065225":{"pageid":13199487,"ns":120,"title":"Item:Q6065225","lastrevid":102305972,"modified":"2026-06-06T04:08:39Z","type":"item","id":"Q6065225","labels":{"en":{"language":"en","value":"A new algorithm for Euclidean shortest paths in the plane"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7765225"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065225$864AC6E5-93E3-4F4B-9B10-A6A7246C3D50","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8e0ed63cb7068c2c055fd8d0111bbb6e24e4cc83","datavalue":{"value":{"text":"A new algorithm for Euclidean shortest paths in the plane","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6065225$8942F306-E36A-4F12-86F4-47F69FB88F8D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e0eb6d2d886d4c7a521f2235ab55313f5725c418","datavalue":{"value":"10.1145/3406325.3451037","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065225$C55AA56F-DA96-4A9C-9603-FF9C9CE2FB0A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e1daac321441bd98d8a8a605c8e52de8430f356b","datavalue":{"value":{"entity-type":"item","numeric-id":6065162,"id":"Q6065162"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065225$7EAF5A3B-C767-4721-AAB7-6AF0A5335771","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a57f772c7334dce3f7920e528999b803f662d580","datavalue":{"value":{"time":"+2023-11-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6065225$AE111324-89AE-4C5A-9FAD-970B31FB09E9","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"026ee287b045ca4916a9e664fdb730ad24aca270","datavalue":{"value":"https://arxiv.org/abs/2102.12589","type":"string"},"datatype":"url"},"type":"statement","id":"Q6065225$C03A3BB7-442B-4253-9EE7-2F37F7263DB7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065225$84CEFD44-E352-4888-8D6E-4D27E2001C39","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"59bf5d64bffcc2943497b6473a4058795e728f42","datavalue":{"value":"7765225","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065225$27486B2B-3A4E-4ED9-AE62-21C1C3829524","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d9127f5896104a114682d7836229c81d41f1e9fa","datavalue":{"value":"Euclidean distance","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$F77DEA69-451F-4114-B44F-58EAE2A2D6DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9e1b98c64c0dfc3bec7cff093f965649ff45b97d","datavalue":{"value":"obstacle avoidance","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$4D18C6B5-7C89-4502-AC10-E3CBF8FDA6F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e4294b29473d50b572233d4cdc3339d3770d262","datavalue":{"value":"polygonal domain","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$A687D89F-5EBB-4681-A738-52685DECC42E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$B0652C48-A483-43C1-BADB-BCC3A91A8720","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b46c37aab4d57e91de25608b21c01e5fc2581a4","datavalue":{"value":"shortest path map","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$1B23D3DB-C441-4B36-9104-FC91737A1517","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"36a51744b74cc671801acb5ba4bcdd21474af9d6","datavalue":{"value":"shortest path query","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065225$24A75A83-DE2C-4F56-910C-3A5A94B7FEC7","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065225$9D76E3D8-716D-484F-8269-5EE89D7DAF6A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2dc9f7ddd781547977e8beaf201fba35fcf9decf","datavalue":{"value":"W3166750876","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065225$0CFDA014-762E-42AB-A726-45CB92429F70","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A new algorithm for Euclidean shortest paths in the plane (scientific article; zbMATH DE number 7765225)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_new_algorithm_for_Euclidean_shortest_paths_in_the_plane_(scientific_article;_zbMATH_DE_number_7765225)"}}}}}