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

21 papers

cs.CG2023

Curve Stabbing Depth: Data Depth for Plane Curves

Stephane Durocher, Alexandre Leblanc, Spencer Szabados

Measures of data depth have been studied extensively for point data. Motivated by recent work on analysis, clustering, and identifying representative elements in sets of trajectori…

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.CG2022

Minimum Ply Covering of Points with Unit Squares

Stephane Durocher, J. Mark Keil, Debajyoti Mondal

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes t…

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.CV2021

A structured latent space for human body motion generation

Mathieu Marsot, Stefanie Wuhrer, Jean-Sebastien Franco +1

We propose a framework to learn a structured latent space to represent 4D human body motion, where each latent vector encodes a full motion of the whole 3D human shape. On one hand…

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…