View profile for Jan-Henrik Haunert, graphic

Professor fรผr Geoinformation, Universitรคt Bonn

๐—š๐—ฒ๐—ป๐—ฒ๐—ฟ๐—ฎ๐˜๐—ถ๐—ป๐—ด ๐—˜๐˜‚๐—น๐—ฒ๐—ฟ ๐——๐—ถ๐—ฎ๐—ด๐—ฟ๐—ฎ๐—บ๐˜€ ๐—ง๐—ต๐—ฟ๐—ผ๐˜‚๐—ด๐—ต ๐—–๐—ผ๐—บ๐—ฏ๐—ถ๐—ป๐—ฎ๐˜๐—ผ๐—ฟ๐—ถ๐—ฎ๐—น ๐—ข๐—ฝ๐˜๐—ถ๐—บ๐—ถ๐˜‡๐—ฎ๐˜๐—ถ๐—ผ๐—ป Euler diagrams are frequently used to visualize set systems. They represent each set as a region in the plane that is bounded by a single closed curve. In our recent work, published in Computer Graphics Forum, we propose the first algorithm which decides whether an arbitrary set system can be drawn as such an Euler diagram. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Our experiments show that most real-world instances can be drawn without further simplification. https://lnkd.in/eW9atyrG #EulerDiagram #Algorithm #Optimization #ILP #Research

To view or add a comment, sign in