3 papers
cs.CG2026
Realizing Planar Linkages in Polygonal Domains
Thomas Depian, Carolina Haase, Martin Nöllenburg +1
A linkage consists of a graph and an edge-length function . Deciding whether can be realized as a planar straight-line embedding in $\ma…
cs.CG2026
On Layered Area-Proportional Rectangle Contact Representations
Carolina Haase, Philipp Kindermann
Semantic word clouds visualize the semantic relatedness between the words of a text by placing pairs of related words close to each other. Formally, the problem of drawing semantic…
cs.CG2025
Geometric realizations of dichotomous ordinal graphs
Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5
A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph in a…