Stephane Durocher

activity

20112019

most citedLinear-Space Data Structures for Range Mode Query in Arrays

6 citations · 6 across the 4 of their papers we have counts for

collaborators

4 papers

cs.CG2019

Drawing HV-Restricted Planar Graphs

Stephane Durocher, Stefan Felsner, Saeed Mehrabi +1

A strict orthogonal drawing of a graph $G = (V, E)$ in $R^{2}$ is a drawing of $G$ such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal…

cs.CG2018

Polygon Simplification by Minimizing Convex Corners

Yeganeh Bahoo, Stephane Durocher, J. Mark Keil +3

Let $P$ be a polygon with $r > 0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P^{'}$ such that $P \subseteq P^{'}$ , each connected compone…

cs.CG2013

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras

Stephane Durocher, Saeed Mehrabi

Let $P$ be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment $s \in P$ as its \emph{trajectory}. The camera can see a poi…

cs.DS2011★ 6 cited

Linear-Space Data Structures for Range Mode Query in Arrays

Stephane Durocher, Jason Morrison

A mode of a multiset $S$ is an element $a \in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$ . Given a list $A [1 : n]$ of $n$ items…