1 citations · 1 across the 16 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
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…
cs.CG2025
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…