### Samenvatting

In many domains, the aggregation or classification of data elements leads to various intersecting sets. To allow for intuitive exploration and analysis of such data, set visualization aims to represent the elements and sets graphically. In more theoretical literature, such set systems are often referred to as hypergraphs. A support graph is a notion for drawing such a hypergraph, understood as a regular graph spanning the same vertices (elements), in which each hyperedge (set) induces a connected subgraph.

In this paper, we investigate finding a support graph of a hypergraph with fixed vertex locations under various constraints. We focus on enforcing planarity using a straight-line embedding, while minimizing the total length of the edges of the support graph, and consider the effect of the additional requirement that the support graph is acyclic.

In this paper, we investigate finding a support graph of a hypergraph with fixed vertex locations under various constraints. We focus on enforcing planarity using a straight-line embedding, while minimizing the total length of the edges of the support graph, and consider the effect of the additional requirement that the support graph is acyclic.

Originele taal-2 | Engels |
---|---|

Pagina's | 35:1-35:6 |

Aantal pagina's | 6 |

Status | Gepubliceerd - 21 mrt 2018 |

Evenement | 34th European Workshop on Computational Geometry (EuroCG2018) - Berlin, Duitsland Duur: 21 mrt 2018 → 23 mrt 2018 https://conference.imp.fu-berlin.de/eurocg18/home |

### Congres

Congres | 34th European Workshop on Computational Geometry (EuroCG2018) |
---|---|

Verkorte titel | EuroCG2018 |

Land | Duitsland |

Stad | Berlin |

Periode | 21/03/18 → 23/03/18 |

Internet adres |

### Vingerafdruk

### Citeer dit

Castermans, T., van Garderen, M., Meulemans, W., Nöllenburg, M., & Yuan, X. (2018).

*Short plane support trees for hypergraphs*. 35:1-35:6. Abstract van 34th European Workshop on Computational Geometry (EuroCG2018), Berlin, Duitsland.