Stephane Durocher

activity

20002023

most citedToward the Rectilinear Crossing Number of

K_{n}

: New Drawings, Upper Bounds, and Asymptotics

26 citations · 69 across the 19 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.CG2016★ 11 cited

A Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose +2

Let $P$ be a simple polygon with $n$ vertices, and let $q \in P$ be a point in $P$ . Let $k \in {0, \dots, n - 1}$ . A point $p \in P$ is $k$ -visible from $q$ if and only if the li…

cs.CG2016

Relating Graph Thickness to Planar Layers and Bend Complexity

Stephane Durocher, Debajyoti Mondal

The thickness of a graph $G = (V, E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$ . A polyline drawing of $G$ in $R^{2}$ is a drawing $…