13 citations · 21 across the 8 of their papers we have counts for
Showing 2016 · cs.CGShow all
3 papers · 2 filters
cs.CG2016
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols +3
We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output…
cs.CG2016
On the -hardness of GRacSim Drawing and k-SEFE Problems
Luca Grilli
We study the complexity of two problems in simultaneous graph drawing. The first problem, GRacSim Drawing, asks for finding a simultaneous geometric embedding of two graphs such th…
cs.CG2016★ 3 cited
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…