Zobrazeno 1 - 10
of 1 000
pro vyhledávání: '"Mitchell, A. A. B."'
Autor:
Chakraborty, Nilanjan, Kasthurirangan, Prahlad Narasimhan, Mitchell, Joseph S. B., Nguyen, Linh, Perk, Michael
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between locations and sea
Externí odkaz:
http://arxiv.org/abs/2410.06069
Autor:
Mitchell, Joseph S. B., Nguyen, Linh
We study some variants of the $k$-\textsc{Watchman Routes} problem, the cooperative version of the classic \textsc{Watchman Routes} problem in a simple polygon. The watchmen may be required to see the whole polygon, or some pre-determined quota of ar
Externí odkaz:
http://arxiv.org/abs/2408.17343
Autor:
Fekete, Sándor P., Mitchell, Joseph S. B., Rieck, Christian, Scheffer, Christian, Schmidt, Christiane
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon $\mathcal{P}$, with pairwise geodesic Euclidean vertex distance of at least $1$, and a rational number $\ell$; decide whether there is a set of vertex guards such that $\
Externí odkaz:
http://arxiv.org/abs/2406.05861
Autor:
Mitchell, Joseph S. B., Nguyen, Linh
Publikováno v:
36th Canadian Conference on Computational Geometry (CCCG 2024)
The well-known \textsc{Watchman Route} problem seeks a shortest route in a polygonal domain from which every point of the domain can be seen. In this paper, we study the cooperative variant of the problem, namely the \textsc{$k$-Watchmen Routes} prob
Externí odkaz:
http://arxiv.org/abs/2405.21034
We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of investigation, w
Externí odkaz:
http://arxiv.org/abs/2403.11861
Publikováno v:
19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the length(s) of the r
Externí odkaz:
http://arxiv.org/abs/2402.05420
The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule, is consid
Externí odkaz:
http://arxiv.org/abs/2303.01096
Let $E=\{e_1,\ldots,e_n\}$ be a set of $C$-oriented disjoint segments in the plane, where $C$ is a given finite set of orientations that spans the plane, and let $s$ and $t$ be two points. %(We also require that for each orientation in $C$, its oppos
Externí odkaz:
http://arxiv.org/abs/2302.06776
The classical and extensively-studied Fr\'echet distance between two curves is defined as an inf max, where the infimum is over all traversals of the curves, and the maximum is over all concurrent positions of the two agents. In this article we inves
Externí odkaz:
http://arxiv.org/abs/2203.04548
Autor:
Demaine, Erik D., Fekete, Sándor P., Keldenich, Phillip, Krupke, Dominik, Mitchell, Joseph S. B.
We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the subject of the
Externí odkaz:
http://arxiv.org/abs/2111.07304