Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Parada, Irene"'
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this paper, we sh
Externí odkaz:
http://arxiv.org/abs/2402.14552
Imagine you are a dog behind a fence $Q$ and a hiker is passing by at constant speed along the hiking path $P$. In order to fulfil your duties as a watchdog, you desire to bark as long as possible at the human. However, your barks can only be heard i
Externí odkaz:
http://arxiv.org/abs/2402.13159
A geometric $t$-spanner $\mathcal{G}$ on a set $S$ of $n$ point sites in a metric space $P$ is a subgraph of the complete graph on $S$ such that for every pair of sites $p,q$ the distance in $\mathcal{G}$ is a most $t$ times the distance $d(p,q)$ in
Externí odkaz:
http://arxiv.org/abs/2402.12110
Autor:
Kostitsyna, Irina, Ophelders, Tim, Parada, Irene, Peters, Tom, Sonke, Willem, Speckmann, Bettina
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration problem, by
Externí odkaz:
http://arxiv.org/abs/2312.15096
Autor:
Förster, Henry, Kindermann, Philipp, Miltzow, Tillmann, Parada, Irene, Terziadis, Soeren, Vogtenhuber, Birgit
We say that a (multi)graph $G = (V,E)$ has geometric thickness $t$ if there exists a straight-line drawing $\varphi : V \rightarrow \mathbb{R}^2$ and a $t$-coloring of its edges where no two edges sharing a point in their relative interior have the s
Externí odkaz:
http://arxiv.org/abs/2312.05010
Autor:
Aichholzer, Oswin, Hackl, Thomas, Löffler, Maarten, Pilz, Alexander, Parada, Irene, Scheucher, Manfred, Vogtenhuber, Birgit
Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P\cup Q$. Aichholzer et al. (2013) showed that any set $P$ of $n$ points in general posit
Externí odkaz:
http://arxiv.org/abs/2210.12015
A directed graph $G$ is upward planar if it admits a planar embedding such that each edge is $y$-monotone. Unlike planarity testing, upward planarity testing is NP-hard except in restricted cases, such as when the graph has the single-source property
Externí odkaz:
http://arxiv.org/abs/2209.14094
Autor:
Aichholzer, Oswin, García, Alfredo, Parada, Irene, Vogtenhuber, Birgit, Weinberger, Alexandra
Simple drawings are drawings of graphs in which two edges have at most one common point (either a common endpoint, or a proper crossing). It has been an open question whether every simple drawing of a complete bipartite graph $K_{m,n}$ contains a pla
Externí odkaz:
http://arxiv.org/abs/2209.01190
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge crossings. The qu
Externí odkaz:
http://arxiv.org/abs/2105.12452
Autor:
Akitaya, Hugo A., Demaine, Erik D., Korman, Matias, Kostitsyna, Irina, Parada, Irene, Sonke, Willem, Speckmann, Bettina, Uehara, Ryuhei, Wulms, Jules
A well-established theoretical model for modular robots in two dimensions are edge-connected configurations of square modules, which can reconfigure through so-called sliding moves. Dumitrescu and Pach [Graphs and Combinatorics, 2006] proved that it
Externí odkaz:
http://arxiv.org/abs/2105.07997