Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Penaloza, David P."'
Let $P$ be a $k$-colored set of $n$ points in the plane, $4 \leq k \leq n$. We study the problem of deciding if $P$ contains a subset of four points of different colors such that its Rectilinear Convex Hull has positive area. We provide an $O(n \log
Externí odkaz:
http://arxiv.org/abs/2404.06376
Autor:
Claverol, Mercè, Heras-Parrilla, Andrea de las, Flores-Peñaloza, David, Huemer, Clemens, Orden, David
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with coefficients the nu
Externí odkaz:
http://arxiv.org/abs/2304.12238
Autor:
Flores-Peñaloza, David, Kano, Mikio, Martínez-Sandoval, Leonardo, Orden, David, Tejel, Javier, Tóth, Csaba D., Urrutia, Jorge, Vogtenhuber, Birgit
Given a colored point set in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color, either in its interior or on its boundary. Let $\operatorname{rb-index}(S)$ denote the smallest size of a perfect rai
Externí odkaz:
http://arxiv.org/abs/2007.10139
Autor:
Bereg, Sergey, Chacón-Rivera, Oscar, Flores-Peñaloza, David, Huemer, Clemens, Pérez-Lantero, Pablo, Seara, Carlos
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the matched pai
Externí odkaz:
http://arxiv.org/abs/1911.10610
Autor:
Aichholzer, Oswin, Atienza, Nieves, Fabila-Monroy, Ruy, Perez-Lantero, Pablo, Dıaz-Báñez, Jose M., Flores-Peñaloza, David, Vogtenhuber, Birgit, Urrutia, Jorge
Let $S$ be a set of $n$ points in general position in the plane, $r$ of which are red and $b$ of which are blue. In this paper we prove that there exist: for every $\alpha \in \left [ 0,\frac{1}{2} \right ]$, a convex set containing exactly $\lceil \
Externí odkaz:
http://arxiv.org/abs/1510.01819
Autor:
Aichholzer, Oswin, Fabila-Monroy, Ruy, Flores-Peñaloza, David, Hackl, Thomas, Urrutia, Jorge, Vogtenhuber, Birgit
We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number $k$ of walls. We call these objects $k$-modems and study
Externí odkaz:
http://arxiv.org/abs/1503.05062
Autor:
Bereg, Sergey, Fabila-Monroy, Ruy, Flores-Peñaloza, David, Lopez, Mario, Pérez-Lantero, Pablo
In 1926, Jarn\'ik introduced the problem of drawing a convex $n$-gon with vertices having integer coordinates. He constructed such a drawing in the grid $[1,c\cdot n^{3/2}]^2$ for some constant $c>0$, and showed that this grid size is optimal up to a
Externí odkaz:
http://arxiv.org/abs/1305.6693
Autor:
Bautista-Santiago, Crevel, Cano, Javier, Fabila-Monroy, Ruy, Flores-Peñaloza, David, González-Aguilar, Hernán, Lara, Dolores, Sarmiento, Eliseo, Urrutia, Jorge
Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \emph{island} if there exists a convex set $C$ such that $I = P \cap C$. In this paper we define the \emph{generalized island Johnson graph} of $P$ as t
Externí odkaz:
http://arxiv.org/abs/1202.3455
Autor:
Fabila-Monroy, Ruy, Flores-Peñaloza, David, Huemer, Clemens, Hurtado, Ferran, Urrutia, Jorge, Wood, David R.
Publikováno v:
Graphs and Combinatorics 28.3:365-380, 2012
For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent vertices in $G$.
Externí odkaz:
http://arxiv.org/abs/0910.4774
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.