{"entities":{"Q1123027":{"pageid":1133776,"ns":120,"title":"Item:Q1123027","lastrevid":66816549,"modified":"2026-04-12T13:03:14Z","type":"item","id":"Q1123027","labels":{"en":{"language":"en","value":"A linear time algorithm for finding all farthest neighbors in a convex polygon"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4108215"}},"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":"Q1123027$36F4006A-2B9F-44D7-9180-164AA9CD27CF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"68b048200cb7aa08669e65c11c7b5edfa3540989","datavalue":{"value":{"text":"A linear time algorithm for finding all farthest neighbors in a convex polygon","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1123027$CBB270C8-7BDD-434E-B810-CE619D2ECDB6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"61965246ebfcd2c421105039348a8db6611af463","datavalue":{"value":"0676.68080","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$E791EFA8-A68A-4DBA-99BB-4AF49F12074D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"936ca2ad37eef68eb1b0df5904405e913f303cb4","datavalue":{"value":"10.1016/0020-0190(89)90103-8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$54C07305-1393-474C-A854-34BFCF3CE89D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"56db57e5ef36be4ae181cf20227e714c608f98af","datavalue":{"value":{"entity-type":"item","numeric-id":676591,"id":"Q676591"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$E269C19E-30DF-4744-8557-7174598079A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"64a5e02458a327e7b854a0a51ea17759c9e5c450","datavalue":{"value":{"entity-type":"item","numeric-id":834913,"id":"Q834913"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$CD147298-3AED-4B4A-B101-4AE0869B9A66","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$CD112C67-D963-42CE-B101-9CACF086DCF6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7211ad5ca16eb0d22cd0051fff3d0f3af254ceb6","datavalue":{"value":{"time":"+1989-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1123027$8949F925-ECDB-4551-BDB8-7939EAB1F6EB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5ce1f950b433e4b9a28484aaa593ce323f153282","datavalue":{"value":"A linear-time algorithm is given to compute all most distant vertices for every vertex of a convex polygon. It is an extension of an algorithm from \\textit{A. Aggarwal}, \\textit{M. M. Klawe}, \\textit{S. Moran}, \\textit{P. Shor}, \\textit{R. Wilber} [Algorithmica 2, 195-208 (1987; Zbl 0642.68078)] computing only one farthest neighbor per vertex. As a by-product a linear-time algorithm for all symmetric farthest neighbor pairs for a simple polygon is obtained (``symmetric'' means that the two vertices are farthest neighbors of each other).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123027$FB9E7372-4E73-4C52-A0D0-B5D571048A31","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"257d0165052e5019ac8fd49a93c7aebbdcc243c0","datavalue":{"value":{"entity-type":"item","numeric-id":751866,"id":"Q751866"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$01851E45-8F4B-4E46-8F41-0D3F6CCB8F3B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"61f5e4db0e91212ef2106e3db512d71730a68751","datavalue":{"value":"68U99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$5AC62249-40F6-4D75-A849-3D093F50D5A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$FC7FCE67-3EE1-4A5D-BCBB-618E1885C2C4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"63429e81a404e072feff750e2b2775248d320bc0","datavalue":{"value":"4108215","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$7CF1D725-3B81-408E-98AF-027CCA038CFC","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"551d108313cfab3a77b395a647aede7021169ebd","datavalue":{"value":"computational geometry","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123027$46B5B0EF-18AD-41C9-90D5-1D5A385D26F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5cb0b3b421242a1c5db3ab2655df9258dc862c5e","datavalue":{"value":"matrix searching","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123027$26597081-D342-4E8F-8BBE-DED6B3DE58BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5a7e92eb2fc12d46be917040ab2e4f7ddc2d57ed","datavalue":{"value":"farthest neighbors","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123027$5023EB7C-EA12-411C-BF19-D3D0572A4F18","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7638652825683bfe9fbdcacf89d6fa0bde32cc7a","datavalue":{"value":"convex polygon","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123027$1374E2EC-C61F-416F-BC5A-68754BE4DEE3","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":"Q1123027$E31902E5-8423-448C-BB1B-222ACE831FDA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c4e8b228a447053df784036ebf33d56e6d96079d","datavalue":{"value":"https://doi.org/10.1016/0020-0190(89)90103-8","type":"string"},"datatype":"url"},"type":"statement","id":"Q1123027$8F0DA2E9-51FF-45A8-941C-56CB6228F7CE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"e7fc5e00e64d986db6fcedb145459abfc0df88f8","datavalue":{"value":"W2083706317","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123027$40CF074A-A0F4-4878-8E88-BA6F324D4EB5","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"add3ba7c961dbac8a0bad942908ab7ee33c9a780","datavalue":{"value":{"entity-type":"item","numeric-id":5896232,"id":"Q5896232"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$4CB81F19-AED5-424D-A903-501B9EA1FF82","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ce706b521feced086e90e6ea5ea7217845a71ed7","datavalue":{"value":{"entity-type":"item","numeric-id":789727,"id":"Q789727"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123027$47DA1D5A-9228-419B-82FA-AAD59C28EDDE","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1531099b9dfd50a4d566e2983ee2c9f4c1b63b70","datavalue":{"value":{"entity-type":"item","numeric-id":1822979,"id":"Q1822979"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8605731e23f575d207d63a3039c00ff68809d819","datavalue":{"value":{"amount":"+0.8406882882118225","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":"Q1123027$6E2518E4-40BD-408A-B340-05D57E245A99","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"28f23a006d00ca4d40b2802c3978363aecdf663c","datavalue":{"value":{"entity-type":"item","numeric-id":1175781,"id":"Q1175781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4166f816117f04bb7ceecf98499a1434a1716d3f","datavalue":{"value":{"amount":"+0.8400022387504578","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":"Q1123027$B8226236-0005-4BB3-A058-617E5EAB7616","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fcc5e7303fe25f45c6a1ec815531d0ba9bfcd416","datavalue":{"value":{"entity-type":"item","numeric-id":2380039,"id":"Q2380039"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4166f816117f04bb7ceecf98499a1434a1716d3f","datavalue":{"value":{"amount":"+0.8400022387504578","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":"Q1123027$90C6EB37-771B-4181-A5B6-DAB301D6155F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"772ee3dbd4d32c7a340576e4e3d2fd6666f87edf","datavalue":{"value":{"entity-type":"item","numeric-id":4551357,"id":"Q4551357"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7283cd8dcbfd137a3a75362622fa735460fdcac9","datavalue":{"value":{"amount":"+0.831196665763855","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":"Q1123027$08500E9E-945A-428F-8B9A-344DC81F6C9A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6ae0feecc9c4335cc4b60d32e2aa57bdfb8a7be8","datavalue":{"value":{"entity-type":"item","numeric-id":4017522,"id":"Q4017522"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1244d75fde0aacc300b833cabcb8aeb4196f04f0","datavalue":{"value":{"amount":"+0.8216843605041504","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":"Q1123027$F1B4164B-0AF5-4E2F-AAF8-14426600451F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A linear time algorithm for finding all farthest neighbors in a convex polygon","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_linear_time_algorithm_for_finding_all_farthest_neighbors_in_a_convex_polygon"}}}}}