37 citations · 186 across the 48 of their papers we have counts for
4 papers · 1 filter
Dihedral angles and orthogonal polyhedra
Therese Biedl, Martin Derka, Stephen Kiazyk +2
Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel…
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov +7
We study a geometric representation problem, where we are given a set of axis-aligned rectangles with fixed dimensions and a graph with vertex set . The task is to…
Flipping Edge-Labelled Triangulations
Prosenjit Bose, Anna Lubiw, Vinayak Pathak +1
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been…
Self-Approaching Graphs
Soroush Alamdari, Timothy M. Chan, Elyot Grant +2
In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there i…