Results 51 to 60 of about 424,447 (182)
Grid Representations and the Chromatic Number [PDF]
, 2012 A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source
Sensors, 2015 Due to the wide deployment of wireless local area networks (WLAN), received signal strength (RSS)-based indoor WLAN localization has attracted considerable attention in both academia and industry.
Mu Zhou +5 more
doaj +1 more source
Experiments and a User Study for Hierarchical Drawings of Graphs
IEEE Access, 2023 We present a detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF). Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction.
Panagiotis Lionakis +2 more
doaj +1 more source
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
Achieving Good Angular Resolution in 3D Arc Diagrams [PDF]
, 2013 We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D ...
A. Cimikowski +17 more
core +2 more sources
Monotone Grid Drawings of Planar Graphs
, 2013 A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction.
E.M. Arkin +6 more
core +1 more source
Choosing Colors for Geometric Graphs via Color Space Embeddings
, 2006 Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored: assigning ...
Dillencourt, Michael B. +2 more
core +1 more source
Planar Induced Subgraphs of Sparse Graphs [PDF]
, 2014 We show that every graph has an induced pseudoforest of at least $n-m/4.5$ vertices, an induced partial 2-tree of at least $n-m/5$ vertices, and an induced planar subgraph of at least $n-m/5.2174$ vertices. These results are constructive, implying linear-
A. Lubotzky +6 more
core +1 more source
Online Dynamic Graph Drawing [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2008 This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and ...
Yaniv, Frishman, Ayellet, Tal
openaire +2 more sources