Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Krupke, Dominik"'
Autor:
Becker, Aaron T., Fekete, Sándor P., Huang, Li, Keldenich, Phillip, Kleist, Linda, Krupke, Dominik, Rieck, Christian, Schmidt, Arne
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of micro-scale particles (''agents'') and a particular target region (''tumo
Externí odkaz:
http://arxiv.org/abs/2408.09729
We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a respective valu
Externí odkaz:
http://arxiv.org/abs/2403.16203
Autor:
Krupke, Dominik Michael
Coverage path planning is a fundamental challenge in robotics, with diverse applications in aerial surveillance, manufacturing, cleaning, inspection, agriculture, and more. The main objective is to devise a trajectory for an agent that efficiently co
Externí odkaz:
http://arxiv.org/abs/2310.20340
For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1/2 of every point in $P$; this is equivalent to computing a shortest tour for a unit-diameter cutter $C$ that covers all
Externí odkaz:
http://arxiv.org/abs/2307.01092
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem wit
Externí odkaz:
http://arxiv.org/abs/2303.07007
For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1 of every point in $P$; this is equivalent to computing a shortest tour for a unit-disk cutter $C$ that covers all of $P
Externí odkaz:
http://arxiv.org/abs/2211.05891
We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segments into a minimum number of non-crossing subsets.
Comment: 13 p
Comment: 13 p
Externí odkaz:
http://arxiv.org/abs/2203.07444
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
We give an overview of the 2021 Computational Geometry Challenge, which targeted the problem of optimally coordinating a set of robots by computing a family of collision-free trajectories for a set set S of n pixel-shaped objects from a given start c
Externí odkaz:
http://arxiv.org/abs/2103.15381
Autor:
Buchin, Kevin, Fekete, Sándor P., Hill, Alexander, Kleist, Linda, Kostitsyna, Irina, Krupke, Dominik, Lambers, Roel, Struijs, Martijn
We consider a spectrum of geometric optimization problems motivated by contexts such as satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Costs, we are given a graph $G$ that is embedded in Euclidean space. The
Externí odkaz:
http://arxiv.org/abs/2103.14599