Bekos, M.A.Dekker, D.J.C.Frank, F.Meulemans, W.Rodgers, P.Schulz, A.Wessel, S.Hauser, Helwig and Alliez, Pierre2022-10-112022-10-1120221467-8659https://doi.org/10.1111/cgf.14497https://diglib.eg.org:443/handle/10.1111/cgf14497Set systems can be visualized in various ways. An important distinction between techniques is whether the elements have a spatial location that is to be used for the visualization; for example, the elements are cities on a map. Strictly adhering to such location may severely limit the visualization and force overlay, intersections and other forms of clutter. On the other hand, completely ignoring the spatial dimension omits information and may hide spatial patterns in the data. We study layouts for set systems (or hypergraphs) in which spatial locations are displaced onto concentric circles or a grid, to obtain schematic set visualizations. We investigate the tractability of the underlying algorithmic problems adopting different optimization criteria (e.g. crossings or bends) for the layout structure, also known as the support of the hypergraph. Furthermore, we describe a simulated‐annealing approach to heuristically optimize a combination of such criteria. Using this method in computational experiments, we explore the trade‐offs and dependencies between criteria for computing high‐quality schematic set visualizations.information visualizationhypergraph drawingvisualizationcomputational geometrymodelling10.1111/cgf.14497316-335