3 citations · 10 across the 24 of their papers we have counts for
6 papers · 1 filter
Polygon Simplification by Minimizing Convex Corners
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil +3
Let be a polygon with reflex vertices and possibly with holes and islands. A subsuming polygon of is a polygon such that , each connected compone…
Recognition and Drawing of Stick Graphs
Felice De Luca, Md Iqbal Hossain, Stephen Kobourov +2
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments l…
Minimum Shared-Power Edge Cut
Sergio Cabello, Kshitij Jain, Anna Lubiw +1
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the…
Boundary Labeling for Rectangular Diagrams
Prosenjit Bose, Paz Carmi, J. Mark Keil +2
Given a set of points (sites) inside a rectangle and points (label locations or ports) on its boundary, a boundary labeling problem seeks ways of connecting every site…
The Complexity of Drawing a Graph in a Polygonal Region
Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal
We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to po…
Angle-Monotone Graphs: Construction and Local Routing
Anna Lubiw, Debajyoti Mondal
A geometric graph in the plane is angle-monotone of width if every pair of vertices is connected by an angle-monotone path of width , a path such that the angles of any two…