{"entities":{"Q6946355":{"pageid":21181707,"ns":120,"title":"Item:Q6946355","lastrevid":75969141,"modified":"2026-04-22T08:42:08Z","type":"item","id":"Q6946355","labels":{"en":{"language":"en","value":"Removing depth-order cycles among triangles: an efficient algorithm generating triangular fragments"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8076660"}},"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":"Q6946355$24FC1050-FB56-46E9-91FE-A70BE4982209","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"14b03b87f7797de2ef59d0e9f5fa85323fd7a3ca","datavalue":{"value":{"text":"Removing depth-order cycles among triangles: an efficient algorithm generating triangular fragments","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6946355$679DAF7C-30E0-4EFA-A154-FC87D31C7C1B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fd57450d5db2af41e570b067403a6d567e739e25","datavalue":{"value":"10.1109/FOCS.2017.33","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946355$B9EE43FE-50D2-4A54-9A6D-FD272BC53ABF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f238d7848d0d2745ced3187f54790200083b50d3","datavalue":{"value":{"entity-type":"item","numeric-id":802872,"id":"Q802872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946355$1DB2842B-4ED8-46CC-8D39-ABD58CAF1221","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"92e52dd11d4a4a87e99ca1dd58ff5812f369c9fa","datavalue":{"value":{"time":"+2025-08-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6946355$4AFCE2CA-D426-4900-9152-7A7C9A3422A6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946355$019F88A7-F3B3-4738-97E7-601C95EE4C3A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946355$B646EE4B-A72B-4C24-AD5A-60E616595ED5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946355$71299971-BF2A-42C5-A7A3-F9B4A2C10052","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a57460445ef0ec4cee72eb82f8ff00f3e71a0de6","datavalue":{"value":"8076660","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946355$011C001D-BB15-4E8C-B473-2EE8D9797384","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":"Q6946355$8A269542-6B39-4F39-89A0-3EA1C8D9B7B9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Removing depth-order cycles among triangles: an efficient algorithm generating triangular fragments","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Removing_depth-order_cycles_among_triangles:_an_efficient_algorithm_generating_triangular_fragments"}}}}}