Stephane Durocher

activity

20112023

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

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

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2023★ 5 cited

On the Restricted $k$ -Steiner Tree Problem

Prosenjit Bose, Anthony D'Angelo, Stephane Durocher

Given a set $P$ of $n$ points in $R^{2}$ and an input line $γ$ in $R^{2}$ , we present an algorithm that runs in optimal $Θ (n lo g n)$ time and $Θ (n)$ space to solve a…

cs.CG2021

Bottleneck Convex Subsets: Finding $k$ Large Convex Sets in a Point Set

Stephane Durocher, J. Mark Keil, Saeed Mehrabi +1

Chvátal and Klincsek (1980) gave an $O (n^{3})$ -time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane.…

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…

On the Restricted k-Steiner Tree Problem

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Drawing HV-Restricted Planar Graphs

Polygon Simplification by Minimizing Convex Corners

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras

On the Restricted $k$ -Steiner Tree Problem

Bottleneck Convex Subsets: Finding $k$ Large Convex Sets in a Point Set