Doubly-additive line diagrams define a concept’s position as the sum of vectors from its extent and complement intent, which naturally produces parallelograms, making the lattice easier to read and enabling interactive features such as drag-and-drop editing. However, the core challenge lies in finding a vector assignment that yields a readable drawing rather than a cluttered one. Therefore, this project aims to extend the force-directed approach of Ralph Freese’s lattice drawing algorithm by optimizing base vectors, rather than refining node positions directly.<\/p>\n\n\n\n
Inquiries: Marcel N\u00f6hre<\/a><\/p>\n\n\n\n <\/p>\n","protected":false},"excerpt":{"rendered":" A Doubly-Additive Extension of Freese’s Algorithm Doubly-additive line diagrams define a concept’s position as the sum of vectors from its extent and complement intent, which naturally produces parallelograms, making the lattice easier to read and Read more…<\/a><\/p>\n","protected":false},"author":22,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,36,37,34],"tags":[66],"class_list":["post-10517","post","type-post","status-publish","format-standard","hentry","category-allgemein","category-bachelor","category-master","category-methodischer-schwerpunkt","tag-ss2026"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/10517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/22"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=10517"}],"version-history":[{"count":4,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/10517\/revisions"}],"predecessor-version":[{"id":10527,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/10517\/revisions\/10527"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=10517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/categories?post=10517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/tags?post=10517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}