{"entities":{"Q1433539":{"pageid":1444279,"ns":120,"title":"Item:Q1433539","lastrevid":70393104,"modified":"2026-04-13T14:28:30Z","type":"item","id":"Q1433539","labels":{"en":{"language":"en","value":"Shortest path on a non-convex polyhedron"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2076124"}},"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":"Q1433539$3B2A833B-8935-4816-9F4F-3F86B510D023","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c8ea7d0bfed605635385f3bf4bc31ef8deb5e185","datavalue":{"value":{"text":"Shortest path on a non-convex polyhedron","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1433539$1B40F0F9-D966-4AD0-A040-7D407EFE44DE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9cb67bb1c33f3fb3cb9b688f94bd672092d1c61d","datavalue":{"value":"1055.68123","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1433539$34A18E18-3FA5-4265-93FC-33CBAA2BE4EA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cc854c7d3729575162ec18a1f06cdc4605d69319","datavalue":{"value":{"entity-type":"item","numeric-id":246651,"id":"Q246651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1433539$2BAE7EBF-0631-4626-9FE4-69FBED10290E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5c1e446d95480f437be9c7dc7e9441d788492d13","datavalue":{"value":{"time":"+2004-06-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1433539$72F451AE-A38C-4862-A58E-05573C5A9CC7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"112014e165e754b9d2db20cfde1297843d30399f","datavalue":{"value":"The authors present an algorithm to solve the shortest-path problem between two points \\(A\\) and \\(B\\) on a non-convex polyhedron in the 3-dimensional space. The algorithm constructs first all possible edge-sequences and optimizes their order. Then the points on each of the obtained edge-sequences are computed which determine the path between \\(A\\) and \\(B\\) using this edge-sequence. No detailed complexity analysis is provided.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1433539$DB90AC46-A122-4BC4-9534-B4142B9A4C9F","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"e2c96c31c505bb36052d6d9a1e06ebdcc9d76af6","datavalue":{"value":{"entity-type":"item","numeric-id":166236,"id":"Q166236"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1433539$7606951D-93AC-40D0-BCD4-AC84C216264D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"159426a5937e62cfbbcc198dd4848ab52d6e715e","datavalue":{"value":"68U05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1433539$971664B9-AEEC-4BEC-A07B-6BD8CF95B783","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2ce72165d993b0b8ed97728d731d2db2473b9554","datavalue":{"value":"65D18","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1433539$4C7FA4F8-0893-40D6-A300-4B02DFAD424B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2762df744fec88c5da60f696833f02907bd4417a","datavalue":{"value":"52B55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1433539$2917EDE8-DD84-4B2C-8350-2A4D3D7C4B66","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3070f6d9b88223958f31a78ffe878bfba8ebb9e2","datavalue":{"value":"2076124","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1433539$4FB04DBC-3A79-42C7-A03E-BEE47CAC8160","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q1433539$96E6723C-5492-49EE-9045-23A0FBA6388D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1320e5e310179a223ae25d8bba9361a471fe577f","datavalue":{"value":"nonconvex polyhedron","type":"string"},"datatype":"string"},"type":"statement","id":"Q1433539$9442FD8F-53F8-4FE9-86DE-9BE9ACC1FF58","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8fb051dbca1731816c197972310c32376f5b8322","datavalue":{"value":{"entity-type":"item","numeric-id":799689,"id":"Q799689"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1433539$4B544A0E-907A-4F4D-860E-243D704C5AD2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1983b97192dda4bb10d0f6e15dc2bb99f417ca9b","datavalue":{"value":{"entity-type":"item","numeric-id":1639348,"id":"Q1639348"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1433539$1E7FBF0C-CBF4-4702-BDD1-51290AFFE214","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":"Q1433539$D8FF3E8D-C60D-4B6B-B690-3DBA5E8988C1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"658ecea8ea10413df4b799531342ddb5049d83d3","datavalue":{"value":{"entity-type":"item","numeric-id":4219245,"id":"Q4219245"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bc128c064aee9e83bfe55c8fb5dcbd187dcbe01e","datavalue":{"value":{"amount":"+0.8061302304267883","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1433539$E6A13857-7B29-4C9D-839E-CBDE66D8FEA4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"41f0ec01378659fb3e9816ab1ffe664ed11742cc","datavalue":{"value":{"entity-type":"item","numeric-id":3685218,"id":"Q3685218"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fa232bff519b27021fa3af879554819b65aa6f39","datavalue":{"value":{"amount":"+0.7768467664718628","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1433539$965D432F-4057-406F-93DF-19C54C1CBFEC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dc7adffb7fbde3448fe2de8e2251f197c4a2aeb8","datavalue":{"value":{"entity-type":"item","numeric-id":2706111,"id":"Q2706111"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1cf93083b9ed728e7d9a15a8f5bcafbf85512399","datavalue":{"value":{"amount":"+0.7767730355262756","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1433539$11D0E33E-388B-4418-8E4C-4F6C8EC1FEC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"573644f95ead9ae15118cd33a4500f05b83186e1","datavalue":{"value":{"entity-type":"item","numeric-id":2850299,"id":"Q2850299"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"16f19a65d314367d5950e22f9524b4b1e571651c","datavalue":{"value":{"amount":"+0.7697911858558655","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1433539$1F692BEA-4DBA-4DE6-BD3D-D7A4E9D13DE5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"978d500e8f0a9b92fb1ecd99267ad5cd2ba0fea7","datavalue":{"value":{"entity-type":"item","numeric-id":4889502,"id":"Q4889502"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d48dd9032327a897c7e55076f48e2d44fafd2d8c","datavalue":{"value":{"amount":"+0.7573739886283875","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1433539$00B12368-53B9-4FE3-936A-5ACC130C229A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Shortest path on a non-convex polyhedron","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Shortest_path_on_a_non-convex_polyhedron"}}}}}