Zobrazeno 1 - 10
of 225
pro vyhledávání: '"Meijer, Henk"'
Autor:
Damian, Mirela, Meijer, Henk
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, homeomorphic to a sphere. A polycube layer is the section of the polycube that lies between two horizontal cross-sections of the polycube at unit distanc
Externí odkaz:
http://arxiv.org/abs/2407.01326
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the largest ratio b
Externí odkaz:
http://arxiv.org/abs/2311.14634
Autor:
De Luca, Felice, Di Giacomo, Emilio, Hong, Seok-Hee, Kobourov, Stephen, Lenhart, William, Liotta, Giuseppe, Meijer, Henk, Tappini, Alessandra, Wismath, Stephen
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$ is a tree
Externí odkaz:
http://arxiv.org/abs/1911.01761
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \in \{2,3\}$) is ca
Externí odkaz:
http://arxiv.org/abs/1908.07647
Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of crossings as
Externí odkaz:
http://arxiv.org/abs/1809.08111
We present a number of breakthroughs for coordinated motion planning, in which the objective is to reconfigure a swarm of labeled convex objects by a combination of parallel, continuous, collision-free translations into a given target arrangement. Pr
Externí odkaz:
http://arxiv.org/abs/1801.01689
Autor:
Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.
A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane graph $G$
Externí odkaz:
http://arxiv.org/abs/1706.05161
Autor:
Arleo, Alessio, Binucci, Carla, Di Giacomo, Emilio, Evans, William S., Grilli, Luca, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Whitesides, Sue, Wismath, Stephen
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis. We prove that: $(i)$ Ev
Externí odkaz:
http://arxiv.org/abs/1608.08899
Autor:
Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.
An ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility betwee
Externí odkaz:
http://arxiv.org/abs/1604.08797
Autor:
Binucci, Carla, Di Giacomo, Emilio, Hong, Seok-Hee, Liotta, Giuseppe, Meijer, Henk, Sacristán, Vera, Wismath, Stephen
Publikováno v:
In Computational Geometry: Theory and Applications August 2020 89
