1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2021★ 1 cited
Improved Spanning on Theta-5
Prosenjit Bose, Darryl Hill, Aurélien Ooms
We show an upper bound of on the spanning ratio of -graphs, imp…
cs.CG2018
Improved Bounds for Guarding Plane Graphs with Edges
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1
An "edge guard set" of a plane graph is a subset of edges of such that each face of is incident to an endpoint of an edge in . Such a set is said to guard . W…
cs.CG2018
Subquadratic Encodings for Point Configurations
Jean Cardinal, Timothy M. Chan, John Iacono +2
For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation o…