Zobrazeno 1 - 10
of 214
pro vyhledávání: '"Durocher, Stephane"'
We consider the problem of finding a geodesic disc of smallest radius containing at least $k$ points from a set of $n$ points in a simple polygon that has $m$ vertices, $r$ of which are reflex vertices. We refer to such a disc as a SKEG disc. We pres
Externí odkaz:
http://arxiv.org/abs/2402.00336
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 trajectories, we introduce {\em curve stabbing depth} to quantify how deeply a g
Externí odkaz:
http://arxiv.org/abs/2311.07907
Autor:
Durocher, Stephane, Kamali, Shahin, Kryven, Myroslav, Liu, Fengyi, Mashghdoust, Amirhossein, Miller, Avery, Nezhad, Pouria Zamani, Costa, Ikaro Penha, Zapp, Timothy
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and robber move along edges of G. The cop number of G is the minimum number of cops that is sufficient to catch the robber
Externí odkaz:
http://arxiv.org/abs/2309.01001
Publikováno v:
J Comb Optim vol 44, issue 4, pg 2893-2918 (2022); Computing and Combinatorics. COCOON 2020. vol 12273, pg 448-459
Given a set $P$ of $n$ points in $\mathbb{R}^2$ and an input line $\gamma$ in $\mathbb{R}^2$, we present an algorithm that runs in optimal $\Theta(n\log n)$ time and $\Theta(n)$ space to solve a restricted version of the $1$-Steiner tree problem. Our
Externí odkaz:
http://arxiv.org/abs/2306.08504
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 the number of squares that share a common intersection, called the mini
Externí odkaz:
http://arxiv.org/abs/2208.06122
Publikováno v:
In Theoretical Computer Science 12 January 2025 1024
Chv\'{a}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. This paper examines a generalization of the problem, the Bottlene
Externí odkaz:
http://arxiv.org/abs/2108.12464
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 several data-driven skeletal animation models exist proposing motion
Externí odkaz:
http://arxiv.org/abs/2106.04387
A strict orthogonal drawing of a graph $G=(V, E)$ in $\mathbb{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 or vertical line segment. A graph $G$ is $HV$-restricted if each of it
Externí odkaz:
http://arxiv.org/abs/1904.06760
Autor:
Bahoo, Yeganeh, Durocher, Stephane, Keil, J. Mark, Mondal, Debajyoti, Mehrabi, Saeed, Mehrpour, Sahar
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 component $R$ of $P$ is a subset of a distinct connected component $R'$ of $P
Externí odkaz:
http://arxiv.org/abs/1812.05656