4 papers · 1 filter
Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
Tesshu Hanaka, Nicolás Honorato-Droguett, Hirotaka Ono +2
In this paper, we study graph editing problems on geometric intersection graphs. For a tuple of geometric objects in some Euclidean space, let $G_\mat…
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka +2
Removing overlaps is a central task in domains such as scheduling, visibility, and map labelling. This can be modelled using graphs, where overlap removals correspond to enforcing…
Visualization of Event Graphs for Train Schedules
Johann Hartleb, Marie Schmidt, Samuel Wolf +1
Train timetables can be represented as event graphs, where correspond to a train passing through a location at a certain point in time. A visual representation of an event graph is…
Minimum Monotone Spanning Trees
Emilio Di Giacomo, Walter Didimo, Eleni Katsanou +3
Given a finite set of points in the plane and a finite set of directions, a geometric spanning tree~ of~ is -monotone if every path in is m…